./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/substring-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 79a0aa7f506a25068fe5f831c3bf60ccd6ee82a9d4cedb42c580c3cecf620506 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:37:54,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:37:55,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:37:55,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:37:55,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:37:55,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:37:55,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:37:55,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:37:55,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:37:55,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:37:55,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:37:55,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:37:55,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:37:55,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:37:55,108 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:37:55,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:37:55,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:37:55,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:37:55,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:37:55,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:37:55,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:37:55,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:37:55,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:37:55,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:37:55,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:37:55,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:37:55,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:37:55,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:37:55,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:37:55,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:37:55,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:55,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:37:55,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:37:55,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:37:55,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:37:55,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:37:55,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:37:55,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:37:55,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:37:55,122 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 -> 79a0aa7f506a25068fe5f831c3bf60ccd6ee82a9d4cedb42c580c3cecf620506 [2024-11-09 07:37:55,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:37:55,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:37:55,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:37:55,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:37:55,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:37:55,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2024-11-09 07:37:56,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:37:57,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:37:57,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2024-11-09 07:37:57,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912dc868/d118356b2faf4f37a73ebcc9d436cb10/FLAGdc3b790c1 [2024-11-09 07:37:57,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912dc868/d118356b2faf4f37a73ebcc9d436cb10 [2024-11-09 07:37:57,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:37:57,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:37:57,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:57,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:37:57,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:37:57,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac5140c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57, skipping insertion in model container [2024-11-09 07:37:57,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:37:57,504 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-09 07:37:57,509 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-09 07:37:57,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:57,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:37:57,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:57,621 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:37:57,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57 WrapperNode [2024-11-09 07:37:57,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:57,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:57,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:37:57,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:37:57,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,669 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-09 07:37:57,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:57,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:37:57,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:37:57,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:37:57,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,695 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 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-09 07:37:57,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:37:57,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:37:57,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:37:57,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:37:57,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (1/1) ... [2024-11-09 07:37:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:57,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:37:57,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:37:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:37:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:37:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:37:57,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:37:57,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:37:58,161 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-09 07:37:58,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:37:58,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:37:58,179 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:37:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:58 BoogieIcfgContainer [2024-11-09 07:37:58,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:37:58,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:37:58,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:37:58,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:37:58,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:37:57" (1/3) ... [2024-11-09 07:37:58,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6bbd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:58, skipping insertion in model container [2024-11-09 07:37:58,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:57" (2/3) ... [2024-11-09 07:37:58,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6bbd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:58, skipping insertion in model container [2024-11-09 07:37:58,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:58" (3/3) ... [2024-11-09 07:37:58,188 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca-1.i [2024-11-09 07:37:58,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:37:58,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-09 07:37:58,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:37:58,255 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;@4888ce8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:37:58,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 07:37:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 2.0) internal successors, (46), 38 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-09 07:37:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:58,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:58,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:58,266 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-09 07:37:58,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-09 07:37:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549262196] [2024-11-09 07:37:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549262196] [2024-11-09 07:37:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549262196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:37:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580985749] [2024-11-09 07:37:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:58,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:37:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:37:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:58,659 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 2.0) internal successors, (46), 38 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) 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-09 07:37:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:58,712 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-09 07:37:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:37:58,715 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-09 07:37:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:58,722 INFO L225 Difference]: With dead ends: 38 [2024-11-09 07:37:58,723 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:37:58,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:58,728 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 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-09 07:37:58,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:37:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 07:37:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.8636363636363635) 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-09 07:37:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-09 07:37:58,797 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 6 [2024-11-09 07:37:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:58,798 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-09 07:37:58,798 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-09 07:37:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-09 07:37:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:58,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:58,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:58,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:37:58,803 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-09 07:37:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-09 07:37:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:58,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743931475] [2024-11-09 07:37:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743931475] [2024-11-09 07:37:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743931475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512521642] [2024-11-09 07:37:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:59,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:59,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:59,136 INFO L87 Difference]: Start difference. First operand 36 states and 41 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-09 07:37:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:59,204 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-09 07:37:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:59,205 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-09 07:37:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:59,205 INFO L225 Difference]: With dead ends: 39 [2024-11-09 07:37:59,205 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 07:37:59,206 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-09 07:37:59,207 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:59,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 07:37:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 07:37:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.8) internal successors, (45), 38 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-09 07:37:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-09 07:37:59,217 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 6 [2024-11-09 07:37:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:59,218 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-09 07:37:59,218 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-09 07:37:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-09 07:37:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:59,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:59,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:59,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:37:59,220 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-09 07:37:59,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-09 07:37:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347743123] [2024-11-09 07:37:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347743123] [2024-11-09 07:37:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347743123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885553627] [2024-11-09 07:37:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:59,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:59,458 INFO L87 Difference]: Start difference. First operand 39 states and 45 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-09 07:37:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:59,510 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-09 07:37:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:59,511 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-09 07:37:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:59,511 INFO L225 Difference]: With dead ends: 38 [2024-11-09 07:37:59,511 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 07:37:59,512 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-09 07:37:59,513 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:59,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 07:37:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 07:37:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.8181818181818181) 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-09 07:37:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 07:37:59,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 6 [2024-11-09 07:37:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 07:37:59,521 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-09 07:37:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 07:37:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:37:59,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:59,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:59,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:37:59,523 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-09 07:37:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-09 07:37:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753786273] [2024-11-09 07:37:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:59,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753786273] [2024-11-09 07:37:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753786273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:37:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848826295] [2024-11-09 07:37:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:59,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:37:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:37:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:59,585 INFO L87 Difference]: Start difference. First operand 35 states and 40 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-09 07:37:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:59,627 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 07:37:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:37:59,628 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-09 07:37:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:59,629 INFO L225 Difference]: With dead ends: 34 [2024-11-09 07:37:59,629 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:37:59,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:59,631 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 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-09 07:37:59,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:37:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 07:37:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 07:37:59,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 7 [2024-11-09 07:37:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 07:37:59,638 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-09 07:37:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 07:37:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:37:59,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:59,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:59,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:37:59,639 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-09 07:37:59,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-09 07:37:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:59,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250706275] [2024-11-09 07:37:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:59,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:59,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250706275] [2024-11-09 07:37:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250706275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:59,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:59,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:59,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972012143] [2024-11-09 07:37:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:59,812 INFO L87 Difference]: Start difference. First operand 34 states and 39 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-09 07:37:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:59,890 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-09 07:37:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:59,913 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-09 07:37:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:59,914 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:37:59,914 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 07:37:59,914 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-09 07:37:59,915 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:59,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 07:37:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 07:37:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.68) 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-09 07:37:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-09 07:37:59,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 7 [2024-11-09 07:37:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:59,929 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-09 07:37:59,929 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-09 07:37:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-09 07:37:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:37:59,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:59,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:59,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:37:59,930 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-09 07:37:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-09 07:37:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:59,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198589345] [2024-11-09 07:37:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198589345] [2024-11-09 07:38:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198589345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:38:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110937892] [2024-11-09 07:38:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:38:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:38:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:38:00,077 INFO L87 Difference]: Start difference. First operand 37 states and 42 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-09 07:38:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:00,117 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-09 07:38:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:38:00,118 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-09 07:38:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:00,120 INFO L225 Difference]: With dead ends: 36 [2024-11-09 07:38:00,120 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:38:00,121 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-09 07:38:00,121 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:00,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:38:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-09 07:38:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.7272727272727273) 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-09 07:38:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 07:38:00,129 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 7 [2024-11-09 07:38:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:00,132 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 07:38:00,133 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-09 07:38:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 07:38:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:38:00,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:00,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:38:00,134 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-09 07:38:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-11-09 07:38:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825010446] [2024-11-09 07:38:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825010446] [2024-11-09 07:38:00,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825010446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316537291] [2024-11-09 07:38:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:00,193 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:00,237 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-09 07:38:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:38:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:00,238 INFO L225 Difference]: With dead ends: 32 [2024-11-09 07:38:00,238 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:38:00,238 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-09 07:38:00,239 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:00,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:38:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 07:38:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 07:38:00,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 9 [2024-11-09 07:38:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 07:38:00,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 07:38:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:38:00,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:00,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:00,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:38:00,247 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-09 07:38:00,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash -534039920, now seen corresponding path program 1 times [2024-11-09 07:38:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153089322] [2024-11-09 07:38:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153089322] [2024-11-09 07:38:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153089322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:38:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677498109] [2024-11-09 07:38:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:38:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:38:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:00,377 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:00,444 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-09 07:38:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:38:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:38:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:00,445 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:38:00,445 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 07:38:00,445 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-09 07:38:00,446 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:00,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 07:38:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2024-11-09 07:38:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.6521739130434783) 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-09 07:38:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 07:38:00,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2024-11-09 07:38:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:00,453 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 07:38:00,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 07:38:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:38:00,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:00,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:38:00,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2111255724, now seen corresponding path program 1 times [2024-11-09 07:38:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055782509] [2024-11-09 07:38:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055782509] [2024-11-09 07:38:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055782509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:38:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106988749] [2024-11-09 07:38:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:38:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:38:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:38:00,517 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:00,576 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-09 07:38:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:38:00,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:38:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:00,577 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:38:00,577 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:38:00,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:00,578 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:00,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 46 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:38:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 07:38:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 07:38:00,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-11-09 07:38:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:00,583 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 07:38:00,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 07:38:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:38:00,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:00,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:00,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:38:00,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:00,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2111255723, now seen corresponding path program 1 times [2024-11-09 07:38:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:00,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205041497] [2024-11-09 07:38:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205041497] [2024-11-09 07:38:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205041497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:38:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527358830] [2024-11-09 07:38:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:38:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:38:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:38:00,764 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:00,853 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-09 07:38:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:38:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:38:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:00,855 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:38:00,855 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 07:38:00,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:38:00,856 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:00,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 89 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 07:38:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 07:38:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 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-09 07:38:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 07:38:00,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 11 [2024-11-09 07:38:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:00,860 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 07:38:00,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-09 07:38:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:38:00,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:00,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:00,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:38:00,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:00,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1692210533, now seen corresponding path program 1 times [2024-11-09 07:38:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285201978] [2024-11-09 07:38:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285201978] [2024-11-09 07:38:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285201978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:00,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:00,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:00,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473617351] [2024-11-09 07:38:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:00,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:00,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:00,992 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:01,017 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-09 07:38:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:38:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:01,018 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:38:01,018 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:38:01,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:01,018 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:01,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:38:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 07:38:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.5) internal successors, (42), 33 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-09 07:38:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-09 07:38:01,021 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2024-11-09 07:38:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-09 07:38:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-09 07:38:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:38:01,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:01,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:38:01,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:01,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1601229708, now seen corresponding path program 1 times [2024-11-09 07:38:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221650756] [2024-11-09 07:38:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:01,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221650756] [2024-11-09 07:38:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221650756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:01,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356912203] [2024-11-09 07:38:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:38:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:38:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:38:01,052 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:01,060 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-09 07:38:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:38:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:38:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:01,061 INFO L225 Difference]: With dead ends: 36 [2024-11-09 07:38:01,061 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:38:01,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:38:01,064 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:01,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:38:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 07:38:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 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-09 07:38:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-09 07:38:01,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 15 [2024-11-09 07:38:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:01,069 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-09 07:38:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-09 07:38:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:38:01,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:01,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:38:01,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:01,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1601220634, now seen corresponding path program 1 times [2024-11-09 07:38:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603909146] [2024-11-09 07:38:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603909146] [2024-11-09 07:38:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603909146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330414364] [2024-11-09 07:38:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:01,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:01,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:01,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:01,121 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:01,155 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-09 07:38:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:01,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:38:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:01,156 INFO L225 Difference]: With dead ends: 35 [2024-11-09 07:38:01,156 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 07:38:01,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:38:01,157 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:01,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 07:38:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 07:38:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 34 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-09 07:38:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-09 07:38:01,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 15 [2024-11-09 07:38:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-09 07:38:01,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-09 07:38:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:38:01,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:01,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:01,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:38:01,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1601220635, now seen corresponding path program 1 times [2024-11-09 07:38:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972048660] [2024-11-09 07:38:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972048660] [2024-11-09 07:38:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972048660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:38:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667832763] [2024-11-09 07:38:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:38:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:38:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:38:01,324 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:01,416 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-09 07:38:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:38:01,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:38:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:01,419 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:38:01,419 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:38:01,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:38:01,419 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:01,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 54 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:38:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2024-11-09 07:38:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-09 07:38:01,424 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 15 [2024-11-09 07:38:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:01,425 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-09 07:38:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-09 07:38:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:38:01,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:01,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:38:01,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1183422171, now seen corresponding path program 1 times [2024-11-09 07:38:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195427374] [2024-11-09 07:38:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195427374] [2024-11-09 07:38:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195427374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:38:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426865468] [2024-11-09 07:38:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:01,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:38:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:38:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:01,506 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:01,539 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-09 07:38:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:38:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:38:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:01,540 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:38:01,541 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:38:01,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:01,541 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:01,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:38:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 07:38:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) 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-09 07:38:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 07:38:01,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 17 [2024-11-09 07:38:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:01,544 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 07:38:01,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 07:38:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:38:01,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:01,549 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-09 07:38:01,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:38:01,549 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:01,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2057140200, now seen corresponding path program 1 times [2024-11-09 07:38:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540505947] [2024-11-09 07:38:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540505947] [2024-11-09 07:38:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540505947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:01,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:38:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220409477] [2024-11-09 07:38:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:01,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:38:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:38:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:38:01,851 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-09 07:38:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:02,067 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-09 07:38:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:38:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-09 07:38:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:02,068 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:38:02,068 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:38:02,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:38:02,069 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:02,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 150 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:38:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-09 07:38:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-09 07:38:02,074 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 18 [2024-11-09 07:38:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:02,074 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-09 07:38:02,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-09 07:38:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-09 07:38:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:38:02,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:02,074 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-09 07:38:02,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:38:02,075 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:02,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1036071846, now seen corresponding path program 1 times [2024-11-09 07:38:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:02,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628532101] [2024-11-09 07:38:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628532101] [2024-11-09 07:38:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628532101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:38:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255849493] [2024-11-09 07:38:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:38:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:38:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:38:02,265 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-09 07:38:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:02,339 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-09 07:38:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:38:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-09 07:38:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:02,340 INFO L225 Difference]: With dead ends: 73 [2024-11-09 07:38:02,340 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:38:02,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:38:02,341 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:02,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:38:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 07:38:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-09 07:38:02,343 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2024-11-09 07:38:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:02,343 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-09 07:38:02,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-09 07:38:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-09 07:38:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:38:02,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:02,344 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-09 07:38:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:38:02,344 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-09 07:38:02,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash -243791832, now seen corresponding path program 1 times [2024-11-09 07:38:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33851532] [2024-11-09 07:38:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33851532] [2024-11-09 07:38:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33851532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372313657] [2024-11-09 07:38:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:02,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:38:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:02,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:38:02,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:02,832 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-09 07:38:03,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:03,073 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 18 treesize of output 19 [2024-11-09 07:38:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:03,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:03,578 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-09 07:38:03,583 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-09 07:38:03,591 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-09 07:38:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:03,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372313657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:03,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:03,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2024-11-09 07:38:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290824671] [2024-11-09 07:38:03,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:03,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:38:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:38:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:38:03,613 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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-09 07:38:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:04,680 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-09 07:38:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:38:04,680 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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-09 07:38:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:04,681 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:38:04,681 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:38:04,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 07:38:04,682 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 145 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:04,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 152 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:38:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:38:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-11-09 07:38:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 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-09 07:38:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-09 07:38:04,685 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 18 [2024-11-09 07:38:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-09 07:38:04,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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-09 07:38:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-09 07:38:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:38:04,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:04,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:04,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:38:04,892 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,SelfDestructingSolverStorable17 [2024-11-09 07:38:04,893 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -361607111, now seen corresponding path program 1 times [2024-11-09 07:38:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:04,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704805557] [2024-11-09 07:38:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704805557] [2024-11-09 07:38:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704805557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:38:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883315884] [2024-11-09 07:38:05,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:38:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:38:05,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:38:05,042 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:05,071 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-09 07:38:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:38:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:38:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:05,072 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:38:05,072 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 07:38:05,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:38:05,073 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:05,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 07:38:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 07:38:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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-09 07:38:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 07:38:05,075 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2024-11-09 07:38:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:05,076 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 07:38:05,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 07:38:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:38:05,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:05,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:05,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:38:05,078 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1939215479, now seen corresponding path program 1 times [2024-11-09 07:38:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079854523] [2024-11-09 07:38:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079854523] [2024-11-09 07:38:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079854523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340803524] [2024-11-09 07:38:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:05,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:05,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:05,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:38:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:05,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:38:05,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:05,401 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-09 07:38:05,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:05,510 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 18 treesize of output 19 [2024-11-09 07:38:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:05,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:05,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:38:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:38:05,816 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-09 07:38:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340803524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:05,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-11-09 07:38:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406580724] [2024-11-09 07:38:05,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:38:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:38:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:38:05,830 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 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-09 07:38:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:06,052 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-09 07:38:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:38:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 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) Word has length 20 [2024-11-09 07:38:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:06,053 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:38:06,053 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:38:06,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:38:06,054 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:06,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 108 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:38:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2024-11-09 07:38:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-09 07:38:06,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 20 [2024-11-09 07:38:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:06,064 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-09 07:38:06,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 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-09 07:38:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-09 07:38:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:38:06,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:06,065 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-09 07:38:06,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:38:06,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 07:38:06,266 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-09 07:38:06,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash -396407954, now seen corresponding path program 1 times [2024-11-09 07:38:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789163566] [2024-11-09 07:38:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:06,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789163566] [2024-11-09 07:38:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789163566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:06,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197821633] [2024-11-09 07:38:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:06,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:06,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:06,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:06,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:38:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:06,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:38:06,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:06,776 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-09 07:38:06,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:06,874 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 18 treesize of output 19 [2024-11-09 07:38:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:06,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:07,236 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-09 07:38:07,242 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-09 07:38:07,248 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-09 07:38:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197821633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:07,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:07,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2024-11-09 07:38:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094445388] [2024-11-09 07:38:07,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:38:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:38:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:38:07,258 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:07,694 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-11-09 07:38:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:38:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:38:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:07,696 INFO L225 Difference]: With dead ends: 62 [2024-11-09 07:38:07,696 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:38:07,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:38:07,697 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 206 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:07,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 128 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:38:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:38:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-11-09 07:38:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-09 07:38:07,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2024-11-09 07:38:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:07,700 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-09 07:38:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-09 07:38:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:38:07,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:07,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:07,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:38:07,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:07,904 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:07,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1770698677, now seen corresponding path program 2 times [2024-11-09 07:38:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128112697] [2024-11-09 07:38:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128112697] [2024-11-09 07:38:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128112697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689648130] [2024-11-09 07:38:08,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:38:08,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:08,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:08,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:38:08,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:38:08,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:08,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:38:08,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:08,628 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-09 07:38:09,422 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:38:09,423 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 39 treesize of output 26 [2024-11-09 07:38:09,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:09,494 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 16 treesize of output 20 [2024-11-09 07:38:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:09,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:10,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:10,387 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 34 treesize of output 33 [2024-11-09 07:38:10,521 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-09 07:38:10,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-11-09 07:38:10,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:38:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689648130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:10,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 43 [2024-11-09 07:38:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863949526] [2024-11-09 07:38:10,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 07:38:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 07:38:10,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 07:38:10,613 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:14,018 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-11-09 07:38:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-09 07:38:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:38:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:14,021 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:38:14,021 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:38:14,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=850, Invalid=5630, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 07:38:14,023 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 437 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:14,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 155 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:38:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:38:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2024-11-09 07:38:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-11-09 07:38:14,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 25 [2024-11-09 07:38:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:14,029 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-11-09 07:38:14,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-11-09 07:38:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:38:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:14,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:14,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:38:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:14,235 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1361987778, now seen corresponding path program 1 times [2024-11-09 07:38:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923254177] [2024-11-09 07:38:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:14,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923254177] [2024-11-09 07:38:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923254177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266496828] [2024-11-09 07:38:14,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:14,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:14,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:14,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:38:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:14,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:38:14,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:14,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:14,527 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-09 07:38:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266496828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:14,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-09 07:38:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754927805] [2024-11-09 07:38:14,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:38:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:14,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:38:14,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:38:14,554 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:14,659 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-09 07:38:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:38:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:38:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:14,660 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:38:14,660 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:38:14,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:38:14,661 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 105 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:14,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 59 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:38:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-09 07:38:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-11-09 07:38:14,665 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 26 [2024-11-09 07:38:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-11-09 07:38:14,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2024-11-09 07:38:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:38:14,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:14,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:14,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:38:14,868 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,SelfDestructingSolverStorable22 [2024-11-09 07:38:14,869 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1320850309, now seen corresponding path program 2 times [2024-11-09 07:38:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578092068] [2024-11-09 07:38:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:15,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578092068] [2024-11-09 07:38:15,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578092068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745798179] [2024-11-09 07:38:15,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:38:15,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:15,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:15,559 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-09 07:38:15,561 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-09 07:38:15,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:38:15,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:15,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:38:15,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:15,677 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-09 07:38:16,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 07:38:16,166 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-09 07:38:16,166 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-09 07:38:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:16,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 07:38:16,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:38:16,812 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-09 07:38:16,816 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-09 07:38:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745798179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:16,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2024-11-09 07:38:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94962474] [2024-11-09 07:38:16,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 07:38:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 07:38:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 07:38:16,877 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,964 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-11-09 07:38:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:38:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:38:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,965 INFO L225 Difference]: With dead ends: 79 [2024-11-09 07:38:17,965 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:38:17,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=374, Invalid=2932, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 07:38:17,966 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 165 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 261 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:38:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:38:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2024-11-09 07:38:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-09 07:38:17,968 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 29 [2024-11-09 07:38:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,969 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-09 07:38:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-09 07:38:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:38:17,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:17,984 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-09 07:38:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:18,170 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1662602224, now seen corresponding path program 2 times [2024-11-09 07:38:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934857125] [2024-11-09 07:38:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934857125] [2024-11-09 07:38:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934857125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982087512] [2024-11-09 07:38:18,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:38:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:18,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:18,543 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-09 07:38:18,544 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-09 07:38:18,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:38:18,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:18,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 07:38:18,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:18,669 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-09 07:38:19,080 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:38:19,080 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 26 treesize of output 20 [2024-11-09 07:38:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:19,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:19,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:38:19,440 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-09 07:38:19,446 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-09 07:38:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982087512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:19,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:19,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 29 [2024-11-09 07:38:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026292814] [2024-11-09 07:38:19,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:38:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:19,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:38:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:38:19,492 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:20,059 INFO L93 Difference]: Finished difference Result 214 states and 242 transitions. [2024-11-09 07:38:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:38:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:38:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:20,060 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:38:20,061 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 07:38:20,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=1616, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 07:38:20,062 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 202 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:20,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 262 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:38:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 07:38:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 134. [2024-11-09 07:38:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 131 states have (on average 1.1984732824427482) internal successors, (157), 133 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-09 07:38:20,066 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 31 [2024-11-09 07:38:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:20,066 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-09 07:38:20,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-09 07:38:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:38:20,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:20,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:20,083 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-09 07:38:20,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:20,272 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:20,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash 66226343, now seen corresponding path program 1 times [2024-11-09 07:38:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950106496] [2024-11-09 07:38:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950106496] [2024-11-09 07:38:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950106496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393800535] [2024-11-09 07:38:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:20,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:20,901 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-09 07:38:20,903 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-09 07:38:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:20,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:38:20,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:21,021 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-09 07:38:22,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:38:22,115 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-09 07:38:22,115 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 36 treesize of output 29 [2024-11-09 07:38:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:22,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:22,344 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 12 treesize of output 8 [2024-11-09 07:38:22,789 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-09 07:38:22,795 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 45 treesize of output 39 [2024-11-09 07:38:22,801 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-09 07:38:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:22,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393800535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:22,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 37 [2024-11-09 07:38:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666236676] [2024-11-09 07:38:22,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:38:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:38:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:38:22,830 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 38 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:24,282 INFO L93 Difference]: Finished difference Result 173 states and 194 transitions. [2024-11-09 07:38:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:38:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 38 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:38:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:24,284 INFO L225 Difference]: With dead ends: 173 [2024-11-09 07:38:24,284 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 07:38:24,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=520, Invalid=2902, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 07:38:24,285 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 218 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:24,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 179 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:38:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 07:38:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 64. [2024-11-09 07:38:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-09 07:38:24,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2024-11-09 07:38:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:24,292 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-09 07:38:24,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3513513513513513) internal successors, (87), 38 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-09 07:38:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:38:24,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:24,296 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:24,310 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-09 07:38:24,496 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,SelfDestructingSolverStorable25 [2024-11-09 07:38:24,497 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2032700722, now seen corresponding path program 3 times [2024-11-09 07:38:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701679201] [2024-11-09 07:38:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701679201] [2024-11-09 07:38:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701679201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943381474] [2024-11-09 07:38:25,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:38:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:25,101 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-09 07:38:25,102 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-09 07:38:25,201 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 07:38:25,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:25,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 07:38:25,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:25,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:38:26,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:26,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2024-11-09 07:38:26,717 INFO L349 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2024-11-09 07:38:26,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2024-11-09 07:38:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:26,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:28,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 67 [2024-11-09 07:38:28,964 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 40 treesize of output 34 [2024-11-09 07:38:28,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:28,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2024-11-09 07:38:28,995 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-09 07:38:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943381474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:29,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:29,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 66 [2024-11-09 07:38:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888422121] [2024-11-09 07:38:29,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:29,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-09 07:38:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-09 07:38:29,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=4081, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 07:38:29,074 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:33,460 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-09 07:38:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 07:38:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 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 36 [2024-11-09 07:38:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:33,461 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:38:33,461 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:38:33,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1223, Invalid=10119, Unknown=0, NotChecked=0, Total=11342 [2024-11-09 07:38:33,464 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 364 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 160 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:38:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:38:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2024-11-09 07:38:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-09 07:38:33,468 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 36 [2024-11-09 07:38:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-09 07:38:33,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-09 07:38:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:38:33,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:33,469 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:33,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:38:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:38:33,673 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1443310507, now seen corresponding path program 3 times [2024-11-09 07:38:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280829567] [2024-11-09 07:38:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280829567] [2024-11-09 07:38:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280829567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104355648] [2024-11-09 07:38:34,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:38:34,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:34,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:34,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:38:34,330 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 07:38:34,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:34,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:38:34,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:34,362 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-09 07:38:35,662 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-09 07:38:35,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-09 07:38:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 07:38:35,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:37,539 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 53 treesize of output 45 [2024-11-09 07:38:37,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:38:37,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 125 [2024-11-09 07:38:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:37,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104355648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:37,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 22] total 48 [2024-11-09 07:38:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528037785] [2024-11-09 07:38:37,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 07:38:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:37,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 07:38:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 07:38:37,660 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:40,310 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-09 07:38:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:38:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 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 39 [2024-11-09 07:38:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:40,311 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:38:40,311 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:38:40,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=755, Invalid=4356, Unknown=1, NotChecked=0, Total=5112 [2024-11-09 07:38:40,312 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 166 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:40,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 221 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:38:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:38:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2024-11-09 07:38:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 07:38:40,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 39 [2024-11-09 07:38:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 07:38:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 07:38:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:38:40,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:40,316 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:40,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:38:40,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:38:40,520 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:40,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1353279417, now seen corresponding path program 2 times [2024-11-09 07:38:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659615615] [2024-11-09 07:38:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659615615] [2024-11-09 07:38:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659615615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795414222] [2024-11-09 07:38:41,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:38:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:41,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:41,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:38:41,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:38:41,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:41,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:38:41,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:41,358 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-09 07:38:42,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:42,545 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 35 treesize of output 31 [2024-11-09 07:38:42,631 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-09 07:38:42,632 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 41 treesize of output 39 [2024-11-09 07:38:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:42,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:43,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:43,533 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 41 treesize of output 36 [2024-11-09 07:38:44,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:38:44,169 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-09 07:38:44,178 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 59 treesize of output 45 [2024-11-09 07:38:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795414222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:44,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 25] total 63 [2024-11-09 07:38:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211456030] [2024-11-09 07:38:44,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-09 07:38:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-09 07:38:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3750, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 07:38:44,263 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 64 states, 63 states have (on average 2.142857142857143) internal successors, (135), 64 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:53,082 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2024-11-09 07:38:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-09 07:38:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.142857142857143) internal successors, (135), 64 states have internal predecessors, (135), 0 states have call successors, (0), 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 47 [2024-11-09 07:38:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:53,084 INFO L225 Difference]: With dead ends: 242 [2024-11-09 07:38:53,084 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 07:38:53,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8565 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3314, Invalid=23092, Unknown=0, NotChecked=0, Total=26406 [2024-11-09 07:38:53,088 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 712 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:53,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 308 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:38:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 07:38:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 180. [2024-11-09 07:38:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.1284916201117319) internal successors, (202), 179 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 202 transitions. [2024-11-09 07:38:53,093 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 202 transitions. Word has length 47 [2024-11-09 07:38:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 202 transitions. [2024-11-09 07:38:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.142857142857143) internal successors, (135), 64 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 202 transitions. [2024-11-09 07:38:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:38:53,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:53,094 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:53,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:38:53,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:38:53,299 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 07:38:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 204500411, now seen corresponding path program 4 times [2024-11-09 07:38:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142922689] [2024-11-09 07:38:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142922689] [2024-11-09 07:38:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142922689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379879810] [2024-11-09 07:38:54,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:38:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:54,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:54,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:38:54,165 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:38:54,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:54,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-09 07:38:54,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:54,192 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-09 07:39:01,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:39:01,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 253 [2024-11-09 07:39:01,549 INFO L349 Elim1Store]: treesize reduction 20, result has 70.1 percent of original size [2024-11-09 07:39:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 73 [2024-11-09 07:39:01,554 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 07:39:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:01,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:07,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:39:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 125 treesize of output 242 [2024-11-09 07:39:07,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-11-09 07:39:07,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2024-11-09 07:39:07,936 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 07:39:07,946 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-09 07:39:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:07,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379879810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:07,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 47, 47] total 108 [2024-11-09 07:39:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773271284] [2024-11-09 07:39:07,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:07,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-11-09 07:39:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:07,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-11-09 07:39:07,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=10741, Unknown=0, NotChecked=0, Total=11772 [2024-11-09 07:39:07,968 INFO L87 Difference]: Start difference. First operand 180 states and 202 transitions. Second operand has 109 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 109 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)