./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 382beab9cdcef42f6594628efe520684fdbc8c72ada26cb53ddf4918b8957d49 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:45:05,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:45:05,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:45:05,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:45:05,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:45:05,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:45:05,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:45:05,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:45:05,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:45:05,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:45:05,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:45:05,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:45:05,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:45:05,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:45:05,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:45:05,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:45:05,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:45:05,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:45:05,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:45:05,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:45:05,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:45:05,169 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:45:05,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:45:05,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:45:05,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:45:05,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:45:05,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:45:05,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:45:05,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:45:05,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:45:05,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:45:05,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:45:05,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:45:05,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:45:05,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:45:05,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:45:05,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:45:05,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 382beab9cdcef42f6594628efe520684fdbc8c72ada26cb53ddf4918b8957d49 [2024-10-11 17:45:05,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:45:05,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:45:05,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:45:05,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:45:05,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:45:05,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2024-10-11 17:45:06,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:45:06,822 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:45:06,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2024-10-11 17:45:06,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/073b400a6/1fe65aaeb06141588920abf09799db9c/FLAG872a03b69 [2024-10-11 17:45:06,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/073b400a6/1fe65aaeb06141588920abf09799db9c [2024-10-11 17:45:06,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:45:06,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:45:06,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:45:06,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:45:06,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:45:06,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:45:06" (1/1) ... [2024-10-11 17:45:06,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f64a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:06, skipping insertion in model container [2024-10-11 17:45:06,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:45:06" (1/1) ... [2024-10-11 17:45:06,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:45:07,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:45:07,145 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:45:07,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:45:07,205 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:45:07,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07 WrapperNode [2024-10-11 17:45:07,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:45:07,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:45:07,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:45:07,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:45:07,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,249 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-10-11 17:45:07,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:45:07,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:45:07,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:45:07,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:45:07,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,277 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-11 17:45:07,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:45:07,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:45:07,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:45:07,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:45:07,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (1/1) ... [2024-10-11 17:45:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:45:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:07,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:45:07,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:45:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:45:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:45:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:45:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:45:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:45:07,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:45:07,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:45:07,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:45:07,477 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:45:07,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:45:07,621 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-11 17:45:07,621 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:45:07,677 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:45:07,677 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:45:07,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:45:07 BoogieIcfgContainer [2024-10-11 17:45:07,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:45:07,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:45:07,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:45:07,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:45:07,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:45:06" (1/3) ... [2024-10-11 17:45:07,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b052a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:45:07, skipping insertion in model container [2024-10-11 17:45:07,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:45:07" (2/3) ... [2024-10-11 17:45:07,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b052a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:45:07, skipping insertion in model container [2024-10-11 17:45:07,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:45:07" (3/3) ... [2024-10-11 17:45:07,683 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2024-10-11 17:45:07,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:45:07,695 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:45:07,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:45:07,732 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;@1fe9a3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:45:07,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-11 17:45:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 20 states have (on average 2.4) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:07,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:07,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:07,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:07,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -425071452, now seen corresponding path program 1 times [2024-10-11 17:45:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108222345] [2024-10-11 17:45:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108222345] [2024-10-11 17:45:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108222345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077395590] [2024-10-11 17:45:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:07,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:08,024 INFO L87 Difference]: Start difference. First operand has 40 states, 20 states have (on average 2.4) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:08,094 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-10-11 17:45:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:08,102 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:45:08,103 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:45:08,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:08,109 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:08,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:45:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-10-11 17:45:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-11 17:45:08,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 6 [2024-10-11 17:45:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:08,136 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-11 17:45:08,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-11 17:45:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:08,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:08,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:45:08,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:08,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -423224410, now seen corresponding path program 1 times [2024-10-11 17:45:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810548271] [2024-10-11 17:45:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810548271] [2024-10-11 17:45:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810548271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:08,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729923756] [2024-10-11 17:45:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:45:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:45:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:08,291 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:08,333 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-10-11 17:45:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:45:08,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:08,334 INFO L225 Difference]: With dead ends: 40 [2024-10-11 17:45:08,334 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 17:45:08,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:08,336 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:08,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 17:45:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 17:45:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 2.0) internal successors, (46), 39 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-10-11 17:45:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-10-11 17:45:08,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 6 [2024-10-11 17:45:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:08,342 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-10-11 17:45:08,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-10-11 17:45:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:45:08,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:08,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:45:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:45:08,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -423224409, now seen corresponding path program 1 times [2024-10-11 17:45:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133804367] [2024-10-11 17:45:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133804367] [2024-10-11 17:45:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133804367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11378225] [2024-10-11 17:45:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:08,540 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:08,609 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-11 17:45:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:45:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:08,610 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:45:08,610 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:45:08,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:08,611 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:08,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:45:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 17:45:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.96) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-11 17:45:08,619 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 6 [2024-10-11 17:45:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-11 17:45:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-11 17:45:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:45:08,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:08,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:45:08,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -471822832, now seen corresponding path program 1 times [2024-10-11 17:45:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680657602] [2024-10-11 17:45:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:08,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680657602] [2024-10-11 17:45:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680657602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:08,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:08,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636429648] [2024-10-11 17:45:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:08,656 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:08,686 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-10-11 17:45:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:45:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:08,688 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:45:08,688 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 17:45:08,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:08,691 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 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-10-11 17:45:08,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 17:45:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-10-11 17:45:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 50 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-10-11 17:45:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-10-11 17:45:08,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 8 [2024-10-11 17:45:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:08,696 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-10-11 17:45:08,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-10-11 17:45:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:45:08,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:08,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:08,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:45:08,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:08,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -414564530, now seen corresponding path program 1 times [2024-10-11 17:45:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181546408] [2024-10-11 17:45:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:08,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-10-11 17:45:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:08,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181546408] [2024-10-11 17:45:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181546408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549163522] [2024-10-11 17:45:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:45:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:45:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:08,778 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:08,806 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-10-11 17:45:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:45:08,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:45:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:08,807 INFO L225 Difference]: With dead ends: 49 [2024-10-11 17:45:08,808 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 17:45:08,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:08,809 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:08,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 17:45:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 17:45:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-10-11 17:45:08,816 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 8 [2024-10-11 17:45:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:08,817 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-10-11 17:45:08,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-10-11 17:45:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:45:08,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:08,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:08,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:45:08,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:08,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -414564529, now seen corresponding path program 1 times [2024-10-11 17:45:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:08,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368530130] [2024-10-11 17:45:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:08,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:08,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368530130] [2024-10-11 17:45:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368530130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:08,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630085534] [2024-10-11 17:45:08,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:08,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:08,935 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:09,008 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-10-11 17:45:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:45:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:09,010 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:45:09,010 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:45:09,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:09,011 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 56 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-10-11 17:45:09,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 56 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:45:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:45:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-10-11 17:45:09,016 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 8 [2024-10-11 17:45:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:09,017 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-10-11 17:45:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-10-11 17:45:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:45:09,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:09,018 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:09,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:45:09,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1303315612, now seen corresponding path program 1 times [2024-10-11 17:45:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901249493] [2024-10-11 17:45:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901249493] [2024-10-11 17:45:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901249493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878659407] [2024-10-11 17:45:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:09,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:09,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:09,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:45:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:09,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 17:45:09,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:09,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:45:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-11 17:45:09,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:45:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:09,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:09,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:45:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878659407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:09,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-10-11 17:45:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172516764] [2024-10-11 17:45:09,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:45:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:09,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:45:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:45:09,579 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:09,735 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-10-11 17:45:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:45:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:45:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:09,737 INFO L225 Difference]: With dead ends: 52 [2024-10-11 17:45:09,737 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 17:45:09,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:45:09,738 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:09,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 17:45:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-10-11 17:45:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.6875) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-11 17:45:09,744 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 8 [2024-10-11 17:45:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-11 17:45:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-11 17:45:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:45:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:09,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:09,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:45:09,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:09,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1741607524, now seen corresponding path program 1 times [2024-10-11 17:45:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:09,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304097478] [2024-10-11 17:45:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304097478] [2024-10-11 17:45:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304097478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229871153] [2024-10-11 17:45:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:10,042 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:10,084 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-11 17:45:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:45:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:10,084 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:45:10,085 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:45:10,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:10,085 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:10,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:45:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-11 17:45:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-10-11 17:45:10,091 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 9 [2024-10-11 17:45:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:10,093 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-10-11 17:45:10,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-10-11 17:45:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:45:10,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:10,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:10,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:45:10,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1744013146, now seen corresponding path program 1 times [2024-10-11 17:45:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151412979] [2024-10-11 17:45:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151412979] [2024-10-11 17:45:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151412979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513513520] [2024-10-11 17:45:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:10,213 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:10,260 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-10-11 17:45:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:45:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:10,261 INFO L225 Difference]: With dead ends: 69 [2024-10-11 17:45:10,263 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 17:45:10,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:10,264 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:10,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 17:45:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-10-11 17:45:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.627906976744186) internal successors, (70), 56 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-10-11 17:45:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-10-11 17:45:10,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 9 [2024-10-11 17:45:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:10,268 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-10-11 17:45:10,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-10-11 17:45:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:10,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:10,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:10,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:45:10,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:10,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1844741599, now seen corresponding path program 1 times [2024-10-11 17:45:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111884118] [2024-10-11 17:45:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111884118] [2024-10-11 17:45:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111884118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:10,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718476161] [2024-10-11 17:45:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:10,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:10,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:10,333 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:10,370 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-10-11 17:45:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:10,371 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:45:10,371 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 17:45:10,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:10,372 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:10,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 17:45:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-11 17:45:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-11 17:45:10,375 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 10 [2024-10-11 17:45:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:10,375 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-11 17:45:10,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-11 17:45:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:10,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:10,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:10,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:45:10,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1035394973, now seen corresponding path program 1 times [2024-10-11 17:45:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922584276] [2024-10-11 17:45:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922584276] [2024-10-11 17:45:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922584276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:10,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:10,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163953021] [2024-10-11 17:45:10,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:10,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:10,500 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:10,547 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2024-10-11 17:45:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:10,548 INFO L225 Difference]: With dead ends: 68 [2024-10-11 17:45:10,549 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 17:45:10,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:10,549 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:10,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 57 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 17:45:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-10-11 17:45:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-11 17:45:10,555 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 10 [2024-10-11 17:45:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-11 17:45:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-11 17:45:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:45:10,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:10,555 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:45:10,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1035512822, now seen corresponding path program 1 times [2024-10-11 17:45:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265331239] [2024-10-11 17:45:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265331239] [2024-10-11 17:45:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265331239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139454076] [2024-10-11 17:45:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:10,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:10,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:45:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:10,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:45:10,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:10,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 17:45:10,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-11 17:45:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:10,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139454076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:11,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:11,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2024-10-11 17:45:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950047165] [2024-10-11 17:45:11,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:45:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:45:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:45:11,019 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,174 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-11 17:45:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:45:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:45:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,174 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:45:11,175 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 17:45:11,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:45:11,175 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 94 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 17:45:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-11 17:45:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.565217391304348) internal successors, (72), 58 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-10-11 17:45:11,178 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 10 [2024-10-11 17:45:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,178 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-10-11 17:45:11,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-10-11 17:45:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:45:11,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:45:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:11,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1352416211, now seen corresponding path program 1 times [2024-10-11 17:45:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128026389] [2024-10-11 17:45:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128026389] [2024-10-11 17:45:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128026389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:11,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46560248] [2024-10-11 17:45:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:11,411 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,440 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-10-11 17:45:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:45:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,441 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:45:11,441 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:45:11,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:11,442 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:45:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 17:45:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.5) internal successors, (69), 55 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-10-11 17:45:11,447 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 11 [2024-10-11 17:45:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,447 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-10-11 17:45:11,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-10-11 17:45:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:45:11,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:45:11,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1352416212, now seen corresponding path program 1 times [2024-10-11 17:45:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355579645] [2024-10-11 17:45:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355579645] [2024-10-11 17:45:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355579645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970694594] [2024-10-11 17:45:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:11,512 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,575 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-10-11 17:45:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:45:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:45:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,576 INFO L225 Difference]: With dead ends: 66 [2024-10-11 17:45:11,576 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 17:45:11,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:11,577 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 17:45:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 17:45:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-10-11 17:45:11,579 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 11 [2024-10-11 17:45:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,579 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-10-11 17:45:11,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-10-11 17:45:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:45:11,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:45:11,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 569441861, now seen corresponding path program 1 times [2024-10-11 17:45:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187326909] [2024-10-11 17:45:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:11,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187326909] [2024-10-11 17:45:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187326909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:11,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523004852] [2024-10-11 17:45:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:11,707 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,727 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-10-11 17:45:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:45:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,728 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:45:11,728 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 17:45:11,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:11,730 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 17:45:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2024-10-11 17:45:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.525) internal successors, (61), 48 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-10-11 17:45:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-10-11 17:45:11,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 11 [2024-10-11 17:45:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,734 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-10-11 17:45:11,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-10-11 17:45:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:45:11,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:45:11,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1304641916, now seen corresponding path program 1 times [2024-10-11 17:45:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45957234] [2024-10-11 17:45:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:11,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45957234] [2024-10-11 17:45:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45957234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:11,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:11,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:45:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232967454] [2024-10-11 17:45:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:45:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:45:11,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:11,859 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,898 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-10-11 17:45:11,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:45:11,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 17:45:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,899 INFO L225 Difference]: With dead ends: 48 [2024-10-11 17:45:11,899 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 17:45:11,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:45:11,899 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 17:45:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-10-11 17:45:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-10-11 17:45:11,901 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 12 [2024-10-11 17:45:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-10-11 17:45:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-10-11 17:45:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:11,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:45:11,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1255422936, now seen corresponding path program 1 times [2024-10-11 17:45:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277067969] [2024-10-11 17:45:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277067969] [2024-10-11 17:45:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277067969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067289890] [2024-10-11 17:45:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:45:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:45:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:11,927 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:11,946 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-11 17:45:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:45:11,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:45:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:11,947 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:45:11,947 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:45:11,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:11,948 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:11,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:45:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 17:45:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-10-11 17:45:11,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 14 [2024-10-11 17:45:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:11,950 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-11 17:45:11,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-10-11 17:45:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:11,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:11,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:11,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:45:11,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1255422935, now seen corresponding path program 1 times [2024-10-11 17:45:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:11,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704052222] [2024-10-11 17:45:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704052222] [2024-10-11 17:45:12,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704052222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:12,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:45:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435554374] [2024-10-11 17:45:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:45:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:45:12,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:12,006 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,036 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-11 17:45:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:45:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:45:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,037 INFO L225 Difference]: With dead ends: 43 [2024-10-11 17:45:12,037 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:45:12,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:45:12,038 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:12,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:45:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 17:45:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-10-11 17:45:12,039 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 14 [2024-10-11 17:45:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-10-11 17:45:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-10-11 17:45:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:45:12,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:45:12,040 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1255413862, now seen corresponding path program 1 times [2024-10-11 17:45:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196242507] [2024-10-11 17:45:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196242507] [2024-10-11 17:45:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196242507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:45:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435250802] [2024-10-11 17:45:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:45:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:45:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:12,059 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,072 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-10-11 17:45:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:45:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:45:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,073 INFO L225 Difference]: With dead ends: 45 [2024-10-11 17:45:12,073 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 17:45:12,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:45:12,074 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:12,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 17:45:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 17:45:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-10-11 17:45:12,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 14 [2024-10-11 17:45:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-10-11 17:45:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-10-11 17:45:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:45:12,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:45:12,078 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 424406906, now seen corresponding path program 1 times [2024-10-11 17:45:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672819185] [2024-10-11 17:45:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672819185] [2024-10-11 17:45:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672819185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:45:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386691742] [2024-10-11 17:45:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:45:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:45:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:45:12,203 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,247 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-10-11 17:45:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:45:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:45:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,248 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:45:12,248 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 17:45:12,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:12,249 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:12,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 17:45:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-11 17:45:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-10-11 17:45:12,250 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2024-10-11 17:45:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-11 17:45:12,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-10-11 17:45:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:45:12,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:45:12,251 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:12,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash 433075098, now seen corresponding path program 1 times [2024-10-11 17:45:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020748507] [2024-10-11 17:45:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020748507] [2024-10-11 17:45:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020748507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:45:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427417173] [2024-10-11 17:45:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:45:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:45:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:12,345 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,361 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-10-11 17:45:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:45:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:45:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,362 INFO L225 Difference]: With dead ends: 54 [2024-10-11 17:45:12,362 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:45:12,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:45:12,363 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 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-10-11 17:45:12,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:45:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:45:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) 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-10-11 17:45:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-11 17:45:12,364 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2024-10-11 17:45:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-11 17:45:12,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-11 17:45:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:45:12,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:45:12,365 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -855456772, now seen corresponding path program 1 times [2024-10-11 17:45:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270110664] [2024-10-11 17:45:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270110664] [2024-10-11 17:45:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270110664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:45:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:45:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032442332] [2024-10-11 17:45:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:45:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:45:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:45:12,480 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,523 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-10-11 17:45:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:45:12,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:45:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,524 INFO L225 Difference]: With dead ends: 49 [2024-10-11 17:45:12,524 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:45:12,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:45:12,525 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:12,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:45:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-11 17:45:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) 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-10-11 17:45:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 17:45:12,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 16 [2024-10-11 17:45:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 17:45:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 17:45:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:45:12,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:45:12,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1925758641, now seen corresponding path program 1 times [2024-10-11 17:45:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670142830] [2024-10-11 17:45:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670142830] [2024-10-11 17:45:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670142830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125596019] [2024-10-11 17:45:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:12,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:12,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:12,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:45:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:12,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:45:12,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:12,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:45:12,741 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-10-11 17:45:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:12,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:45:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125596019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:12,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:45:12,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-10-11 17:45:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322591532] [2024-10-11 17:45:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:12,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:45:12,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:45:12,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:45:12,773 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:12,838 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-10-11 17:45:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:45:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:45:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:12,838 INFO L225 Difference]: With dead ends: 45 [2024-10-11 17:45:12,838 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 17:45:12,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:45:12,839 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:12,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 17:45:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 17:45:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-11 17:45:12,840 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2024-10-11 17:45:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-11 17:45:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-11 17:45:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:45:12,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:12,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:12,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:45:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:13,042 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 904690287, now seen corresponding path program 1 times [2024-10-11 17:45:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297975354] [2024-10-11 17:45:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297975354] [2024-10-11 17:45:13,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297975354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799606897] [2024-10-11 17:45:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:13,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:45:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:13,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:45:13,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:13,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:45:13,303 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-10-11 17:45:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:13,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:45:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799606897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:45:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:45:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 16 [2024-10-11 17:45:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374873049] [2024-10-11 17:45:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:45:13,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:45:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:45:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:45:13,328 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:13,382 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 17:45:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:45:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:45:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:13,382 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:45:13,382 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:45:13,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:45:13,383 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:13,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:45:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:45:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-11 17:45:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-10-11 17:45:13,385 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2024-10-11 17:45:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:13,385 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-11 17:45:13,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-10-11 17:45:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:45:13,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:13,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:13,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:13,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 17:45:13,590 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:13,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash 812924502, now seen corresponding path program 1 times [2024-10-11 17:45:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383425483] [2024-10-11 17:45:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383425483] [2024-10-11 17:45:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383425483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456537779] [2024-10-11 17:45:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:13,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:13,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:45:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:13,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:45:13,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:13,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:13,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:45:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456537779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:13,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 17:45:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924841544] [2024-10-11 17:45:13,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:45:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:45:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:45:13,889 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 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-10-11 17:45:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:13,992 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-10-11 17:45:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:45:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 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) Word has length 20 [2024-10-11 17:45:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:13,993 INFO L225 Difference]: With dead ends: 39 [2024-10-11 17:45:13,993 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:45:13,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:45:13,993 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:13,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 114 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:45:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-10-11 17:45:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-11 17:45:13,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2024-10-11 17:45:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:13,995 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-11 17:45:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 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-10-11 17:45:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-11 17:45:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:45:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:13,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:14,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:45:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 17:45:14,196 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1485333913, now seen corresponding path program 1 times [2024-10-11 17:45:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669265390] [2024-10-11 17:45:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669265390] [2024-10-11 17:45:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669265390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398066081] [2024-10-11 17:45:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:14,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:14,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:45:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:14,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:45:14,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:14,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:14,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:45:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398066081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:14,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:14,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-11 17:45:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223234666] [2024-10-11 17:45:14,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:14,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:45:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:45:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:45:14,536 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:14,614 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 17:45:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:45:14,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 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) Word has length 23 [2024-10-11 17:45:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:14,617 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:45:14,618 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 17:45:14,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:45:14,618 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:14,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 102 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 17:45:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-11 17:45:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-11 17:45:14,619 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2024-10-11 17:45:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-11 17:45:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-11 17:45:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:45:14,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:14,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:14,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:45:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 17:45:14,822 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1476710856, now seen corresponding path program 2 times [2024-10-11 17:45:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805322969] [2024-10-11 17:45:14,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:15,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805322969] [2024-10-11 17:45:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805322969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083314240] [2024-10-11 17:45:15,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:45:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:15,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:45:15,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:45:15,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:15,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 17:45:15,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:15,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 17:45:15,240 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-10-11 17:45:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:15,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:15,312 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-10-11 17:45:15,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-11 17:45:15,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 17:45:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:45:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083314240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:15,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:15,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 24 [2024-10-11 17:45:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933053343] [2024-10-11 17:45:15,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:15,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 17:45:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 17:45:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:45:15,368 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:15,649 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-10-11 17:45:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 17:45:15,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 17:45:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:15,650 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:45:15,650 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 17:45:15,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=1103, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 17:45:15,651 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:15,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:45:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 17:45:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-11 17:45:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 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-10-11 17:45:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-10-11 17:45:15,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2024-10-11 17:45:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:15,652 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-10-11 17:45:15,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-10-11 17:45:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:45:15,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:15,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:15,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:15,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:15,853 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 744931868, now seen corresponding path program 3 times [2024-10-11 17:45:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605075958] [2024-10-11 17:45:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605075958] [2024-10-11 17:45:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605075958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4652848] [2024-10-11 17:45:15,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:45:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:15,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:15,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:45:16,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 17:45:16,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:16,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 17:45:16,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:16,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:16,291 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-10-11 17:45:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4652848] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:16,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2024-10-11 17:45:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712107859] [2024-10-11 17:45:16,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:45:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:45:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:45:16,330 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:16,495 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-10-11 17:45:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:45:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-11 17:45:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:16,496 INFO L225 Difference]: With dead ends: 47 [2024-10-11 17:45:16,496 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 17:45:16,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:45:16,497 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:16,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:45:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 17:45:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-11 17:45:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 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-10-11 17:45:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-10-11 17:45:16,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2024-10-11 17:45:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:16,499 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-10-11 17:45:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-10-11 17:45:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 17:45:16,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:16,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:16,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 17:45:16,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:45:16,702 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:16,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash 170670305, now seen corresponding path program 2 times [2024-10-11 17:45:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632454106] [2024-10-11 17:45:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632454106] [2024-10-11 17:45:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632454106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97217098] [2024-10-11 17:45:16,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:45:16,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:16,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:16,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:16,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:45:16,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:45:16,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:16,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:45:16,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:16,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-11 17:45:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:17,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97217098] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:17,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-10-11 17:45:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935185859] [2024-10-11 17:45:17,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:17,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:45:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:45:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:45:17,197 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 3.75) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:17,329 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-10-11 17:45:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:45:17,329 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 17:45:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:17,329 INFO L225 Difference]: With dead ends: 47 [2024-10-11 17:45:17,329 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:45:17,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:45:17,330 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:17,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 112 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:45:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-11 17:45:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.125) internal successors, (45), 42 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-10-11 17:45:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2024-10-11 17:45:17,331 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 32 [2024-10-11 17:45:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:17,331 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-10-11 17:45:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-10-11 17:45:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:45:17,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:17,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:17,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:45:17,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 17:45:17,537 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:17,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash 805443122, now seen corresponding path program 4 times [2024-10-11 17:45:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531672032] [2024-10-11 17:45:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531672032] [2024-10-11 17:45:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531672032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538938173] [2024-10-11 17:45:17,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:45:17,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:17,725 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:17,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:45:17,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:45:17,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:17,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 17:45:17,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:17,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:45:18,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:45:18,696 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 70 [2024-10-11 17:45:18,772 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-10-11 17:45:18,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 36 [2024-10-11 17:45:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:18,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:19,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:45:19,356 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 62 treesize of output 71 [2024-10-11 17:45:19,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-10-11 17:45:19,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:45:19,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2024-10-11 17:45:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538938173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:19,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 22] total 48 [2024-10-11 17:45:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868213476] [2024-10-11 17:45:19,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 17:45:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:19,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 17:45:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2030, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 17:45:19,555 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:20,924 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2024-10-11 17:45:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 17:45:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 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) Word has length 34 [2024-10-11 17:45:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:20,926 INFO L225 Difference]: With dead ends: 106 [2024-10-11 17:45:20,926 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 17:45:20,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=590, Invalid=5730, Unknown=0, NotChecked=0, Total=6320 [2024-10-11 17:45:20,928 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:20,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 119 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:45:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 17:45:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-10-11 17:45:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-10-11 17:45:20,929 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 34 [2024-10-11 17:45:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:20,929 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-10-11 17:45:20,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-10-11 17:45:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:45:20,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:20,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:20,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 17:45:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:21,134 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:21,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash 272463694, now seen corresponding path program 5 times [2024-10-11 17:45:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313239221] [2024-10-11 17:45:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313239221] [2024-10-11 17:45:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313239221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833272827] [2024-10-11 17:45:21,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:45:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:21,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:21,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:45:21,415 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-11 17:45:21,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:21,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:45:21,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:21,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:21,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:45:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833272827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:21,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:21,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-10-11 17:45:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226929797] [2024-10-11 17:45:21,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:21,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:45:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:45:21,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:45:21,784 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:21,935 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-11 17:45:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:45:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 17:45:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:21,936 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:45:21,936 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:45:21,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:45:21,937 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:21,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:45:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-10-11 17:45:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-10-11 17:45:21,938 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 38 [2024-10-11 17:45:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-10-11 17:45:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-10-11 17:45:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:45:21,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:21,939 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 17:45:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-11 17:45:22,144 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -520872337, now seen corresponding path program 3 times [2024-10-11 17:45:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:22,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279240339] [2024-10-11 17:45:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:22,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279240339] [2024-10-11 17:45:22,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279240339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:22,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374067662] [2024-10-11 17:45:22,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:45:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:22,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:22,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 17:45:22,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 17:45:22,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:22,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:45:22,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:22,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:22,730 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-10-11 17:45:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374067662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:22,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-10-11 17:45:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936351251] [2024-10-11 17:45:22,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 17:45:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 17:45:22,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:45:22,764 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 25 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:22,934 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-10-11 17:45:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:45:22,934 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 25 states have internal predecessors, (91), 0 states have call successors, (0), 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 41 [2024-10-11 17:45:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:22,935 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:45:22,935 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 17:45:22,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:45:22,935 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:22,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:45:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 17:45:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-11 17:45:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-10-11 17:45:22,938 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 41 [2024-10-11 17:45:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-10-11 17:45:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 25 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-10-11 17:45:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:45:22,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:22,939 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:22,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:23,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:23,139 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:23,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1952895040, now seen corresponding path program 6 times [2024-10-11 17:45:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535605419] [2024-10-11 17:45:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535605419] [2024-10-11 17:45:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535605419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466258141] [2024-10-11 17:45:23,378 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 17:45:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:23,379 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:23,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 17:45:23,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-11 17:45:23,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:23,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 17:45:23,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:23,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:45:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:23,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:23,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-11 17:45:23,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 17:45:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:45:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466258141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:24,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:24,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 16] total 40 [2024-10-11 17:45:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003032247] [2024-10-11 17:45:24,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 17:45:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 17:45:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 17:45:24,051 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:24,332 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-10-11 17:45:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:45:24,333 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 17:45:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:24,333 INFO L225 Difference]: With dead ends: 86 [2024-10-11 17:45:24,333 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:45:24,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 17:45:24,334 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:24,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 232 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:45:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:45:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-10-11 17:45:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-10-11 17:45:24,336 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 43 [2024-10-11 17:45:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:24,336 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-10-11 17:45:24,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-10-11 17:45:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:45:24,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:24,336 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:24,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 17:45:24,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:24,541 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1908495339, now seen corresponding path program 7 times [2024-10-11 17:45:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155508225] [2024-10-11 17:45:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 17:45:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155508225] [2024-10-11 17:45:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155508225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272190837] [2024-10-11 17:45:24,738 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 17:45:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:24,740 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:24,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 17:45:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:24,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-11 17:45:24,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:24,880 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 19 treesize of output 1 [2024-10-11 17:45:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:45:25,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 17:45:25,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:45:25,283 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 26 treesize of output 11 [2024-10-11 17:45:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:45:25,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:25,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:45:25,530 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 34 treesize of output 30 [2024-10-11 17:45:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:45:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272190837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:25,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 17] total 48 [2024-10-11 17:45:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800040501] [2024-10-11 17:45:25,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 17:45:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 17:45:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2111, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 17:45:25,763 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:26,663 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-10-11 17:45:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 17:45:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 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 45 [2024-10-11 17:45:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:26,664 INFO L225 Difference]: With dead ends: 90 [2024-10-11 17:45:26,664 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 17:45:26,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=4790, Unknown=0, NotChecked=0, Total=5112 [2024-10-11 17:45:26,665 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:26,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 257 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:45:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 17:45:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-10-11 17:45:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2024-10-11 17:45:26,667 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 45 [2024-10-11 17:45:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:26,667 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2024-10-11 17:45:26,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2024-10-11 17:45:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:45:26,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:26,669 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:26,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 17:45:26,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 17:45:26,873 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 392795097, now seen corresponding path program 4 times [2024-10-11 17:45:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883610239] [2024-10-11 17:45:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 58 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:45:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883610239] [2024-10-11 17:45:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883610239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965649902] [2024-10-11 17:45:27,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:45:27,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:27,159 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 17:45:27,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:45:27,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:27,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 17:45:27,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:27,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:45:29,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:45:29,125 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 79 treesize of output 119 [2024-10-11 17:45:29,255 INFO L349 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2024-10-11 17:45:29,255 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 62 treesize of output 61 [2024-10-11 17:45:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 23 proven. 22 refuted. 1 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:45:29,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:30,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:45:30,485 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 83 treesize of output 117 [2024-10-11 17:45:30,551 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-10-11 17:45:30,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2024-10-11 17:45:30,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:45:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:45:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965649902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:30,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 23] total 54 [2024-10-11 17:45:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267268992] [2024-10-11 17:45:30,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:30,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 17:45:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:30,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 17:45:30,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=2575, Unknown=1, NotChecked=0, Total=2970 [2024-10-11 17:45:30,599 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 55 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:32,519 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-10-11 17:45:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 17:45:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 55 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 17:45:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:32,519 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:45:32,519 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 17:45:32,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1146, Invalid=6335, Unknown=1, NotChecked=0, Total=7482 [2024-10-11 17:45:32,521 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:32,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 166 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:45:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 17:45:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 17:45:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2024-10-11 17:45:32,522 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2024-10-11 17:45:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:32,523 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-10-11 17:45:32,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 55 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2024-10-11 17:45:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 17:45:32,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:32,523 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:32,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:32,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 17:45:32,724 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:32,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash -480996566, now seen corresponding path program 8 times [2024-10-11 17:45:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923852153] [2024-10-11 17:45:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:45:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923852153] [2024-10-11 17:45:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923852153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140709509] [2024-10-11 17:45:33,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:45:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:33,047 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:33,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 17:45:33,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:45:33,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:33,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 17:45:33,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:33,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 17:45:33,390 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-10-11 17:45:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 5 proven. 66 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:45:33,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:33,494 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-10-11 17:45:33,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-11 17:45:33,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 17:45:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 5 proven. 66 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:45:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140709509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:33,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 36 [2024-10-11 17:45:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712912453] [2024-10-11 17:45:33,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 17:45:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:33,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 17:45:33,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 17:45:33,594 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:34,368 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2024-10-11 17:45:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 17:45:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 17:45:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:34,368 INFO L225 Difference]: With dead ends: 150 [2024-10-11 17:45:34,369 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 17:45:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=3433, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 17:45:34,370 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:34,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:45:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 17:45:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-11 17:45:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-10-11 17:45:34,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2024-10-11 17:45:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:34,371 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-10-11 17:45:34,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-10-11 17:45:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 17:45:34,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:34,372 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:34,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 17:45:34,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 17:45:34,572 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1295569338, now seen corresponding path program 9 times [2024-10-11 17:45:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820679495] [2024-10-11 17:45:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:45:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820679495] [2024-10-11 17:45:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820679495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819303387] [2024-10-11 17:45:34,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:45:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:34,852 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:34,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 17:45:34,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 17:45:34,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:34,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 17:45:34,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:34,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:45:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:45:35,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:45:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:45:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819303387] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:45:35,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:45:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2024-10-11 17:45:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611463129] [2024-10-11 17:45:35,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:45:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 17:45:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:45:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 17:45:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 17:45:35,513 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:45:35,669 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-10-11 17:45:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:45:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 17:45:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:45:35,670 INFO L225 Difference]: With dead ends: 66 [2024-10-11 17:45:35,670 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 17:45:35,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=1620, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 17:45:35,671 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:45:35,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 126 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:45:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 17:45:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 17:45:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-10-11 17:45:35,675 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 56 [2024-10-11 17:45:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:45:35,675 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-10-11 17:45:35,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:45:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-10-11 17:45:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 17:45:35,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:45:35,676 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:45:35,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-11 17:45:35,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:35,876 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:45:35,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:45:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash 951104584, now seen corresponding path program 10 times [2024-10-11 17:45:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:45:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681838389] [2024-10-11 17:45:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:45:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:45:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:45:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 85 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:45:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:45:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681838389] [2024-10-11 17:45:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681838389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:45:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78286047] [2024-10-11 17:45:36,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:45:36,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:45:36,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:45:36,228 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:45:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 17:45:36,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:45:36,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:45:36,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 17:45:36,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:45:36,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:46:03,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:03,032 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-10-11 17:46:03,245 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2024-10-11 17:46:03,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 60 [2024-10-11 17:46:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 32 proven. 35 refuted. 39 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:46:03,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:05,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:05,605 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-10-11 17:46:05,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-10-11 17:46:05,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:05,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 89 treesize of output 67 [2024-10-11 17:46:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 17:46:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78286047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:06,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 40, 40] total 90 [2024-10-11 17:46:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947872476] [2024-10-11 17:46:06,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-10-11 17:46:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-10-11 17:46:06,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=7304, Unknown=65, NotChecked=0, Total=8010 [2024-10-11 17:46:06,227 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 90 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 90 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)