./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:56:23,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:56:23,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:56:23,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:56:23,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:56:23,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:56:23,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:56:23,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:56:23,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:56:23,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:56:23,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:56:23,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:56:23,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:56:23,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:56:23,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:56:23,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:56:23,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:56:23,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:56:23,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:56:23,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:56:23,857 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:56:23,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:56:23,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:56:23,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:56:23,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:56:23,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:56:23,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:56:23,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:56:23,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:56:23,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:56:23,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:56:23,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:56:23,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:56:23,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:56:23,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:56:23,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:56:23,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:56:23,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:56:23,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:56:23,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:56:23,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:56:23,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:56:23,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2024-10-14 17:56:24,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:56:24,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:56:24,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:56:24,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:56:24,102 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:56:24,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-10-14 17:56:25,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:56:25,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:56:25,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-10-14 17:56:25,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fd2a1c0/a7ddf1fda0bf473286fd889edd8f66cf/FLAG7776c8be7 [2024-10-14 17:56:25,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fd2a1c0/a7ddf1fda0bf473286fd889edd8f66cf [2024-10-14 17:56:25,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:56:25,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:56:25,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:56:25,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:56:25,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:56:25,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:25" (1/1) ... [2024-10-14 17:56:25,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3734d981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:25, skipping insertion in model container [2024-10-14 17:56:25,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:25" (1/1) ... [2024-10-14 17:56:25,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:56:26,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:56:26,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:56:26,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:56:26,198 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:56:26,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26 WrapperNode [2024-10-14 17:56:26,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:56:26,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:56:26,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:56:26,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:56:26,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,242 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-10-14 17:56:26,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:56:26,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:56:26,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:56:26,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:56:26,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,287 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 16, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 8, 3]. [2024-10-14 17:56:26,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:56:26,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:56:26,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:56:26,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:56:26,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (1/1) ... [2024-10-14 17:56:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:56:26,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:26,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:56:26,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:56:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:56:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:56:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:56:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:56:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:56:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:56:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:56:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:56:26,525 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:56:26,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:56:26,825 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-10-14 17:56:26,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:56:26,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:56:26,864 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 17:56:26,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:26 BoogieIcfgContainer [2024-10-14 17:56:26,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:56:26,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:56:26,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:56:26,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:56:26,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:56:25" (1/3) ... [2024-10-14 17:56:26,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baed260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:26, skipping insertion in model container [2024-10-14 17:56:26,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:26" (2/3) ... [2024-10-14 17:56:26,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baed260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:26, skipping insertion in model container [2024-10-14 17:56:26,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:26" (3/3) ... [2024-10-14 17:56:26,870 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2024-10-14 17:56:26,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:56:26,881 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-14 17:56:26,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:56:26,918 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;@63a7fdf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:56:26,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-14 17:56:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-14 17:56:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:56:26,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:26,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:56:26,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2024-10-14 17:56:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990482273] [2024-10-14 17:56:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:27,128 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-14 17:56:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990482273] [2024-10-14 17:56:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990482273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:56:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477141102] [2024-10-14 17:56:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:27,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:56:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:27,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:56:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:56:27,155 INFO L87 Difference]: Start difference. First operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-14 17:56:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:27,276 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-10-14 17:56:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:56:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-14 17:56:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:27,313 INFO L225 Difference]: With dead ends: 108 [2024-10-14 17:56:27,315 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 17:56:27,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-14 17:56:27,324 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:27,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 123 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 17:56:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 17:56:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.306122448979592) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-14 17:56:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-10-14 17:56:27,408 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2024-10-14 17:56:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-10-14 17:56:27,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-14 17:56:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-10-14 17:56:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:56:27,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:27,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:56:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:56:27,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2024-10-14 17:56:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879031808] [2024-10-14 17:56:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:27,502 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-14 17:56:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879031808] [2024-10-14 17:56:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879031808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:56:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490790827] [2024-10-14 17:56:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:27,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:56:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:56:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:56:27,507 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-14 17:56:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:27,595 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-10-14 17:56:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:56:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-14 17:56:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:27,597 INFO L225 Difference]: With dead ends: 100 [2024-10-14 17:56:27,597 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 17:56:27,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-14 17:56:27,598 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:27,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 17:56:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-14 17:56:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.163265306122449) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-14 17:56:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-10-14 17:56:27,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 2 [2024-10-14 17:56:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:27,611 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-10-14 17:56:27,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-14 17:56:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-10-14 17:56:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:56:27,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:27,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:27,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:56:27,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:27,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -708773178, now seen corresponding path program 1 times [2024-10-14 17:56:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44353462] [2024-10-14 17:56:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:27,884 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-14 17:56:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44353462] [2024-10-14 17:56:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44353462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:56:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054853749] [2024-10-14 17:56:27,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:27,891 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:28,050 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-10-14 17:56:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:56:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:28,051 INFO L225 Difference]: With dead ends: 99 [2024-10-14 17:56:28,051 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 17:56:28,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:28,052 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:28,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 216 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 17:56:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 17:56:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.142857142857143) internal successors, (105), 98 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-14 17:56:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-10-14 17:56:28,065 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 7 [2024-10-14 17:56:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:28,066 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-10-14 17:56:28,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-10-14 17:56:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:56:28,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:28,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:28,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:56:28,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -708773177, now seen corresponding path program 1 times [2024-10-14 17:56:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665976398] [2024-10-14 17:56:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:28,421 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-14 17:56:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665976398] [2024-10-14 17:56:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665976398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:28,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:28,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:56:28,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598257305] [2024-10-14 17:56:28,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:28,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:28,423 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:28,547 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-10-14 17:56:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:56:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:28,548 INFO L225 Difference]: With dead ends: 98 [2024-10-14 17:56:28,549 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 17:56:28,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:28,550 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 13 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:28,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 228 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 17:56:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 17:56:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.122448979591837) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-14 17:56:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-10-14 17:56:28,558 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 7 [2024-10-14 17:56:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:28,558 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-10-14 17:56:28,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-10-14 17:56:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:56:28,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:28,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:28,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:56:28,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:28,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash -497132045, now seen corresponding path program 1 times [2024-10-14 17:56:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855271134] [2024-10-14 17:56:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:28,623 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-14 17:56:28,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:28,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855271134] [2024-10-14 17:56:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855271134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:28,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239807055] [2024-10-14 17:56:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:28,627 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-14 17:56:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:28,743 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-10-14 17:56:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:28,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-14 17:56:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:28,744 INFO L225 Difference]: With dead ends: 97 [2024-10-14 17:56:28,744 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 17:56:28,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:28,745 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:28,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 289 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 17:56:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 17:56:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-14 17:56:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-10-14 17:56:28,748 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 8 [2024-10-14 17:56:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:28,749 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-10-14 17:56:28,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-14 17:56:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-10-14 17:56:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:56:28,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:28,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:28,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:56:28,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash -497132044, now seen corresponding path program 1 times [2024-10-14 17:56:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286262432] [2024-10-14 17:56:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:28,914 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-14 17:56:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286262432] [2024-10-14 17:56:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286262432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:56:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820540685] [2024-10-14 17:56:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:28,916 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-14 17:56:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:29,097 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-10-14 17:56:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:56:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-14 17:56:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:29,098 INFO L225 Difference]: With dead ends: 96 [2024-10-14 17:56:29,098 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 17:56:29,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:56:29,099 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 15 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:29,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 325 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:56:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 17:56:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 17:56:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-10-14 17:56:29,106 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2024-10-14 17:56:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:29,107 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-10-14 17:56:29,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-14 17:56:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-10-14 17:56:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:56:29,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:29,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:29,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:56:29,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275651, now seen corresponding path program 1 times [2024-10-14 17:56:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575860478] [2024-10-14 17:56:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:29,186 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-14 17:56:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575860478] [2024-10-14 17:56:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575860478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696971556] [2024-10-14 17:56:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:29,188 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:29,319 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-10-14 17:56:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:56:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:29,320 INFO L225 Difference]: With dead ends: 95 [2024-10-14 17:56:29,320 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 17:56:29,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:29,322 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:29,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 17:56:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 17:56:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 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-14 17:56:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-10-14 17:56:29,330 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 11 [2024-10-14 17:56:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-10-14 17:56:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-10-14 17:56:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:56:29,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:29,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:56:29,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275650, now seen corresponding path program 1 times [2024-10-14 17:56:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625056882] [2024-10-14 17:56:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:29,541 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-14 17:56:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625056882] [2024-10-14 17:56:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625056882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039332440] [2024-10-14 17:56:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:29,542 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:29,666 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-10-14 17:56:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:29,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:56:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:29,667 INFO L225 Difference]: With dead ends: 94 [2024-10-14 17:56:29,667 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 17:56:29,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:29,668 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:29,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 17:56:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 17:56:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-10-14 17:56:29,677 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 11 [2024-10-14 17:56:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-10-14 17:56:29,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-10-14 17:56:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:56:29,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:29,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:29,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:56:29,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774103, now seen corresponding path program 1 times [2024-10-14 17:56:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:29,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745017318] [2024-10-14 17:56:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:29,765 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-14 17:56:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745017318] [2024-10-14 17:56:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745017318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130919677] [2024-10-14 17:56:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:29,767 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:29,881 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-10-14 17:56:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 17:56:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:29,882 INFO L225 Difference]: With dead ends: 93 [2024-10-14 17:56:29,882 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 17:56:29,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:29,883 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:29,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 207 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 17:56:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 17:56:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-14 17:56:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-10-14 17:56:29,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 12 [2024-10-14 17:56:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:29,886 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-10-14 17:56:29,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-10-14 17:56:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:56:29,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:29,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:29,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:56:29,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774102, now seen corresponding path program 1 times [2024-10-14 17:56:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966179331] [2024-10-14 17:56:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:30,024 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-14 17:56:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966179331] [2024-10-14 17:56:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966179331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148453885] [2024-10-14 17:56:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:30,027 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:30,154 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-14 17:56:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 17:56:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:30,155 INFO L225 Difference]: With dead ends: 92 [2024-10-14 17:56:30,155 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 17:56:30,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:30,156 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:30,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 17:56:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 17:56:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.0) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-14 17:56:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-10-14 17:56:30,158 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 12 [2024-10-14 17:56:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:30,158 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-10-14 17:56:30,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-10-14 17:56:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:56:30,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:30,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:30,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:56:30,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:30,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523427, now seen corresponding path program 1 times [2024-10-14 17:56:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048876723] [2024-10-14 17:56:30,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:30,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:30,247 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-14 17:56:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:30,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048876723] [2024-10-14 17:56:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048876723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:30,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:30,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367155263] [2024-10-14 17:56:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:30,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:30,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:30,251 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:30,363 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-10-14 17:56:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:30,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:56:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:30,364 INFO L225 Difference]: With dead ends: 90 [2024-10-14 17:56:30,364 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 17:56:30,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:30,365 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 97 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:30,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 124 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 17:56:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 17:56:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 89 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-14 17:56:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-10-14 17:56:30,371 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 15 [2024-10-14 17:56:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:30,371 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-10-14 17:56:30,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-10-14 17:56:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:56:30,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:30,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:30,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:56:30,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523426, now seen corresponding path program 1 times [2024-10-14 17:56:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:30,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298820310] [2024-10-14 17:56:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:30,539 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-14 17:56:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298820310] [2024-10-14 17:56:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298820310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735769230] [2024-10-14 17:56:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:56:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:56:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:30,543 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:30,653 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-10-14 17:56:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:56:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:30,654 INFO L225 Difference]: With dead ends: 88 [2024-10-14 17:56:30,654 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 17:56:30,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:30,655 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 95 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:30,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 144 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 17:56:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 17:56:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-14 17:56:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-10-14 17:56:30,658 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2024-10-14 17:56:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-10-14 17:56:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-10-14 17:56:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:56:30,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:30,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:56:30,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 66317052, now seen corresponding path program 1 times [2024-10-14 17:56:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928686767] [2024-10-14 17:56:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:30,732 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-14 17:56:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:30,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928686767] [2024-10-14 17:56:30,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928686767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936993043] [2024-10-14 17:56:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:30,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:30,734 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:30,828 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-10-14 17:56:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:56:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:30,829 INFO L225 Difference]: With dead ends: 85 [2024-10-14 17:56:30,829 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 17:56:30,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:30,830 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:30,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 104 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 17:56:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 17:56:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.84) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-14 17:56:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-10-14 17:56:30,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2024-10-14 17:56:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:30,833 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-10-14 17:56:30,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-10-14 17:56:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:56:30,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:30,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:30,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:56:30,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:30,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash 66317053, now seen corresponding path program 1 times [2024-10-14 17:56:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:30,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831741245] [2024-10-14 17:56:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:30,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:30,961 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-14 17:56:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831741245] [2024-10-14 17:56:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831741245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129830805] [2024-10-14 17:56:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:56:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:56:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:30,963 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:31,066 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-10-14 17:56:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:56:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:31,067 INFO L225 Difference]: With dead ends: 80 [2024-10-14 17:56:31,067 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 17:56:31,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:56:31,067 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:31,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 149 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 17:56:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 17:56:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.72) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-14 17:56:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-10-14 17:56:31,069 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 16 [2024-10-14 17:56:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:31,069 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-10-14 17:56:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-10-14 17:56:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:56:31,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:31,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:56:31,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 66320432, now seen corresponding path program 1 times [2024-10-14 17:56:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678740369] [2024-10-14 17:56:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:31,154 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-14 17:56:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678740369] [2024-10-14 17:56:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678740369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:31,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:56:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093908312] [2024-10-14 17:56:31,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:31,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:31,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:31,156 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) 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-14 17:56:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:31,354 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-10-14 17:56:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:56:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) 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-14 17:56:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:31,355 INFO L225 Difference]: With dead ends: 78 [2024-10-14 17:56:31,355 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 17:56:31,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:56:31,356 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 125 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:31,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 137 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:56:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 17:56:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-14 17:56:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-14 17:56:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-10-14 17:56:31,358 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 16 [2024-10-14 17:56:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:31,358 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-10-14 17:56:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) 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-14 17:56:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-10-14 17:56:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:56:31,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:31,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:56:31,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:31,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash 66320433, now seen corresponding path program 1 times [2024-10-14 17:56:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006302897] [2024-10-14 17:56:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:31,595 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-14 17:56:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006302897] [2024-10-14 17:56:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006302897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 17:56:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47285800] [2024-10-14 17:56:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:31,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:56:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:56:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:56:31,597 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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-14 17:56:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:31,761 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-10-14 17:56:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:56:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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-14 17:56:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:31,761 INFO L225 Difference]: With dead ends: 108 [2024-10-14 17:56:31,761 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 17:56:31,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:56:31,762 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 192 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:31,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 174 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 17:56:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2024-10-14 17:56:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.710144927536232) internal successors, (118), 94 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-14 17:56:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-10-14 17:56:31,764 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 16 [2024-10-14 17:56:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:31,764 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-10-14 17:56:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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-14 17:56:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-10-14 17:56:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:56:31,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:31,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:56:31,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -33533053, now seen corresponding path program 1 times [2024-10-14 17:56:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380077439] [2024-10-14 17:56:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:31,880 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-14 17:56:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380077439] [2024-10-14 17:56:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380077439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:56:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548772600] [2024-10-14 17:56:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:31,882 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-14 17:56:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:31,962 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-10-14 17:56:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:56:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-14 17:56:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:31,963 INFO L225 Difference]: With dead ends: 102 [2024-10-14 17:56:31,963 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 17:56:31,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:56:31,964 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 52 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:31,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 286 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 17:56:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-10-14 17:56:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.7) internal successors, (119), 95 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-14 17:56:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2024-10-14 17:56:31,967 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 19 [2024-10-14 17:56:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2024-10-14 17:56:31,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-14 17:56:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2024-10-14 17:56:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:56:31,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:31,969 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-14 17:56:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:56:31,969 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448246, now seen corresponding path program 1 times [2024-10-14 17:56:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368033030] [2024-10-14 17:56:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:32,057 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-14 17:56:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368033030] [2024-10-14 17:56:32,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368033030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:32,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:32,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:56:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196983034] [2024-10-14 17:56:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:32,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:32,059 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:32,191 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2024-10-14 17:56:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:56:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 17:56:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:32,192 INFO L225 Difference]: With dead ends: 101 [2024-10-14 17:56:32,192 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 17:56:32,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:56:32,193 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 47 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:32,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 189 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 17:56:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-10-14 17:56:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-14 17:56:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2024-10-14 17:56:32,195 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 20 [2024-10-14 17:56:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2024-10-14 17:56:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2024-10-14 17:56:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:56:32,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:32,196 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-14 17:56:32,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:56:32,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448245, now seen corresponding path program 1 times [2024-10-14 17:56:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916801864] [2024-10-14 17:56:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:32,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916801864] [2024-10-14 17:56:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916801864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:32,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 17:56:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864936374] [2024-10-14 17:56:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:32,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:56:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:56:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:56:32,449 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:32,601 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2024-10-14 17:56:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:56:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 17:56:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:32,602 INFO L225 Difference]: With dead ends: 100 [2024-10-14 17:56:32,602 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 17:56:32,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:56:32,603 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 47 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:32,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 223 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 17:56:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-14 17:56:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 98 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-14 17:56:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2024-10-14 17:56:32,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 20 [2024-10-14 17:56:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2024-10-14 17:56:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2024-10-14 17:56:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:56:32,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:32,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:32,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:56:32,606 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:32,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 152939461, now seen corresponding path program 1 times [2024-10-14 17:56:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523201235] [2024-10-14 17:56:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:32,642 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-14 17:56:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523201235] [2024-10-14 17:56:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523201235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:56:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745979793] [2024-10-14 17:56:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:32,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:56:32,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:56:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:56:32,643 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-14 17:56:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:32,720 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2024-10-14 17:56:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:56:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:32,721 INFO L225 Difference]: With dead ends: 99 [2024-10-14 17:56:32,721 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 17:56:32,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:32,722 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:32,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 79 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 17:56:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-14 17:56:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.6) internal successors, (120), 97 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-14 17:56:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2024-10-14 17:56:32,724 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 21 [2024-10-14 17:56:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:32,724 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2024-10-14 17:56:32,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-14 17:56:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2024-10-14 17:56:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:56:32,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:32,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:32,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:56:32,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:32,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash 152939462, now seen corresponding path program 1 times [2024-10-14 17:56:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975913981] [2024-10-14 17:56:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:32,870 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-14 17:56:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975913981] [2024-10-14 17:56:32,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975913981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:32,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:56:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342434832] [2024-10-14 17:56:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:32,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:56:32,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:56:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:56:32,871 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:33,095 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2024-10-14 17:56:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:56:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:56:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:33,096 INFO L225 Difference]: With dead ends: 113 [2024-10-14 17:56:33,096 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 17:56:33,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:56:33,097 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 205 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:33,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 263 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:56:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 17:56:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-14 17:56:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-14 17:56:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-14 17:56:33,099 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 21 [2024-10-14 17:56:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:33,100 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-14 17:56:33,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-14 17:56:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:56:33,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:33,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:33,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:56:33,101 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:33,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 152945042, now seen corresponding path program 1 times [2024-10-14 17:56:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:33,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849466499] [2024-10-14 17:56:33,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:33,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849466499] [2024-10-14 17:56:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849466499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081132569] [2024-10-14 17:56:33,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:33,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:33,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:33,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:33,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:56:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:33,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 17:56:33,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:33,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:33,831 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 11 treesize of output 5 [2024-10-14 17:56:33,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:33,876 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-10-14 17:56:33,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-10-14 17:56:33,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-10-14 17:56:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 17:56:34,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-14 17:56:34,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-10-14 17:56:34,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-10-14 17:56:34,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 31 [2024-10-14 17:56:34,328 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 37 treesize of output 25 [2024-10-14 17:56:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-14 17:56:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:34,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:34,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_781) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2024-10-14 17:56:34,582 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| (select .cse0 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_780) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_781) (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2024-10-14 17:56:34,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-14 17:56:34,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:34,664 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 72 treesize of output 71 [2024-10-14 17:56:34,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2024-10-14 17:56:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081132569] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:35,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 37 [2024-10-14 17:56:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919775692] [2024-10-14 17:56:35,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:35,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-14 17:56:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-14 17:56:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1187, Unknown=30, NotChecked=142, Total=1482 [2024-10-14 17:56:35,280 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 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-14 17:56:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:36,491 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-10-14 17:56:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:56:36,491 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 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) Word has length 21 [2024-10-14 17:56:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:36,492 INFO L225 Difference]: With dead ends: 158 [2024-10-14 17:56:36,492 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 17:56:36,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=1993, Unknown=35, NotChecked=186, Total=2450 [2024-10-14 17:56:36,493 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 406 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:36,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 681 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1049 Invalid, 0 Unknown, 242 Unchecked, 0.7s Time] [2024-10-14 17:56:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 17:56:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 111. [2024-10-14 17:56:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 110 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-14 17:56:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2024-10-14 17:56:36,495 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 21 [2024-10-14 17:56:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2024-10-14 17:56:36,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 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-14 17:56:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2024-10-14 17:56:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:56:36,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:36,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:36,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:56:36,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 17:56:36,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:36,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 152945043, now seen corresponding path program 1 times [2024-10-14 17:56:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482528886] [2024-10-14 17:56:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:37,339 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-14 17:56:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482528886] [2024-10-14 17:56:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482528886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 17:56:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109933781] [2024-10-14 17:56:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:56:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:56:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:56:37,341 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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-14 17:56:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:37,687 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2024-10-14 17:56:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:56:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:56:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:37,689 INFO L225 Difference]: With dead ends: 130 [2024-10-14 17:56:37,689 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 17:56:37,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-14 17:56:37,692 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 66 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:37,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 497 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:56:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 17:56:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2024-10-14 17:56:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-14 17:56:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2024-10-14 17:56:37,697 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 21 [2024-10-14 17:56:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-10-14 17:56:37,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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-14 17:56:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2024-10-14 17:56:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:56:37,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:37,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:37,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:56:37,702 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:37,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1817621130, now seen corresponding path program 1 times [2024-10-14 17:56:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439769353] [2024-10-14 17:56:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:37,834 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-14 17:56:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439769353] [2024-10-14 17:56:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439769353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:56:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18559868] [2024-10-14 17:56:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:37,835 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:37,909 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2024-10-14 17:56:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:56:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 17:56:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:37,910 INFO L225 Difference]: With dead ends: 111 [2024-10-14 17:56:37,910 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 17:56:37,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:56:37,911 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 45 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:37,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 271 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 17:56:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 17:56:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 110 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2024-10-14 17:56:37,913 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 22 [2024-10-14 17:56:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:37,913 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2024-10-14 17:56:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2024-10-14 17:56:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:56:37,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:37,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:37,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:56:37,914 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash 511680389, now seen corresponding path program 1 times [2024-10-14 17:56:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374476115] [2024-10-14 17:56:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:38,031 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-14 17:56:38,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:38,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374476115] [2024-10-14 17:56:38,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374476115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:38,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:38,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:56:38,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126740205] [2024-10-14 17:56:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:56:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:38,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:56:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:38,033 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:38,125 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2024-10-14 17:56:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:56:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 17:56:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:38,126 INFO L225 Difference]: With dead ends: 112 [2024-10-14 17:56:38,126 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 17:56:38,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:56:38,126 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:38,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 242 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 17:56:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 17:56:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2024-10-14 17:56:38,128 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 23 [2024-10-14 17:56:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2024-10-14 17:56:38,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2024-10-14 17:56:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 17:56:38,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:38,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:38,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:56:38,129 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:38,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1317776916, now seen corresponding path program 1 times [2024-10-14 17:56:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:38,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776027163] [2024-10-14 17:56:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:38,173 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-14 17:56:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776027163] [2024-10-14 17:56:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776027163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:56:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859878230] [2024-10-14 17:56:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:38,175 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:38,244 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2024-10-14 17:56:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:56:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-14 17:56:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:38,245 INFO L225 Difference]: With dead ends: 111 [2024-10-14 17:56:38,245 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 17:56:38,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:56:38,246 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:38,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 181 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 17:56:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 17:56:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 110 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2024-10-14 17:56:38,248 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 24 [2024-10-14 17:56:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2024-10-14 17:56:38,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2024-10-14 17:56:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 17:56:38,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:38,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:38,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:56:38,249 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2098588748, now seen corresponding path program 1 times [2024-10-14 17:56:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:38,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533414322] [2024-10-14 17:56:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533414322] [2024-10-14 17:56:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533414322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899840682] [2024-10-14 17:56:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:38,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:38,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:38,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:56:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:38,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 17:56:38,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:38,535 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-14 17:56:38,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:38,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-14 17:56:38,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 17:56:38,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:56:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:38,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:38,630 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 6 treesize of output 4 [2024-10-14 17:56:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899840682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:38,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-14 17:56:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548147305] [2024-10-14 17:56:38,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:38,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:56:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:56:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:56:38,647 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:38,781 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2024-10-14 17:56:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:56:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-14 17:56:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:38,782 INFO L225 Difference]: With dead ends: 113 [2024-10-14 17:56:38,782 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 17:56:38,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:56:38,783 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:38,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 212 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 17:56:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 17:56:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 112 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-14 17:56:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2024-10-14 17:56:38,785 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 25 [2024-10-14 17:56:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2024-10-14 17:56:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2024-10-14 17:56:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:56:38,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:38,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:38,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 17:56:38,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 17:56:38,990 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1882812373, now seen corresponding path program 1 times [2024-10-14 17:56:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180331590] [2024-10-14 17:56:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:39,331 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-14 17:56:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180331590] [2024-10-14 17:56:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180331590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:39,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 17:56:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532262490] [2024-10-14 17:56:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:56:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:56:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:56:39,333 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:39,579 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-10-14 17:56:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:56:39,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 17:56:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:39,580 INFO L225 Difference]: With dead ends: 129 [2024-10-14 17:56:39,580 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 17:56:39,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-14 17:56:39,580 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 230 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:39,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 154 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:56:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 17:56:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2024-10-14 17:56:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-14 17:56:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2024-10-14 17:56:39,583 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 26 [2024-10-14 17:56:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2024-10-14 17:56:39,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2024-10-14 17:56:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:56:39,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:39,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:39,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 17:56:39,588 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1882817182, now seen corresponding path program 1 times [2024-10-14 17:56:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748664885] [2024-10-14 17:56:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:40,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:40,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748664885] [2024-10-14 17:56:40,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748664885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:40,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452478886] [2024-10-14 17:56:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:40,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:40,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:40,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:40,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:56:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:40,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-14 17:56:40,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:40,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:40,255 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 11 treesize of output 5 [2024-10-14 17:56:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:40,272 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:56:40,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:56:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 17:56:40,308 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-14 17:56:40,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-14 17:56:40,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-10-14 17:56:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:40,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2024-10-14 17:56:40,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:40,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2024-10-14 17:56:40,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2024-10-14 17:56:40,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-10-14 17:56:40,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-10-14 17:56:40,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2024-10-14 17:56:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 102 [2024-10-14 17:56:41,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:41,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 88 [2024-10-14 17:56:41,362 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-14 17:56:41,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:56:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452478886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:56:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [16] total 35 [2024-10-14 17:56:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941314770] [2024-10-14 17:56:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:41,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 17:56:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 17:56:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 17:56:41,365 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:42,361 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2024-10-14 17:56:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:56:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 17:56:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:42,362 INFO L225 Difference]: With dead ends: 131 [2024-10-14 17:56:42,362 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 17:56:42,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 17:56:42,363 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:42,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 479 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:56:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 17:56:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-14 17:56:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 123 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-14 17:56:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2024-10-14 17:56:42,364 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 26 [2024-10-14 17:56:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:42,364 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2024-10-14 17:56:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2024-10-14 17:56:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 17:56:42,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:42,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:42,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:56:42,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-14 17:56:42,566 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:42,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:42,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1760511481, now seen corresponding path program 1 times [2024-10-14 17:56:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843253631] [2024-10-14 17:56:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:42,601 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-14 17:56:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843253631] [2024-10-14 17:56:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843253631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:56:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272831782] [2024-10-14 17:56:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:56:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:56:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:56:42,603 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-14 17:56:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:42,693 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-10-14 17:56:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:56:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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 27 [2024-10-14 17:56:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:42,694 INFO L225 Difference]: With dead ends: 123 [2024-10-14 17:56:42,694 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 17:56:42,694 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-14 17:56:42,695 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:42,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 17:56:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-14 17:56:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 121 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) [2024-10-14 17:56:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2024-10-14 17:56:42,697 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 27 [2024-10-14 17:56:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2024-10-14 17:56:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-14 17:56:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2024-10-14 17:56:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 17:56:42,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:42,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 17:56:42,699 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1760511480, now seen corresponding path program 1 times [2024-10-14 17:56:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015852757] [2024-10-14 17:56:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:42,761 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-14 17:56:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:42,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015852757] [2024-10-14 17:56:42,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015852757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:42,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:42,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:56:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107827410] [2024-10-14 17:56:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:56:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:56:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:56:42,763 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-14 17:56:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:42,860 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2024-10-14 17:56:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:56:42,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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 27 [2024-10-14 17:56:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:42,861 INFO L225 Difference]: With dead ends: 121 [2024-10-14 17:56:42,861 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 17:56:42,861 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-14 17:56:42,861 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:42,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 17:56:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-10-14 17:56:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 119 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-10-14 17:56:42,863 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 27 [2024-10-14 17:56:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-10-14 17:56:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-14 17:56:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-10-14 17:56:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 17:56:42,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:42,864 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 17:56:42,864 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1513558067, now seen corresponding path program 1 times [2024-10-14 17:56:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675409713] [2024-10-14 17:56:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:56:42,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675409713] [2024-10-14 17:56:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675409713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:56:42,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:56:42,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:56:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022513114] [2024-10-14 17:56:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:56:42,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:56:42,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:56:42,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:42,939 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 17:56:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:43,043 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2024-10-14 17:56:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:56:43,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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 28 [2024-10-14 17:56:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:43,044 INFO L225 Difference]: With dead ends: 119 [2024-10-14 17:56:43,044 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 17:56:43,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:56:43,044 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:43,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 127 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:56:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 17:56:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-14 17:56:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 118 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2024-10-14 17:56:43,047 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 28 [2024-10-14 17:56:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:43,047 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2024-10-14 17:56:43,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 17:56:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2024-10-14 17:56:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:56:43,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:43,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:43,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 17:56:43,048 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -324263782, now seen corresponding path program 1 times [2024-10-14 17:56:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273686690] [2024-10-14 17:56:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:43,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273686690] [2024-10-14 17:56:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273686690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:43,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142465959] [2024-10-14 17:56:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:43,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:43,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:43,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:56:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:44,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-14 17:56:44,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:44,102 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 11 treesize of output 5 [2024-10-14 17:56:44,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:44,142 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-14 17:56:44,149 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:56:44,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:56:44,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:44,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:56:44,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 17:56:44,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:56:44,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-10-14 17:56:44,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2024-10-14 17:56:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2024-10-14 17:56:44,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 17:56:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:44,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2024-10-14 17:56:44,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:44,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-10-14 17:56:45,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 17:56:45,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:45,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2024-10-14 17:56:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:45,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:45,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:45,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2024-10-14 17:56:45,554 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:56:45,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2024-10-14 17:56:45,575 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-10-14 17:56:45,575 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 75 treesize of output 89 [2024-10-14 17:56:45,580 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 48 treesize of output 46 [2024-10-14 17:56:45,617 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:56:45,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-10-14 17:56:45,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:56:45,636 INFO L349 Elim1Store]: treesize reduction 42, result has 8.7 percent of original size [2024-10-14 17:56:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 22 [2024-10-14 17:56:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142465959] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:45,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 50 [2024-10-14 17:56:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405044981] [2024-10-14 17:56:45,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:45,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:56:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:45,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:56:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2454, Unknown=5, NotChecked=0, Total=2652 [2024-10-14 17:56:45,870 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 52 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 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-14 17:56:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:46,688 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2024-10-14 17:56:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:56:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 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 29 [2024-10-14 17:56:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:46,689 INFO L225 Difference]: With dead ends: 141 [2024-10-14 17:56:46,689 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 17:56:46,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=295, Invalid=3360, Unknown=5, NotChecked=0, Total=3660 [2024-10-14 17:56:46,690 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:46,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 550 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:56:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 17:56:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2024-10-14 17:56:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-14 17:56:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-10-14 17:56:46,693 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 29 [2024-10-14 17:56:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:46,693 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-10-14 17:56:46,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 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-14 17:56:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-10-14 17:56:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:56:46,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:46,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:46,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:56:46,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:46,898 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -324263781, now seen corresponding path program 1 times [2024-10-14 17:56:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421924565] [2024-10-14 17:56:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421924565] [2024-10-14 17:56:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421924565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843781465] [2024-10-14 17:56:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:47,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:47,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:56:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:47,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-14 17:56:47,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:47,846 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 11 treesize of output 5 [2024-10-14 17:56:47,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:47,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:47,872 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:56:47,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:56:47,877 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-14 17:56:47,881 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 8 treesize of output 1 [2024-10-14 17:56:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 17:56:47,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 17:56:48,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:56:48,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:56:48,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:48,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2024-10-14 17:56:48,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:48,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2024-10-14 17:56:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-10-14 17:56:48,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2024-10-14 17:56:48,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2024-10-14 17:56:48,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-10-14 17:56:48,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 17:56:48,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:48,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 22 [2024-10-14 17:56:48,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:48,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2024-10-14 17:56:48,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-10-14 17:56:49,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-10-14 17:56:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:49,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:49,926 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-10-14 17:56:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2024-10-14 17:56:49,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:49,937 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 70 treesize of output 73 [2024-10-14 17:56:49,987 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:56:49,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 86 [2024-10-14 17:56:50,005 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:56:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2024-10-14 17:56:50,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:56:50,015 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-14 17:56:50,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 33 [2024-10-14 17:56:50,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:56:50,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 17:56:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843781465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:50,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 55 [2024-10-14 17:56:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825161230] [2024-10-14 17:56:50,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:50,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-14 17:56:50,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-14 17:56:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2970, Unknown=8, NotChecked=0, Total=3192 [2024-10-14 17:56:50,396 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-14 17:56:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:51,931 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2024-10-14 17:56:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:56:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 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-14 17:56:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:51,932 INFO L225 Difference]: With dead ends: 140 [2024-10-14 17:56:51,932 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 17:56:51,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=370, Invalid=4592, Unknown=8, NotChecked=0, Total=4970 [2024-10-14 17:56:51,933 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:51,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 735 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:56:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 17:56:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2024-10-14 17:56:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 133 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2024-10-14 17:56:51,936 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 29 [2024-10-14 17:56:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2024-10-14 17:56:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-14 17:56:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2024-10-14 17:56:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:56:51,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:51,937 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:51,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:56:52,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-14 17:56:52,142 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1464603294, now seen corresponding path program 1 times [2024-10-14 17:56:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670766994] [2024-10-14 17:56:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:52,708 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-14 17:56:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670766994] [2024-10-14 17:56:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670766994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219613212] [2024-10-14 17:56:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:52,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:52,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 17:56:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:52,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-14 17:56:52,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:52,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:52,857 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 11 treesize of output 5 [2024-10-14 17:56:52,887 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:56:52,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:56:52,892 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-14 17:56:52,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:52,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 17:56:52,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 17:56:53,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:56:53,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:53,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-10-14 17:56:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 30 [2024-10-14 17:56:53,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 30 [2024-10-14 17:56:53,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:53,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-10-14 17:56:53,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:53,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2024-10-14 17:56:53,827 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-14 17:56:53,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 63 [2024-10-14 17:56:53,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:53,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 45 [2024-10-14 17:56:54,079 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-14 17:56:54,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:54,829 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:56:54,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-10-14 17:56:54,848 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-10-14 17:56:54,849 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 67 treesize of output 81 [2024-10-14 17:56:54,855 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 40 treesize of output 38 [2024-10-14 17:56:55,249 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 14 [2024-10-14 17:56:55,250 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 56 treesize of output 54 [2024-10-14 17:56:55,257 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 30 treesize of output 26 [2024-10-14 17:56:55,262 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 106 treesize of output 100 [2024-10-14 17:56:55,340 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-14 17:56:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219613212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:55,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 61 [2024-10-14 17:56:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390110394] [2024-10-14 17:56:55,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:55,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-14 17:56:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-14 17:56:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3549, Unknown=6, NotChecked=0, Total=3782 [2024-10-14 17:56:55,344 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:56:56,526 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2024-10-14 17:56:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:56:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 17:56:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:56:56,527 INFO L225 Difference]: With dead ends: 139 [2024-10-14 17:56:56,527 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 17:56:56,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=384, Invalid=5310, Unknown=6, NotChecked=0, Total=5700 [2024-10-14 17:56:56,528 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:56:56,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1252 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:56:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 17:56:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-10-14 17:56:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-14 17:56:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-10-14 17:56:56,530 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 30 [2024-10-14 17:56:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:56:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-10-14 17:56:56,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:56:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-10-14 17:56:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:56:56,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:56:56,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:56:56,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 17:56:56,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:56,732 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:56:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:56:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1915123674, now seen corresponding path program 1 times [2024-10-14 17:56:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:56:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860478427] [2024-10-14 17:56:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:56:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:56:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860478427] [2024-10-14 17:56:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860478427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:56:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883503426] [2024-10-14 17:56:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:56:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:56:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:56:57,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:56:57,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 17:56:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:56:57,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-14 17:56:57,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:56:57,472 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 11 treesize of output 5 [2024-10-14 17:56:57,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:56:57,489 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:56:57,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:56:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:56:57,495 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-14 17:56:57,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 17:56:57,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 17:56:57,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 17:56:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:56:57,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2024-10-14 17:56:57,796 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-10-14 17:56:57,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2024-10-14 17:56:57,865 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-10-14 17:56:57,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 42 [2024-10-14 17:56:58,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-14 17:56:58,086 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 7 [2024-10-14 17:56:58,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-10-14 17:56:58,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:58,256 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 31 treesize of output 13 [2024-10-14 17:56:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:58,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:56:58,874 INFO L349 Elim1Store]: treesize reduction 60, result has 50.0 percent of original size [2024-10-14 17:56:58,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 100 [2024-10-14 17:56:58,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:56:58,906 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 150 treesize of output 204 [2024-10-14 17:56:58,912 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 41 treesize of output 37 [2024-10-14 17:56:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:56:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883503426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:56:59,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:56:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 20] total 55 [2024-10-14 17:56:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059474384] [2024-10-14 17:56:59,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:56:59,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-14 17:56:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:56:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-14 17:56:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2929, Unknown=2, NotChecked=0, Total=3192 [2024-10-14 17:56:59,348 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-14 17:57:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:57:00,189 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2024-10-14 17:57:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 17:57:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 17:57:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:57:00,190 INFO L225 Difference]: With dead ends: 140 [2024-10-14 17:57:00,191 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 17:57:00,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=470, Invalid=4498, Unknown=2, NotChecked=0, Total=4970 [2024-10-14 17:57:00,192 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 57 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:57:00,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 906 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:57:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 17:57:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-10-14 17:57:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 135 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-14 17:57:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2024-10-14 17:57:00,194 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 31 [2024-10-14 17:57:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:57:00,194 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2024-10-14 17:57:00,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-14 17:57:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-10-14 17:57:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 17:57:00,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:57:00,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:57:00,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 17:57:00,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:57:00,399 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:57:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:57:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -760708043, now seen corresponding path program 1 times [2024-10-14 17:57:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:57:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567565326] [2024-10-14 17:57:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:57:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:57:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:57:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:57:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567565326] [2024-10-14 17:57:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567565326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:57:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975509893] [2024-10-14 17:57:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:57:01,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:57:01,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:57:01,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:57:01,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 17:57:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:57:01,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-14 17:57:01,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:57:01,213 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 11 treesize of output 5 [2024-10-14 17:57:01,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:57:01,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:57:01,226 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-14 17:57:01,232 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:57:01,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:57:01,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 17:57:01,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:57:01,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-14 17:57:01,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:01,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2024-10-14 17:57:01,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2024-10-14 17:57:01,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2024-10-14 17:57:01,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 17:57:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:01,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2024-10-14 17:57:01,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:01,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2024-10-14 17:57:02,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:02,020 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 32 treesize of output 12 [2024-10-14 17:57:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:02,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:57:02,431 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-10-14 17:57:02,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2024-10-14 17:57:02,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:02,449 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 76 treesize of output 103 [2024-10-14 17:57:02,496 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-14 17:57:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975509893] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:57:02,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:57:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 46 [2024-10-14 17:57:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545893406] [2024-10-14 17:57:02,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:57:02,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-14 17:57:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:57:02,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-14 17:57:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2059, Unknown=11, NotChecked=0, Total=2256 [2024-10-14 17:57:02,739 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 48 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 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-14 17:57:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:57:03,524 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2024-10-14 17:57:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:57:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 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-14 17:57:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:57:03,525 INFO L225 Difference]: With dead ends: 141 [2024-10-14 17:57:03,525 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 17:57:03,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2606, Unknown=11, NotChecked=0, Total=2862 [2024-10-14 17:57:03,526 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:57:03,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 979 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:57:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 17:57:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-14 17:57:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:57:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2024-10-14 17:57:03,528 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 32 [2024-10-14 17:57:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:57:03,535 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2024-10-14 17:57:03,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 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-14 17:57:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2024-10-14 17:57:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 17:57:03,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:57:03,535 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, 1, 1, 1, 1, 1] [2024-10-14 17:57:03,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 17:57:03,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-14 17:57:03,736 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:57:03,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:57:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -895982340, now seen corresponding path program 2 times [2024-10-14 17:57:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:57:03,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923575808] [2024-10-14 17:57:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:57:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:57:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:57:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:57:04,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923575808] [2024-10-14 17:57:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923575808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:57:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578601431] [2024-10-14 17:57:04,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:57:04,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:57:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:57:04,411 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:57:04,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 17:57:04,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:57:04,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:57:04,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-14 17:57:04,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:57:04,605 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 11 treesize of output 5 [2024-10-14 17:57:04,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:57:04,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:57:04,642 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-14 17:57:04,653 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-10-14 17:57:04,653 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 20 treesize of output 22 [2024-10-14 17:57:04,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 17:57:04,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 17:57:04,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:57:04,897 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-14 17:57:04,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2024-10-14 17:57:05,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-10-14 17:57:05,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-10-14 17:57:05,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 17:57:05,329 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 17:57:05,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2024-10-14 17:57:05,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:05,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-14 17:57:05,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:57:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:57:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:05,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:57:05,544 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 6 treesize of output 4 [2024-10-14 17:57:05,879 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-14 17:57:05,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-10-14 17:57:05,897 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-10-14 17:57:05,898 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 67 treesize of output 81 [2024-10-14 17:57:05,901 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 40 treesize of output 38 [2024-10-14 17:57:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578601431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:57:06,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:57:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2024-10-14 17:57:06,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191272837] [2024-10-14 17:57:06,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:57:06,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-14 17:57:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:57:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-14 17:57:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2641, Unknown=2, NotChecked=0, Total=2862 [2024-10-14 17:57:06,120 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-14 17:57:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:57:06,919 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2024-10-14 17:57:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:57:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 0 states have call successors, (0), 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-14 17:57:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:57:06,933 INFO L225 Difference]: With dead ends: 143 [2024-10-14 17:57:06,933 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 17:57:06,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=327, Invalid=3703, Unknown=2, NotChecked=0, Total=4032 [2024-10-14 17:57:06,934 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:57:06,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 894 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:57:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 17:57:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2024-10-14 17:57:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 128 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:57:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2024-10-14 17:57:06,937 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 34 [2024-10-14 17:57:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:57:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2024-10-14 17:57:06,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-14 17:57:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2024-10-14 17:57:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 17:57:06,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:57:06,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:57:06,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 17:57:07,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-14 17:57:07,143 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:57:07,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:57:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1306706250, now seen corresponding path program 2 times [2024-10-14 17:57:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:57:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325191812] [2024-10-14 17:57:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:57:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:57:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:57:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:57:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325191812] [2024-10-14 17:57:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325191812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:57:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443125098] [2024-10-14 17:57:08,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:57:08,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:57:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:57:08,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:57:08,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 17:57:08,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:57:08,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:57:08,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-10-14 17:57:08,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:57:08,292 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 11 treesize of output 5 [2024-10-14 17:57:08,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:57:08,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:57:08,331 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:57:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 17:57:08,335 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-14 17:57:08,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 17:57:08,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 17:57:08,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:57:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:08,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-10-14 17:57:08,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 17:57:08,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:08,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-14 17:57:08,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:08,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2024-10-14 17:57:08,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:08,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-10-14 17:57:09,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 17:57:09,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:09,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 71 [2024-10-14 17:57:09,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:09,955 INFO L349 Elim1Store]: treesize reduction 66, result has 29.0 percent of original size [2024-10-14 17:57:09,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 57 [2024-10-14 17:57:09,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:09,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 60 [2024-10-14 17:57:10,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:10,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:57:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2024-10-14 17:57:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:10,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:57:10,228 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 8 treesize of output 4 [2024-10-14 17:57:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 179 [2024-10-14 17:57:10,882 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 578 treesize of output 562 [2024-10-14 17:57:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443125098] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:57:11,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:57:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 63 [2024-10-14 17:57:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806521137] [2024-10-14 17:57:11,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:57:11,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-14 17:57:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:57:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-14 17:57:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3763, Unknown=0, NotChecked=0, Total=4032 [2024-10-14 17:57:11,246 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 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-14 17:57:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:57:12,477 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2024-10-14 17:57:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 17:57:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 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 38 [2024-10-14 17:57:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:57:12,478 INFO L225 Difference]: With dead ends: 145 [2024-10-14 17:57:12,478 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 17:57:12,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=394, Invalid=5156, Unknown=0, NotChecked=0, Total=5550 [2024-10-14 17:57:12,479 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:57:12,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1219 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:57:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 17:57:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2024-10-14 17:57:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 139 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-14 17:57:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2024-10-14 17:57:12,482 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 38 [2024-10-14 17:57:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:57:12,483 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2024-10-14 17:57:12,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 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-14 17:57:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2024-10-14 17:57:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 17:57:12,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:57:12,484 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:57:12,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 17:57:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-14 17:57:12,688 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-14 17:57:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:57:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1850827442, now seen corresponding path program 2 times [2024-10-14 17:57:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:57:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895012914] [2024-10-14 17:57:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:57:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:57:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:57:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:57:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:57:13,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895012914] [2024-10-14 17:57:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895012914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:57:13,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357106863] [2024-10-14 17:57:13,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:57:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:57:13,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:57:13,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:57:13,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 17:57:14,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:57:14,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:57:14,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-14 17:57:14,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:57:14,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:57:14,144 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-14 17:57:14,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 99 [2024-10-14 17:57:14,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 17:57:14,643 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 11 [2024-10-14 17:57:14,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:14,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-10-14 17:57:15,118 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-10-14 17:57:15,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-14 17:57:15,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:15,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-14 17:57:15,268 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-10-14 17:57:15,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-14 17:57:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:15,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-14 17:57:15,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:15,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-10-14 17:57:16,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:57:16,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:16,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2024-10-14 17:57:16,211 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-14 17:57:16,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 121 [2024-10-14 17:57:21,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:57:21,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1107 treesize of output 691 [2024-10-14 17:57:57,027 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse14 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse55 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse0 (not .cse55)) (.cse3 (not .cse14)) (.cse2 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1))) (or (and .cse0 (or (and (exists ((v_prenex_17 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select (store .cse1 v_arrayElimCell_212 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse1 v_arrayElimCell_212 v_prenex_17) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= |c_#valid| (store (store .cse2 v_arrayElimCell_212 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))))) .cse3) (and .cse3 (exists ((v_arrayElimCell_212 Int) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_212 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0)))) (and (exists ((v_arrayElimCell_212 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse4 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_6) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 v_DerPreprocessor_7) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_212 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= .cse4 v_DerPreprocessor_6) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse4) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0)))) .cse3) (and (or (exists ((v_prenex_15 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse5 (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select (store .cse5 v_arrayElimCell_212 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= |c_#valid| (store (store .cse2 v_arrayElimCell_212 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse5 v_arrayElimCell_212 v_prenex_15) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0)))) (exists ((v_prenex_23 Int) (v_arrayElimCell_212 Int) (v_DerPreprocessor_10 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse8 (select |c_#valid| v_arrayElimCell_212))) (let ((.cse7 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 .cse8) v_prenex_23 0))) (let ((.cse6 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_10) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 (select .cse7 v_arrayElimCell_212)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse6) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0) (not (= v_prenex_23 v_arrayElimCell_212)) (= (select .cse7 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_212 .cse8) v_prenex_23 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= v_DerPreprocessor_10 .cse6)))))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_14 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse9 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 v_DerPreprocessor_11) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse9) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_212 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= .cse9 v_prenex_14)))) (exists ((v_prenex_16 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse12 (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1)) (.cse10 (select |c_#valid| v_arrayElimCell_212))) (let ((.cse11 (store (store .cse12 v_arrayElimCell_212 .cse10) v_prenex_16 0))) (and (= |c_#valid| (store (store (store .cse2 v_arrayElimCell_212 .cse10) v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (not (= v_prenex_16 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= (select .cse11 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (not (= v_prenex_16 v_arrayElimCell_212)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse12 v_arrayElimCell_212 (select .cse11 v_arrayElimCell_212)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)))))) (exists ((v_prenex_24 Int) (v_prenex_13 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_13 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_13 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0))) (exists ((v_prenex_12 Int) (v_prenex_24 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_12) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_12 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))) (exists ((v_prenex_12 Int) (v_prenex_24 Int) (v_arrayElimCell_212 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse13 (select |c_#valid| v_arrayElimCell_212))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_212 .cse13) v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (not (= v_prenex_12 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (not (= v_prenex_12 v_arrayElimCell_212)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212 .cse13) v_prenex_12 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_arrayElimCell_212) 0))))) .cse3) (and .cse14 (or (exists ((v_prenex_22 Int) (v_prenex_21 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_22) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_21) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_21 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_21 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))) (exists ((v_prenex_20 Int) (v_prenex_19 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int) (v_prenex_9 Int)) (let ((.cse15 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_20) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_9 v_prenex_19) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_9 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse15) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_9) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_9 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= .cse15 v_prenex_20)))) (exists ((v_prenex_11 Int) (v_prenex_10 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse16 (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse16 v_prenex_11 v_prenex_10) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 1) v_prenex_11) 0) (= (select (store .cse16 v_prenex_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store .cse2 v_prenex_11 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|))))))))) (and .cse0 (or (exists ((v_prenex_17 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse17 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse18 (store .cse17 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse17 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_prenex_17) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select .cse18 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| .cse18) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0))))) (exists ((v_prenex_18 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse19 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))) (and (= |c_#valid| .cse19) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_18) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select .cse19 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (exists ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse20 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_6) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_7) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) (.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))) (and (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse20) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= |c_#valid| .cse21) (= .cse20 v_DerPreprocessor_6) (= (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (and (or (exists ((v_prenex_28 Int) (v_DerPreprocessor_17 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_28) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_17) v_arrayElimCell_211 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1))) (exists ((v_DerPreprocessor_16 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse22 (store (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_16) v_arrayElimCell_211 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse2 v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| (select .cse22 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store .cse2 v_arrayElimCell_211 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))))) .cse3) (and (exists ((v_arrayElimCell_212 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse24 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_6) v_arrayElimCell_211 1) v_arrayElimCell_212 v_DerPreprocessor_7) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) (.cse23 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_arrayElimCell_212 0))) (and (= (select .cse23 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= .cse24 v_DerPreprocessor_6) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse24) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (= |c_#valid| (store .cse23 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))))) .cse3) (and .cse3 (exists ((v_prenex_18 Int) (v_DerPreprocessor_15 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_40| Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse25 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1))) (let ((.cse26 (store (store .cse25 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_15) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_40| 0))) (and (= |c_#valid| (store (store .cse25 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_40| 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select .cse26 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) v_DerPreprocessor_15) (= (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_18) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0)))))) (and .cse3 (or (exists ((v_prenex_12 Int) (v_prenex_24 Int) (v_arrayElimCell_211 Int) (v_DerPreprocessor_20 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse28 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1))) (let ((.cse27 (store (store .cse28 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_20) v_prenex_12 0))) (and (= v_DerPreprocessor_20 (select .cse27 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (not (= v_prenex_12 v_arrayElimCell_211)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= |c_#valid| (store (store .cse28 v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))))) (exists ((v_prenex_15 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse30 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse29 (store .cse30 v_arrayElimCell_212 0))) (and (= (select .cse29 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= |c_#valid| (store .cse29 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse30 v_arrayElimCell_212 v_prenex_15) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) v_arrayElimCell_212) 0))))) (exists ((v_DerPreprocessor_11 Int) (v_prenex_14 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse31 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_arrayElimCell_212 0)) (.cse32 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) v_arrayElimCell_211 1) v_arrayElimCell_212 v_DerPreprocessor_11) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= (select .cse31 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= .cse32 v_prenex_14) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse32) v_arrayElimCell_211 1) v_arrayElimCell_212) 0)))) (exists ((v_prenex_12 Int) (v_prenex_24 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_prenex_12 0))) (and (= (select .cse33 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) v_arrayElimCell_211 1) v_prenex_12) 0) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))))) (exists ((v_prenex_13 Int) (v_prenex_24 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse34 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_prenex_13 0))) (and (= |c_#valid| (store .cse34 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (= (select .cse34 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (exists ((v_prenex_16 Int) (v_DerPreprocessor_18 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse35 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse36 (store (store .cse35 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_18) v_prenex_16 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse35 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| (select .cse36 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (not (= v_prenex_16 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= |c_#valid| (store (store .cse35 v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select .cse36 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= v_prenex_16 v_arrayElimCell_211)))))) (exists ((v_prenex_23 Int) (v_arrayElimCell_211 Int) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_10 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse38 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1))) (let ((.cse37 (store (store .cse38 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_19) v_prenex_23 0))) (let ((.cse39 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_10) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| (select .cse37 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= (select .cse37 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store .cse38 v_prenex_23 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= v_DerPreprocessor_10 .cse39) (not (= v_prenex_23 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse39) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0)))))) (exists ((v_prenex_12 Int) (v_prenex_24 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse40 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_arrayElimCell_212 (select |c_#valid| v_arrayElimCell_212)) v_prenex_12 0))) (and (= (select .cse40 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= v_prenex_12 v_arrayElimCell_212)) (not (= v_prenex_12 v_arrayElimCell_211)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (= |c_#valid| (store .cse40 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (not (= v_arrayElimCell_212 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|))))) (exists ((v_prenex_23 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (v_DerPreprocessor_10 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse42 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_arrayElimCell_212 (select |c_#valid| v_arrayElimCell_212)) v_prenex_23 0))) (let ((.cse41 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_10) v_arrayElimCell_211 1) v_arrayElimCell_212 (select .cse42 v_arrayElimCell_212)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (not (= v_prenex_23 v_arrayElimCell_212)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse41) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (= v_DerPreprocessor_10 .cse41) (= (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store .cse42 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (not (= v_arrayElimCell_212 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)))))) (exists ((v_prenex_16 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse44 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse43 (store (store .cse44 v_arrayElimCell_212 (select |c_#valid| v_arrayElimCell_212)) v_prenex_16 0))) (and (= (select .cse43 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse44 v_arrayElimCell_212 (select .cse43 v_arrayElimCell_212)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (not (= v_prenex_16 v_arrayElimCell_212)) (= |c_#valid| (store .cse43 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (not (= v_prenex_16 v_arrayElimCell_211)) (not (= v_arrayElimCell_212 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)))))))) (and (exists ((v_prenex_17 Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse46 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse45 (store .cse46 v_arrayElimCell_212 0))) (and (= (select .cse45 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse46 v_arrayElimCell_212 v_prenex_17) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= |c_#valid| (store .cse45 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0))))) .cse3) (and (exists ((v_arrayElimCell_212 Int) (v_arrayElimCell_211 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int) (v_DerPreprocessor_1 Int)) (let ((.cse47 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_arrayElimCell_212 0))) (and (= (select .cse47 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_211 1) v_arrayElimCell_212) 0) (= |c_#valid| (store .cse47 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))))) .cse3) (exists ((v_arrayElimCell_211 Int) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0))) (and (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_211 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) (= |c_#valid| .cse48) (= (select .cse48 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (and (or (exists ((v_arrayElimCell_211 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int) (v_prenex_9 Int)) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_prenex_9 0)) (.cse50 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_20) v_arrayElimCell_211 1) v_prenex_9 v_prenex_19) |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (= |c_#valid| (store .cse49 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse50) v_arrayElimCell_211 1) v_prenex_9) 0) (= (select .cse49 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= v_prenex_20 .cse50)))) (exists ((v_prenex_11 Int) (v_arrayElimCell_211 Int) (v_prenex_10 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse51 (store .cse2 v_arrayElimCell_211 1))) (let ((.cse52 (store .cse51 v_prenex_11 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse51 v_prenex_11 v_prenex_10) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_211 1) v_prenex_11) 0) (= (select .cse52 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_211)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= |c_#valid| (store .cse52 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))))) (exists ((v_prenex_22 Int) (v_arrayElimCell_211 Int) (v_prenex_21 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse53 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211 1) v_prenex_21 0))) (and (= (select .cse53 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_22) v_arrayElimCell_211 1) v_prenex_21) 0) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)))))) .cse14))) (and (or (exists ((v_DerPreprocessor_22 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (let ((.cse54 (store (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_22) v_prenex_25 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_25) 0) (= |c_#valid| (store (store .cse2 v_prenex_25 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select .cse54 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse2 v_prenex_25 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| (select .cse54 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_prenex_25 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_DerPreprocessor_21 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| Int)) (and (= 1 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| v_DerPreprocessor_21) v_prenex_27 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_26) v_prenex_27 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_27 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_41| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_27) 0)))) .cse55)))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0)) is different from false