./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncmp-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncmp-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b49f3330156f5f80616a8ed1e7cf6e923644f57628dbe3e9e5b48b44602ac1db --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:34:29,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:34:29,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:34:29,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:34:29,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:34:29,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:34:29,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:34:29,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:34:29,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:34:29,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:34:29,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:34:29,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:34:29,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:34:29,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:34:29,838 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:34:29,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:34:29,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:34:29,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:34:29,839 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:34:29,839 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:34:29,839 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:34:29,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:34:29,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:34:29,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:34:29,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:34:29,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:34:29,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:34:29,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:34:29,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:34:29,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:34:29,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:34:29,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:34:29,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:34:29,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:34:29,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:34:29,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:34:29,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:34:29,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:34:29,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:34:29,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b49f3330156f5f80616a8ed1e7cf6e923644f57628dbe3e9e5b48b44602ac1db [2024-11-22 18:34:30,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:34:30,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:34:30,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:34:30,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:34:30,105 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:34:30,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncmp-alloca-1.i [2024-11-22 18:34:31,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:34:31,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:34:31,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncmp-alloca-1.i [2024-11-22 18:34:31,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e1c9ffd/9313ac6465cd4bb7b2d7aa115c5ba71b/FLAGab7d6c67d [2024-11-22 18:34:31,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e1c9ffd/9313ac6465cd4bb7b2d7aa115c5ba71b [2024-11-22 18:34:31,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:34:31,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:34:31,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:34:31,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:34:31,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:34:31,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:34:31" (1/1) ... [2024-11-22 18:34:31,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556a71ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:31, skipping insertion in model container [2024-11-22 18:34:31,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:34:31" (1/1) ... [2024-11-22 18:34:31,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:34:32,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:34:32,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:34:32,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:34:32,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:34:32,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:34:32,175 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:34:32,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32 WrapperNode [2024-11-22 18:34:32,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:34:32,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:34:32,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:34:32,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:34:32,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,213 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-11-22 18:34:32,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:34:32,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:34:32,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:34:32,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:34:32,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,236 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-22 18:34:32,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:34:32,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:34:32,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:34:32,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:34:32,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (1/1) ... [2024-11-22 18:34:32,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:34:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:32,280 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-22 18:34:32,282 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-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:34:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:34:32,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:34:32,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:34:32,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:34:32,582 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-22 18:34:32,582 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:34:32,594 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:34:32,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 18:34:32,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:34:32 BoogieIcfgContainer [2024-11-22 18:34:32,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:34:32,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:34:32,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:34:32,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:34:32,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:34:31" (1/3) ... [2024-11-22 18:34:32,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4ce12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:34:32, skipping insertion in model container [2024-11-22 18:34:32,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:34:32" (2/3) ... [2024-11-22 18:34:32,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4ce12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:34:32, skipping insertion in model container [2024-11-22 18:34:32,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:34:32" (3/3) ... [2024-11-22 18:34:32,603 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-1.i [2024-11-22 18:34:32,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:34:32,616 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-22 18:34:32,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:34:32,649 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;@49329249, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:34:32,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-22 18:34:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.88) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:34:32,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:32,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:34:32,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-22 18:34:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:32,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187937599] [2024-11-22 18:34:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:32,904 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-22 18:34:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:32,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187937599] [2024-11-22 18:34:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187937599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:34:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309288194] [2024-11-22 18:34:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:34:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:32,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:34:32,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:34:32,932 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.88) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:32,985 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-22 18:34:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:34:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 18:34:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:32,992 INFO L225 Difference]: With dead ends: 40 [2024-11-22 18:34:32,992 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 18:34:32,993 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-22 18:34:32,996 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:32,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 18:34:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 18:34:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-22 18:34:33,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2024-11-22 18:34:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,021 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-22 18:34:33,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-22 18:34:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:34:33,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:34:33,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-22 18:34:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903785569] [2024-11-22 18:34:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,284 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-22 18:34:33,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903785569] [2024-11-22 18:34:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903785569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:34:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786190127] [2024-11-22 18:34:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:34:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:34:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:33,292 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:33,335 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-22 18:34:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:34:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 18:34:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:33,336 INFO L225 Difference]: With dead ends: 41 [2024-11-22 18:34:33,337 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 18:34:33,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:33,338 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:33,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 18:34:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-22 18:34:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-22 18:34:33,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2024-11-22 18:34:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,347 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-22 18:34:33,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-22 18:34:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:34:33,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:34:33,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-22 18:34:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851468675] [2024-11-22 18:34:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,548 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-22 18:34:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851468675] [2024-11-22 18:34:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851468675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:34:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957045677] [2024-11-22 18:34:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:34:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:34:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:33,550 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:33,567 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-22 18:34:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:34:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 18:34:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:33,569 INFO L225 Difference]: With dead ends: 40 [2024-11-22 18:34:33,570 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 18:34:33,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:33,571 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:33,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 18:34:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-22 18:34:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.75) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-22 18:34:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-22 18:34:33,577 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2024-11-22 18:34:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-22 18:34:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-22 18:34:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:34:33,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:34:33,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-22 18:34:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330703320] [2024-11-22 18:34:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,626 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-22 18:34:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330703320] [2024-11-22 18:34:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330703320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:34:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533911313] [2024-11-22 18:34:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:34:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:34:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:34:33,629 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-22 18:34:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:33,654 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-22 18:34:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:34:33,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-22 18:34:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:33,656 INFO L225 Difference]: With dead ends: 36 [2024-11-22 18:34:33,657 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 18:34:33,657 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-22 18:34:33,657 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:33,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 18:34:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-22 18:34:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-22 18:34:33,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2024-11-22 18:34:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,661 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-22 18:34:33,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-22 18:34:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-22 18:34:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:34:33,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:34:33,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-22 18:34:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808635716] [2024-11-22 18:34:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,767 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-22 18:34:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808635716] [2024-11-22 18:34:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808635716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:34:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688425831] [2024-11-22 18:34:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:34:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:34:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:33,770 INFO L87 Difference]: Start difference. First operand 36 states and 41 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-22 18:34:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:33,788 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-22 18:34:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:34:33,788 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-22 18:34:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:33,789 INFO L225 Difference]: With dead ends: 39 [2024-11-22 18:34:33,789 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 18:34:33,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:33,790 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:33,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 18:34:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 18:34:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-22 18:34:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-22 18:34:33,793 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 7 [2024-11-22 18:34:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,793 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-22 18:34:33,793 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-22 18:34:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-22 18:34:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:34:33,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:34:33,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-22 18:34:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634748504] [2024-11-22 18:34:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,893 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-22 18:34:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634748504] [2024-11-22 18:34:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634748504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:34:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508018743] [2024-11-22 18:34:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:34:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:34:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:33,895 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-22 18:34:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:33,910 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-22 18:34:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:34:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-22 18:34:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:33,912 INFO L225 Difference]: With dead ends: 38 [2024-11-22 18:34:33,912 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 18:34:33,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:33,913 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:33,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 18:34:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-22 18:34:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-22 18:34:33,915 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2024-11-22 18:34:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-22 18:34:33,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-22 18:34:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-22 18:34:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:34:33,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:33,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:33,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:34:33,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 624631634, now seen corresponding path program 1 times [2024-11-22 18:34:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141107834] [2024-11-22 18:34:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:33,965 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-22 18:34:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141107834] [2024-11-22 18:34:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141107834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:33,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:34:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790530532] [2024-11-22 18:34:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:34:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:34:33,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:33,968 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,003 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-22 18:34:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:34:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 18:34:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,004 INFO L225 Difference]: With dead ends: 34 [2024-11-22 18:34:34,004 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 18:34:34,004 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-22 18:34:34,004 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 51 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 18:34:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-22 18:34:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-22 18:34:34,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 10 [2024-11-22 18:34:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,007 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-22 18:34:34,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-22 18:34:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:34:34,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:34:34,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 624631635, now seen corresponding path program 1 times [2024-11-22 18:34:34,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984503517] [2024-11-22 18:34:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,089 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-22 18:34:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984503517] [2024-11-22 18:34:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984503517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:34:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550553437] [2024-11-22 18:34:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:34:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:34:34,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:34:34,091 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,130 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-22 18:34:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:34:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 18:34:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,131 INFO L225 Difference]: With dead ends: 41 [2024-11-22 18:34:34,131 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 18:34:34,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:34:34,132 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 18:34:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-22 18:34:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-22 18:34:34,135 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 10 [2024-11-22 18:34:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,135 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-22 18:34:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-22 18:34:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:34:34,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:34:34,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256466, now seen corresponding path program 1 times [2024-11-22 18:34:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011249332] [2024-11-22 18:34:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,222 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-22 18:34:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011249332] [2024-11-22 18:34:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011249332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:34:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935478819] [2024-11-22 18:34:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:34:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:34:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:34,224 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,243 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-22 18:34:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:34:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:34:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,246 INFO L225 Difference]: With dead ends: 37 [2024-11-22 18:34:34,246 INFO L226 Difference]: Without dead ends: 33 [2024-11-22 18:34:34,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:34:34,246 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-22 18:34:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-22 18:34:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.52) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-22 18:34:34,248 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-22 18:34:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-22 18:34:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-22 18:34:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:34:34,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:34:34,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1024421037, now seen corresponding path program 1 times [2024-11-22 18:34:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733895478] [2024-11-22 18:34:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,305 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-22 18:34:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733895478] [2024-11-22 18:34:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733895478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:34:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071036032] [2024-11-22 18:34:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:34:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:34:34,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:34,307 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-22 18:34:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,343 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-22 18:34:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:34:34,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-22 18:34:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,344 INFO L225 Difference]: With dead ends: 32 [2024-11-22 18:34:34,344 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 18:34:34,344 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-22 18:34:34,345 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 18:34:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 18:34:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-22 18:34:34,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2024-11-22 18:34:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,347 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-22 18:34:34,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-22 18:34:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-22 18:34:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:34:34,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:34:34,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1024421036, now seen corresponding path program 1 times [2024-11-22 18:34:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545511132] [2024-11-22 18:34:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,447 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-22 18:34:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545511132] [2024-11-22 18:34:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545511132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:34:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047158191] [2024-11-22 18:34:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:34:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:34:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:34:34,449 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-22 18:34:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,501 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-22 18:34:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:34:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-22 18:34:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,502 INFO L225 Difference]: With dead ends: 32 [2024-11-22 18:34:34,502 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 18:34:34,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:34:34,503 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 18:34:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 18:34:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-22 18:34:34,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2024-11-22 18:34:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-22 18:34:34,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-22 18:34:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-22 18:34:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:34:34,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:34:34,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -921105132, now seen corresponding path program 1 times [2024-11-22 18:34:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088381905] [2024-11-22 18:34:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,585 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-22 18:34:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088381905] [2024-11-22 18:34:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088381905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:34:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796844969] [2024-11-22 18:34:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:34:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:34:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:34,587 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-22 18:34:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,618 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-22 18:34:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:34:34,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-22 18:34:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,619 INFO L225 Difference]: With dead ends: 31 [2024-11-22 18:34:34,619 INFO L226 Difference]: Without dead ends: 31 [2024-11-22 18:34:34,619 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-22 18:34:34,619 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-22 18:34:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-22 18:34:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-22 18:34:34,621 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2024-11-22 18:34:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-22 18:34:34,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-22 18:34:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-22 18:34:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:34:34,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:34:34,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -921105131, now seen corresponding path program 1 times [2024-11-22 18:34:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67920930] [2024-11-22 18:34:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,715 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-22 18:34:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67920930] [2024-11-22 18:34:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67920930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:34:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488170598] [2024-11-22 18:34:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:34:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:34:34,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:34:34,717 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-22 18:34:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,754 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-22 18:34:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:34:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-22 18:34:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,755 INFO L225 Difference]: With dead ends: 32 [2024-11-22 18:34:34,755 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 18:34:34,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:34:34,756 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 18:34:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 18:34:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-22 18:34:34,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2024-11-22 18:34:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-22 18:34:34,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-22 18:34:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-22 18:34:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:34:34,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:34:34,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -419075947, now seen corresponding path program 1 times [2024-11-22 18:34:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086738485] [2024-11-22 18:34:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:34,810 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-22 18:34:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086738485] [2024-11-22 18:34:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086738485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:34:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706223480] [2024-11-22 18:34:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:34,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:34:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:34:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:34,812 INFO L87 Difference]: Start difference. First operand 32 states and 35 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-22 18:34:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:34,832 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-22 18:34:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:34:34,832 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-22 18:34:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:34,832 INFO L225 Difference]: With dead ends: 31 [2024-11-22 18:34:34,833 INFO L226 Difference]: Without dead ends: 31 [2024-11-22 18:34:34,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:34:34,833 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:34,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-22 18:34:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-22 18:34:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-22 18:34:34,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2024-11-22 18:34:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:34,835 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-22 18:34:34,835 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-22 18:34:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-22 18:34:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:34:34,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:34,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:34,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:34:34,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:34,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -419075946, now seen corresponding path program 1 times [2024-11-22 18:34:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641100345] [2024-11-22 18:34:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:35,009 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-22 18:34:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641100345] [2024-11-22 18:34:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641100345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:35,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:34:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818152974] [2024-11-22 18:34:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:35,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:34:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:34:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:34:35,012 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 18:34:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:35,092 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-22 18:34:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:34:35,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 18:34:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:35,092 INFO L225 Difference]: With dead ends: 39 [2024-11-22 18:34:35,092 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 18:34:35,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:34:35,093 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:35,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:34:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 18:34:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-11-22 18:34:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 29 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-22 18:34:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-22 18:34:35,095 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 16 [2024-11-22 18:34:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:35,098 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-22 18:34:35,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 18:34:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-22 18:34:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:34:35,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:35,099 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-22 18:34:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:34:35,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1290900053, now seen corresponding path program 1 times [2024-11-22 18:34:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368535857] [2024-11-22 18:34:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:35,260 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-22 18:34:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368535857] [2024-11-22 18:34:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368535857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:35,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:34:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81211924] [2024-11-22 18:34:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:35,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:34:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:35,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:34:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:34:35,264 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:35,298 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-22 18:34:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:34:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-22 18:34:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:35,298 INFO L225 Difference]: With dead ends: 42 [2024-11-22 18:34:35,299 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 18:34:35,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:34:35,299 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:35,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 18:34:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 18:34:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 29 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-22 18:34:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-22 18:34:35,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2024-11-22 18:34:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:35,302 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-22 18:34:35,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-22 18:34:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:34:35,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:35,302 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-22 18:34:35,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:34:35,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 269831699, now seen corresponding path program 1 times [2024-11-22 18:34:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902562510] [2024-11-22 18:34:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:35,579 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-22 18:34:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:35,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902562510] [2024-11-22 18:34:35,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902562510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:35,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833008651] [2024-11-22 18:34:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:35,582 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-22 18:34:35,583 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-22 18:34:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:35,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:34:35,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:35,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:34:35,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:34:35,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-22 18:34:36,016 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-22 18:34:36,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:34:36,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-22 18:34:36,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-22 18:34:36,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:34:36,251 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-22 18:34:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833008651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:34:36,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:34:36,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-22 18:34:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623053148] [2024-11-22 18:34:36,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:34:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:34:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:34:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:34:36,254 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-22 18:34:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:36,455 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-22 18:34:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:34:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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-22 18:34:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:36,456 INFO L225 Difference]: With dead ends: 38 [2024-11-22 18:34:36,456 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 18:34:36,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:34:36,457 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:36,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 156 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:34:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 18:34:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-22 18:34:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-22 18:34:36,460 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2024-11-22 18:34:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:36,460 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-22 18:34:36,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-22 18:34:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-22 18:34:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:34:36,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:36,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:36,469 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-22 18:34:36,665 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,SelfDestructingSolverStorable16 [2024-11-22 18:34:36,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1610224148, now seen corresponding path program 1 times [2024-11-22 18:34:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825863217] [2024-11-22 18:34:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:36,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:36,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825863217] [2024-11-22 18:34:36,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825863217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:36,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:34:36,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:34:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126899520] [2024-11-22 18:34:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:36,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:34:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:36,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:34:36,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:34:36,920 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:36,988 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2024-11-22 18:34:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:34:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 18:34:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:36,989 INFO L225 Difference]: With dead ends: 44 [2024-11-22 18:34:36,989 INFO L226 Difference]: Without dead ends: 33 [2024-11-22 18:34:36,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:34:36,990 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:36,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:34:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-22 18:34:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-22 18:34:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-22 18:34:36,992 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2024-11-22 18:34:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:36,992 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-22 18:34:36,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-22 18:34:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:34:36,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:36,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:34:36,993 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash 21876246, now seen corresponding path program 1 times [2024-11-22 18:34:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065852120] [2024-11-22 18:34:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065852120] [2024-11-22 18:34:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065852120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906567354] [2024-11-22 18:34:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:37,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:37,492 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-22 18:34:37,494 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-22 18:34:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:37,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-22 18:34:37,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:37,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:34:37,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:34:37,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-22 18:34:37,925 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 27 treesize of output 19 [2024-11-22 18:34:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:38,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:34:38,260 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 22 treesize of output 14 [2024-11-22 18:34:38,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-22 18:34:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-22 18:34:38,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:34:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906567354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:34:38,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:34:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2024-11-22 18:34:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641146894] [2024-11-22 18:34:38,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:34:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-22 18:34:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-22 18:34:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 18:34:38,417 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-22 18:34:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:38,800 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2024-11-22 18:34:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:34:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 18:34:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:38,801 INFO L225 Difference]: With dead ends: 35 [2024-11-22 18:34:38,801 INFO L226 Difference]: Without dead ends: 35 [2024-11-22 18:34:38,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 18:34:38,802 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:38,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:34:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-22 18:34:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-22 18:34:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-22 18:34:38,807 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 20 [2024-11-22 18:34:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-22 18:34:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-22 18:34:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-22 18:34:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:34:38,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:38,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:38,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 18:34:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:39,009 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -451764393, now seen corresponding path program 1 times [2024-11-22 18:34:39,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:39,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931513742] [2024-11-22 18:34:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931513742] [2024-11-22 18:34:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931513742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898325485] [2024-11-22 18:34:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:39,110 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-22 18:34:39,111 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-22 18:34:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:39,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:34:39,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:39,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:34:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-22 18:34:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898325485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:34:39,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:34:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-22 18:34:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019975241] [2024-11-22 18:34:39,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:34:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:34:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:34:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:34:39,239 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-22 18:34:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:39,289 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-11-22 18:34:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:34:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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 22 [2024-11-22 18:34:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:39,290 INFO L225 Difference]: With dead ends: 34 [2024-11-22 18:34:39,290 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 18:34:39,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:34:39,291 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:39,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 18:34:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-22 18:34:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-22 18:34:39,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 22 [2024-11-22 18:34:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:39,292 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-11-22 18:34:39,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-22 18:34:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-22 18:34:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:34:39,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:39,292 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] [2024-11-22 18:34:39,300 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-22 18:34:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:39,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -354192808, now seen corresponding path program 1 times [2024-11-22 18:34:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209243852] [2024-11-22 18:34:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209243852] [2024-11-22 18:34:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209243852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888789435] [2024-11-22 18:34:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:39,649 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-22 18:34:39,649 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-22 18:34:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:39,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 18:34:39,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:39,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:34:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888789435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:34:39,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:34:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-11-22 18:34:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549735848] [2024-11-22 18:34:39,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:34:39,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:34:39,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:34:39,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:34:39,754 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:39,792 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-22 18:34:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:34:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 18:34:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:39,792 INFO L225 Difference]: With dead ends: 33 [2024-11-22 18:34:39,792 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 18:34:39,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:34:39,793 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:39,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 89 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:34:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 18:34:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 18:34:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 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-22 18:34:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-22 18:34:39,794 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2024-11-22 18:34:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-22 18:34:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-22 18:34:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:34:39,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:39,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:39,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:34:39,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:40,000 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:40,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -780913769, now seen corresponding path program 1 times [2024-11-22 18:34:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:40,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500955922] [2024-11-22 18:34:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:40,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:40,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500955922] [2024-11-22 18:34:40,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500955922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:40,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3821890] [2024-11-22 18:34:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:34:40,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:40,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:34:40,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:34:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:34:40,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 18:34:40,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:40,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:34:40,763 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-22 18:34:40,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2024-11-22 18:34:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:40,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:34:41,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-22 18:34:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-22 18:34:41,138 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 15 treesize of output 11 [2024-11-22 18:34:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3821890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:34:41,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:34:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-11-22 18:34:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702959458] [2024-11-22 18:34:41,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:34:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 18:34:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 18:34:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2024-11-22 18:34:41,181 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:41,490 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2024-11-22 18:34:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:34:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 18:34:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:41,495 INFO L225 Difference]: With dead ends: 45 [2024-11-22 18:34:41,495 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 18:34:41,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 18:34:41,496 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:41,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:34:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 18:34:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-22 18:34:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-11-22 18:34:41,500 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2024-11-22 18:34:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:41,501 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-11-22 18:34:41,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-11-22 18:34:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:34:41,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:41,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:41,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:34:41,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:34:41,702 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1161143960, now seen corresponding path program 2 times [2024-11-22 18:34:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622700877] [2024-11-22 18:34:41,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:34:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:41,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:34:41,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:34:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622700877] [2024-11-22 18:34:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622700877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349613720] [2024-11-22 18:34:42,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:34:42,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:42,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:42,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:34:42,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:34:42,399 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:34:42,399 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:34:42,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-22 18:34:42,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:42,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-22 18:34:42,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-22 18:34:42,463 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 8 treesize of output 1 [2024-11-22 18:34:42,479 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 18 treesize of output 14 [2024-11-22 18:34:42,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:34:42,849 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 22 treesize of output 21 [2024-11-22 18:34:42,953 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 21 treesize of output 13 [2024-11-22 18:34:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:43,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:34:47,681 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 24 treesize of output 22 [2024-11-22 18:34:47,685 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 44 treesize of output 38 [2024-11-22 18:34:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349613720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:34:47,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:34:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 44 [2024-11-22 18:34:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440572580] [2024-11-22 18:34:47,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:34:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-22 18:34:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:34:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-22 18:34:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1809, Unknown=1, NotChecked=0, Total=1980 [2024-11-22 18:34:47,831 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:34:57,712 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2024-11-22 18:34:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 18:34:57,713 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 18:34:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:34:57,713 INFO L225 Difference]: With dead ends: 55 [2024-11-22 18:34:57,713 INFO L226 Difference]: Without dead ends: 55 [2024-11-22 18:34:57,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=457, Invalid=4096, Unknown=3, NotChecked=0, Total=4556 [2024-11-22 18:34:57,715 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:34:57,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 191 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 504 Invalid, 3 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 18:34:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-22 18:34:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-22 18:34:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-11-22 18:34:57,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 28 [2024-11-22 18:34:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:34:57,717 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-11-22 18:34:57,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:34:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-22 18:34:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:34:57,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:34:57,717 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:34:57,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 18:34:57,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:57,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:34:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:34:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 297660315, now seen corresponding path program 2 times [2024-11-22 18:34:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:34:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962592066] [2024-11-22 18:34:57,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:34:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:34:57,953 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:34:57,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:34:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:34:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962592066] [2024-11-22 18:34:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962592066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:34:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528272737] [2024-11-22 18:34:58,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:34:58,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:34:58,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:34:58,514 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:34:58,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:34:58,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:34:58,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:34:58,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-22 18:34:58,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:34:58,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:34:59,533 INFO L349 Elim1Store]: treesize reduction 12, result has 72.7 percent of original size [2024-11-22 18:34:59,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 50 [2024-11-22 18:34:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:34:59,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:35:00,364 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 59 treesize of output 51 [2024-11-22 18:35:00,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2024-11-22 18:35:00,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:35:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528272737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:35:00,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:35:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2024-11-22 18:35:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831250694] [2024-11-22 18:35:00,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:35:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-22 18:35:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:35:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-22 18:35:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2024-11-22 18:35:00,413 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 43 states, 42 states have (on average 2.761904761904762) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-22 18:35:04,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:35:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:35:04,771 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-11-22 18:35:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:35:04,772 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.761904761904762) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 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 42 [2024-11-22 18:35:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:35:04,772 INFO L225 Difference]: With dead ends: 53 [2024-11-22 18:35:04,772 INFO L226 Difference]: Without dead ends: 53 [2024-11-22 18:35:04,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=374, Invalid=2932, Unknown=0, NotChecked=0, Total=3306 [2024-11-22 18:35:04,773 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:35:04,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 331 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 542 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 18:35:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-22 18:35:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-22 18:35:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-22 18:35:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-11-22 18:35:04,775 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2024-11-22 18:35:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:35:04,776 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-11-22 18:35:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.761904761904762) internal successors, (116), 43 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-22 18:35:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-11-22 18:35:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-22 18:35:04,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:35:04,778 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:35:04,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:35:04,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:35:04,982 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:35:04,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:35:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 979854366, now seen corresponding path program 3 times [2024-11-22 18:35:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:35:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374611404] [2024-11-22 18:35:04,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:35:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:35:05,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 18:35:05,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:35:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:35:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374611404] [2024-11-22 18:35:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374611404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:35:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298401459] [2024-11-22 18:35:05,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:35:05,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:35:05,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:35:05,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:35:05,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 18:35:05,891 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 18:35:05,891 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:35:05,894 WARN L253 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 162 conjuncts are in the unsatisfiable core [2024-11-22 18:35:05,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:35:05,942 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 8 treesize of output 1 [2024-11-22 18:35:05,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:35:08,077 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-11-22 18:35:08,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 59 [2024-11-22 18:35:08,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:35:08,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 35 [2024-11-22 18:35:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:08,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:35:11,135 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 15 treesize of output 11 [2024-11-22 18:35:11,139 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 107 treesize of output 97 [2024-11-22 18:35:11,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 147 [2024-11-22 18:35:11,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:35:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 16 [2024-11-22 18:35:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:11,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298401459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:35:11,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:35:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 36, 37] total 90 [2024-11-22 18:35:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145099192] [2024-11-22 18:35:11,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:35:11,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2024-11-22 18:35:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:35:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2024-11-22 18:35:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=7502, Unknown=0, NotChecked=0, Total=8190 [2024-11-22 18:35:11,337 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 91 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 91 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-22 18:35:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:35:15,522 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2024-11-22 18:35:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-22 18:35:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 91 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-22 18:35:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:35:15,523 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:35:15,523 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 18:35:15,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6092 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1989, Invalid=18317, Unknown=0, NotChecked=0, Total=20306 [2024-11-22 18:35:15,527 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:35:15,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 692 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 18:35:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 18:35:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 18:35:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-22 18:35:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2024-11-22 18:35:15,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 52 [2024-11-22 18:35:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:35:15,528 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2024-11-22 18:35:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 91 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-22 18:35:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2024-11-22 18:35:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 18:35:15,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:35:15,530 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:35:15,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 18:35:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-22 18:35:15,730 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-22 18:35:15,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:35:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1161190744, now seen corresponding path program 4 times [2024-11-22 18:35:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:35:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220002312] [2024-11-22 18:35:15,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:35:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:35:15,813 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:35:15,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:35:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:35:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220002312] [2024-11-22 18:35:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220002312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:35:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408958965] [2024-11-22 18:35:16,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:35:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:35:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:35:16,908 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:35:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:35:17,030 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:35:17,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:35:17,034 WARN L253 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 284 conjuncts are in the unsatisfiable core [2024-11-22 18:35:17,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:35:17,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:35:17,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:35:26,616 INFO L349 Elim1Store]: treesize reduction 36, result has 55.6 percent of original size [2024-11-22 18:35:26,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 137 treesize of output 114 [2024-11-22 18:35:26,624 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-11-22 18:35:26,642 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-11-22 18:35:27,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:35:27,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 99 treesize of output 55 [2024-11-22 18:35:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:27,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:35:41,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:35:41,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 245 treesize of output 129 [2024-11-22 18:35:41,584 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 149 treesize of output 129 [2024-11-22 18:35:41,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 111 [2024-11-22 18:35:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:35:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408958965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:35:41,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:35:41,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 66, 66] total 150 [2024-11-22 18:35:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736132035] [2024-11-22 18:35:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:35:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 151 states [2024-11-22 18:35:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:35:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2024-11-22 18:35:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=20790, Unknown=0, NotChecked=0, Total=22650 [2024-11-22 18:35:41,869 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 151 states, 150 states have (on average 1.76) internal successors, (264), 151 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)