/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-manipulation/tree-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 18:15:49,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 18:15:49,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 18:15:49,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 18:15:49,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 18:15:49,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 18:15:49,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 18:15:49,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 18:15:49,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 18:15:49,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 18:15:49,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 18:15:49,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 18:15:49,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 18:15:49,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 18:15:49,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 18:15:49,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 18:15:49,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 18:15:49,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 18:15:49,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 18:15:49,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 18:15:49,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 18:15:49,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 18:15:49,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 18:15:49,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 18:15:49,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 18:15:49,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 18:15:49,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 18:15:49,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 18:15:49,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 18:15:49,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 18:15:49,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 18:15:49,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 18:15:49,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 18:15:49,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 18:15:49,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 18:15:49,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 18:15:49,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 18:15:49,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 18:15:49,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 18:15:49,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 18:15:49,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 18:15:49,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 18:15:49,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 18:15:49,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 18:15:49,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 18:15:49,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 18:15:49,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 18:15:49,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 18:15:49,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 18:15:49,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 18:15:49,316 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 18:15:49,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 18:15:49,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 18:15:49,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 18:15:49,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 18:15:49,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 18:15:49,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 18:15:49,318 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 18:15:49,318 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 18:15:49,318 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 18:15:49,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 18:15:49,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 18:15:49,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 18:15:49,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 18:15:49,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 18:15:49,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 18:15:49,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 18:15:49,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:15:49,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 18:15:49,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 18:15:49,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 18:15:49,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 18:15:49,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 18:15:49,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 18:15:49,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 18:15:49,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 18:15:49,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 18:15:49,735 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 18:15:49,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-3.i [2022-10-15 18:15:49,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b40e3e5d/e51a62c139464a03bad2918571cb5aad/FLAGdad15a2e9 [2022-10-15 18:15:50,616 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 18:15:50,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i [2022-10-15 18:15:50,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b40e3e5d/e51a62c139464a03bad2918571cb5aad/FLAGdad15a2e9 [2022-10-15 18:15:50,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b40e3e5d/e51a62c139464a03bad2918571cb5aad [2022-10-15 18:15:50,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 18:15:50,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 18:15:50,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 18:15:50,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 18:15:50,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 18:15:50,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:15:50" (1/1) ... [2022-10-15 18:15:50,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70221db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:50, skipping insertion in model container [2022-10-15 18:15:50,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:15:50" (1/1) ... [2022-10-15 18:15:50,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 18:15:50,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 18:15:51,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i[22626,22639] [2022-10-15 18:15:51,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:15:51,228 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 18:15:51,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i[22626,22639] [2022-10-15 18:15:51,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:15:51,341 INFO L208 MainTranslator]: Completed translation [2022-10-15 18:15:51,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51 WrapperNode [2022-10-15 18:15:51,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 18:15:51,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 18:15:51,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 18:15:51,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 18:15:51,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,442 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-10-15 18:15:51,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 18:15:51,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 18:15:51,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 18:15:51,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 18:15:51,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 18:15:51,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 18:15:51,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 18:15:51,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 18:15:51,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (1/1) ... [2022-10-15 18:15:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:15:51,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:15:51,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 18:15:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 18:15:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 18:15:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-10-15 18:15:51,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-10-15 18:15:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 18:15:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 18:15:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 18:15:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 18:15:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 18:15:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 18:15:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 18:15:51,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 18:15:51,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 18:15:51,821 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 18:15:51,826 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 18:15:52,365 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 18:15:52,380 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 18:15:52,380 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-10-15 18:15:52,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:15:52 BoogieIcfgContainer [2022-10-15 18:15:52,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 18:15:52,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 18:15:52,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 18:15:52,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 18:15:52,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:15:50" (1/3) ... [2022-10-15 18:15:52,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd91d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:15:52, skipping insertion in model container [2022-10-15 18:15:52,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:15:51" (2/3) ... [2022-10-15 18:15:52,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd91d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:15:52, skipping insertion in model container [2022-10-15 18:15:52,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:15:52" (3/3) ... [2022-10-15 18:15:52,394 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-3.i [2022-10-15 18:15:52,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 18:15:52,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-10-15 18:15:52,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 18:15:52,480 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@290d7210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 18:15:52,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-10-15 18:15:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 80 states have (on average 2.175) internal successors, (174), 148 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:15:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 18:15:52,494 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:52,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 18:15:52,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash 31597456, now seen corresponding path program 1 times [2022-10-15 18:15:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:52,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870807451] [2022-10-15 18:15:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:52,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870807451] [2022-10-15 18:15:52,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870807451] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:52,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:52,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:15:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868595578] [2022-10-15 18:15:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:52,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 18:15:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 18:15:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 18:15:52,707 INFO L87 Difference]: Start difference. First operand has 150 states, 80 states have (on average 2.175) internal successors, (174), 148 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:52,748 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2022-10-15 18:15:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 18:15:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-10-15 18:15:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:52,767 INFO L225 Difference]: With dead ends: 148 [2022-10-15 18:15:52,768 INFO L226 Difference]: Without dead ends: 146 [2022-10-15 18:15:52,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 18:15:52,776 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:52,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:15:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-15 18:15:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-10-15 18:15:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 78 states have (on average 2.0) internal successors, (156), 144 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2022-10-15 18:15:52,852 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 5 [2022-10-15 18:15:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:52,852 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2022-10-15 18:15:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-10-15 18:15:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 18:15:52,853 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:52,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 18:15:52,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 18:15:52,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 978320840, now seen corresponding path program 1 times [2022-10-15 18:15:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:52,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307910851] [2022-10-15 18:15:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:52,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307910851] [2022-10-15 18:15:52,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307910851] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:52,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:52,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:15:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668195470] [2022-10-15 18:15:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:52,943 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:53,026 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2022-10-15 18:15:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 18:15:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:53,029 INFO L225 Difference]: With dead ends: 150 [2022-10-15 18:15:53,029 INFO L226 Difference]: Without dead ends: 150 [2022-10-15 18:15:53,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:53,031 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 89 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:53,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:15:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-15 18:15:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-10-15 18:15:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 82 states have (on average 1.9634146341463414) internal successors, (161), 148 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-10-15 18:15:53,045 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 6 [2022-10-15 18:15:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-10-15 18:15:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-10-15 18:15:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 18:15:53,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:53,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 18:15:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 18:15:53,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 978321707, now seen corresponding path program 1 times [2022-10-15 18:15:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:53,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443178533] [2022-10-15 18:15:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:53,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443178533] [2022-10-15 18:15:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443178533] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:53,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:53,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:15:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555795883] [2022-10-15 18:15:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:53,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:53,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:53,230 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:53,402 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2022-10-15 18:15:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:53,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 18:15:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:53,406 INFO L225 Difference]: With dead ends: 225 [2022-10-15 18:15:53,406 INFO L226 Difference]: Without dead ends: 225 [2022-10-15 18:15:53,406 INFO L412 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 [2022-10-15 18:15:53,408 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 135 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:53,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 237 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:15:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-10-15 18:15:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2022-10-15 18:15:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.8571428571428572) internal successors, (156), 141 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2022-10-15 18:15:53,422 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 6 [2022-10-15 18:15:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:53,422 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2022-10-15 18:15:53,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2022-10-15 18:15:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 18:15:53,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:53,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 18:15:53,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 18:15:53,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 978321708, now seen corresponding path program 1 times [2022-10-15 18:15:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:53,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876155516] [2022-10-15 18:15:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:53,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876155516] [2022-10-15 18:15:53,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876155516] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:53,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:53,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:15:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111941968] [2022-10-15 18:15:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:53,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:53,562 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:53,803 INFO L93 Difference]: Finished difference Result 245 states and 269 transitions. [2022-10-15 18:15:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 18:15:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:53,806 INFO L225 Difference]: With dead ends: 245 [2022-10-15 18:15:53,806 INFO L226 Difference]: Without dead ends: 245 [2022-10-15 18:15:53,807 INFO L412 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 [2022-10-15 18:15:53,819 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 129 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:53,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 267 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:15:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-10-15 18:15:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 154. [2022-10-15 18:15:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.7575757575757576) internal successors, (174), 152 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2022-10-15 18:15:53,848 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 6 [2022-10-15 18:15:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:53,849 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2022-10-15 18:15:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2022-10-15 18:15:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 18:15:53,854 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:53,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:53,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 18:15:53,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash -466102223, now seen corresponding path program 1 times [2022-10-15 18:15:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:53,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064088215] [2022-10-15 18:15:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:53,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064088215] [2022-10-15 18:15:53,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064088215] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:53,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:53,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:15:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254815504] [2022-10-15 18:15:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:53,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:53,948 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:53,971 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2022-10-15 18:15:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 18:15:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:53,974 INFO L225 Difference]: With dead ends: 244 [2022-10-15 18:15:53,974 INFO L226 Difference]: Without dead ends: 244 [2022-10-15 18:15:53,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:53,979 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 95 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:53,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 280 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:15:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-15 18:15:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-10-15 18:15:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.7281553398058251) internal successors, (178), 156 states have internal predecessors, (178), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2022-10-15 18:15:53,998 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 9 [2022-10-15 18:15:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:53,999 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2022-10-15 18:15:54,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2022-10-15 18:15:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:15:54,005 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:54,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 18:15:54,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2086018299, now seen corresponding path program 1 times [2022-10-15 18:15:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641984814] [2022-10-15 18:15:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:54,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641984814] [2022-10-15 18:15:54,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641984814] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:54,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:54,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:15:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007642417] [2022-10-15 18:15:54,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:54,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:54,058 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:54,163 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2022-10-15 18:15:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:15:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:54,166 INFO L225 Difference]: With dead ends: 238 [2022-10-15 18:15:54,166 INFO L226 Difference]: Without dead ends: 237 [2022-10-15 18:15:54,166 INFO L412 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 [2022-10-15 18:15:54,167 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 79 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:54,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 202 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:15:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-10-15 18:15:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 162. [2022-10-15 18:15:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.7009345794392523) internal successors, (182), 160 states have internal predecessors, (182), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2022-10-15 18:15:54,175 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 10 [2022-10-15 18:15:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:54,175 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2022-10-15 18:15:54,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2022-10-15 18:15:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 18:15:54,176 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:54,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:54,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 18:15:54,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:54,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1086230832, now seen corresponding path program 1 times [2022-10-15 18:15:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:54,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56971153] [2022-10-15 18:15:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:54,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56971153] [2022-10-15 18:15:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56971153] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:54,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:54,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 18:15:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943229092] [2022-10-15 18:15:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:54,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:15:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:54,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:15:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:15:54,255 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:54,308 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2022-10-15 18:15:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:15:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 18:15:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:54,310 INFO L225 Difference]: With dead ends: 168 [2022-10-15 18:15:54,310 INFO L226 Difference]: Without dead ends: 163 [2022-10-15 18:15:54,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:15:54,311 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 13 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:54,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 558 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:15:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-15 18:15:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-10-15 18:15:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.7254901960784315) internal successors, (176), 155 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-10-15 18:15:54,318 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 12 [2022-10-15 18:15:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:54,318 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-10-15 18:15:54,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-10-15 18:15:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 18:15:54,320 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:54,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:54,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 18:15:54,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1236336838, now seen corresponding path program 1 times [2022-10-15 18:15:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012855194] [2022-10-15 18:15:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012855194] [2022-10-15 18:15:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012855194] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:15:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555338935] [2022-10-15 18:15:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:15:54,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:15:54,583 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) [2022-10-15 18:15:54,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 18:15:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:54,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 18:15:54,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:15:54,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 18:15:54,783 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 18:15:54,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 18:15:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:54,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:15:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:54,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555338935] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:15:54,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:15:54,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-10-15 18:15:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531908913] [2022-10-15 18:15:54,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:15:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 18:15:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 18:15:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:15:54,984 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:55,238 INFO L93 Difference]: Finished difference Result 280 states and 314 transitions. [2022-10-15 18:15:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:15:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 18:15:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:55,241 INFO L225 Difference]: With dead ends: 280 [2022-10-15 18:15:55,242 INFO L226 Difference]: Without dead ends: 280 [2022-10-15 18:15:55,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-15 18:15:55,243 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 760 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:55,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 306 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2022-10-15 18:15:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-10-15 18:15:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 156. [2022-10-15 18:15:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 154 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2022-10-15 18:15:55,249 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 19 [2022-10-15 18:15:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:55,250 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2022-10-15 18:15:55,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2022-10-15 18:15:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 18:15:55,251 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:55,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:55,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 18:15:55,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:15:55,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1236336837, now seen corresponding path program 1 times [2022-10-15 18:15:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:55,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297027755] [2022-10-15 18:15:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297027755] [2022-10-15 18:15:55,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297027755] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:15:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262796654] [2022-10-15 18:15:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:15:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:15:55,691 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) [2022-10-15 18:15:55,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 18:15:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:55,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 18:15:55,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:15:55,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 18:15:55,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:15:55,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-10-15 18:15:55,867 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 18:15:55,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-10-15 18:15:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:55,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:15:56,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-10-15 18:15:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:56,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262796654] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:15:56,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:15:56,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 18:15:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082947929] [2022-10-15 18:15:56,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:15:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 18:15:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 18:15:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-10-15 18:15:56,183 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:56,599 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions. [2022-10-15 18:15:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 18:15:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 18:15:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:56,602 INFO L225 Difference]: With dead ends: 333 [2022-10-15 18:15:56,602 INFO L226 Difference]: Without dead ends: 333 [2022-10-15 18:15:56,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-10-15 18:15:56,603 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1400 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:56,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 363 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 301 Invalid, 0 Unknown, 178 Unchecked, 0.3s Time] [2022-10-15 18:15:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-10-15 18:15:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 155. [2022-10-15 18:15:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 153 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2022-10-15 18:15:56,609 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 19 [2022-10-15 18:15:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:56,610 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2022-10-15 18:15:56,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2022-10-15 18:15:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 18:15:56,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:56,611 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:56,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 18:15:56,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 18:15:56,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -316418286, now seen corresponding path program 1 times [2022-10-15 18:15:56,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:56,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853650119] [2022-10-15 18:15:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:56,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853650119] [2022-10-15 18:15:56,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853650119] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:56,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:56,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:15:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729257865] [2022-10-15 18:15:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:56,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:15:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:15:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:56,857 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2022-10-15 18:15:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:56,900 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2022-10-15 18:15:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:15:56,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 [2022-10-15 18:15:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:56,903 INFO L225 Difference]: With dead ends: 163 [2022-10-15 18:15:56,903 INFO L226 Difference]: Without dead ends: 163 [2022-10-15 18:15:56,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:15:56,904 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 30 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:56,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 237 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:15:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-15 18:15:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2022-10-15 18:15:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.693069306930693) internal successors, (171), 152 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2022-10-15 18:15:56,911 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 20 [2022-10-15 18:15:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:56,911 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2022-10-15 18:15:56,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2022-10-15 18:15:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2022-10-15 18:15:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 18:15:56,915 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:56,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:56,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 18:15:56,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1793967576, now seen corresponding path program 1 times [2022-10-15 18:15:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:56,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908235885] [2022-10-15 18:15:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 18:15:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:57,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908235885] [2022-10-15 18:15:57,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908235885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:57,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:57,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:15:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653832359] [2022-10-15 18:15:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:15:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:15:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:15:57,080 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2022-10-15 18:15:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:57,217 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-10-15 18:15:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 18:15:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 22 [2022-10-15 18:15:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:57,219 INFO L225 Difference]: With dead ends: 153 [2022-10-15 18:15:57,219 INFO L226 Difference]: Without dead ends: 153 [2022-10-15 18:15:57,219 INFO L412 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 [2022-10-15 18:15:57,220 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 7 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:57,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 376 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:15:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-15 18:15:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-10-15 18:15:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 101 states have (on average 1.6732673267326732) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-10-15 18:15:57,225 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 22 [2022-10-15 18:15:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:57,227 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-10-15 18:15:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2022-10-15 18:15:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-10-15 18:15:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 18:15:57,228 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:57,229 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:15:57,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 18:15:57,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1793967575, now seen corresponding path program 1 times [2022-10-15 18:15:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:57,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144393987] [2022-10-15 18:15:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 18:15:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:57,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144393987] [2022-10-15 18:15:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144393987] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:15:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426383925] [2022-10-15 18:15:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:15:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:15:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:15:57,496 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2022-10-15 18:15:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:57,647 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2022-10-15 18:15:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 18:15:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 22 [2022-10-15 18:15:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:57,649 INFO L225 Difference]: With dead ends: 152 [2022-10-15 18:15:57,649 INFO L226 Difference]: Without dead ends: 152 [2022-10-15 18:15:57,649 INFO L412 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 [2022-10-15 18:15:57,650 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:57,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 389 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:15:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-10-15 18:15:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-10-15 18:15:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 150 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2022-10-15 18:15:57,655 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 22 [2022-10-15 18:15:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:57,656 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2022-10-15 18:15:57,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2022-10-15 18:15:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2022-10-15 18:15:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 18:15:57,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:57,661 INFO L195 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] [2022-10-15 18:15:57,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 18:15:57,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1809938831, now seen corresponding path program 1 times [2022-10-15 18:15:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:57,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923887265] [2022-10-15 18:15:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:58,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923887265] [2022-10-15 18:15:58,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923887265] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:58,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:58,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 18:15:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153475557] [2022-10-15 18:15:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 18:15:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 18:15:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 18:15:58,007 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:58,273 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2022-10-15 18:15:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 18:15:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 18:15:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:58,275 INFO L225 Difference]: With dead ends: 153 [2022-10-15 18:15:58,275 INFO L226 Difference]: Without dead ends: 153 [2022-10-15 18:15:58,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-10-15 18:15:58,276 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:58,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 475 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:15:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-15 18:15:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-10-15 18:15:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 150 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2022-10-15 18:15:58,282 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 25 [2022-10-15 18:15:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:58,282 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2022-10-15 18:15:58,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2022-10-15 18:15:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 18:15:58,283 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:58,283 INFO L195 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] [2022-10-15 18:15:58,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 18:15:58,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1809938830, now seen corresponding path program 1 times [2022-10-15 18:15:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:58,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445124846] [2022-10-15 18:15:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445124846] [2022-10-15 18:15:58,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445124846] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:58,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:58,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 18:15:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949918603] [2022-10-15 18:15:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 18:15:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 18:15:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 18:15:58,705 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:58,967 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2022-10-15 18:15:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 18:15:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 18:15:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:58,969 INFO L225 Difference]: With dead ends: 152 [2022-10-15 18:15:58,969 INFO L226 Difference]: Without dead ends: 152 [2022-10-15 18:15:58,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-10-15 18:15:58,970 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 45 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:58,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 417 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:15:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-10-15 18:15:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-10-15 18:15:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 150 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2022-10-15 18:15:58,975 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 25 [2022-10-15 18:15:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:58,975 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2022-10-15 18:15:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2022-10-15 18:15:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 18:15:58,976 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:58,976 INFO L195 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] [2022-10-15 18:15:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 18:15:58,977 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -868219729, now seen corresponding path program 1 times [2022-10-15 18:15:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726098830] [2022-10-15 18:15:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:15:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:15:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:15:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726098830] [2022-10-15 18:15:59,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726098830] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:15:59,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:15:59,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 18:15:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972617544] [2022-10-15 18:15:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:15:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 18:15:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:15:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 18:15:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-15 18:15:59,322 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:15:59,618 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-10-15 18:15:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 18:15:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2022-10-15 18:15:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:15:59,620 INFO L225 Difference]: With dead ends: 153 [2022-10-15 18:15:59,620 INFO L226 Difference]: Without dead ends: 153 [2022-10-15 18:15:59,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-10-15 18:15:59,621 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:15:59,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 477 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:15:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-15 18:15:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-10-15 18:15:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.6237623762376239) internal successors, (164), 150 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-10-15 18:15:59,626 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 28 [2022-10-15 18:15:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:15:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-10-15 18:15:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:15:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-10-15 18:15:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 18:15:59,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:15:59,627 INFO L195 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] [2022-10-15 18:15:59,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 18:15:59,628 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:15:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:15:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -868219728, now seen corresponding path program 1 times [2022-10-15 18:15:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:15:59,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10228257] [2022-10-15 18:15:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:15:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:15:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:00,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10228257] [2022-10-15 18:16:00,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10228257] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:00,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:00,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 18:16:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96056088] [2022-10-15 18:16:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:00,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 18:16:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:00,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 18:16:00,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-15 18:16:00,128 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:00,498 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-10-15 18:16:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 18:16:00,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2022-10-15 18:16:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:00,500 INFO L225 Difference]: With dead ends: 152 [2022-10-15 18:16:00,500 INFO L226 Difference]: Without dead ends: 152 [2022-10-15 18:16:00,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-10-15 18:16:00,501 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 47 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:00,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 577 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 18:16:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-10-15 18:16:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-10-15 18:16:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.613861386138614) internal successors, (163), 150 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-10-15 18:16:00,506 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 28 [2022-10-15 18:16:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:00,507 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-10-15 18:16:00,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-10-15 18:16:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 18:16:00,508 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:00,508 INFO L195 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, 1] [2022-10-15 18:16:00,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 18:16:00,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:16:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash -840822568, now seen corresponding path program 1 times [2022-10-15 18:16:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835186210] [2022-10-15 18:16:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:00,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835186210] [2022-10-15 18:16:00,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835186210] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:00,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:00,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 18:16:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47012906] [2022-10-15 18:16:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 18:16:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 18:16:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-15 18:16:00,942 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:01,280 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-10-15 18:16:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 18:16:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-15 18:16:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:01,282 INFO L225 Difference]: With dead ends: 154 [2022-10-15 18:16:01,282 INFO L226 Difference]: Without dead ends: 154 [2022-10-15 18:16:01,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-10-15 18:16:01,284 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 62 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:01,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 483 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:16:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-15 18:16:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-10-15 18:16:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-10-15 18:16:01,289 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 31 [2022-10-15 18:16:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:01,290 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-10-15 18:16:01,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-10-15 18:16:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 18:16:01,291 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:01,291 INFO L195 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, 1] [2022-10-15 18:16:01,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 18:16:01,291 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:16:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash -840822567, now seen corresponding path program 1 times [2022-10-15 18:16:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382458174] [2022-10-15 18:16:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:01,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382458174] [2022-10-15 18:16:01,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382458174] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:01,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:01,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 18:16:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193035359] [2022-10-15 18:16:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:01,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 18:16:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 18:16:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-15 18:16:01,914 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:02,227 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-10-15 18:16:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 18:16:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-15 18:16:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:02,229 INFO L225 Difference]: With dead ends: 152 [2022-10-15 18:16:02,229 INFO L226 Difference]: Without dead ends: 152 [2022-10-15 18:16:02,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-10-15 18:16:02,230 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 55 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:02,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 425 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 18:16:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-10-15 18:16:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-10-15 18:16:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.5940594059405941) internal successors, (161), 150 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-10-15 18:16:02,236 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 31 [2022-10-15 18:16:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:02,236 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-10-15 18:16:02,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:16:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-10-15 18:16:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 18:16:02,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:02,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:02,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 18:16:02,237 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-10-15 18:16:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1371755095, now seen corresponding path program 1 times [2022-10-15 18:16:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:02,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432227693] [2022-10-15 18:16:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:03,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432227693] [2022-10-15 18:16:03,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432227693] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:03,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264277339] [2022-10-15 18:16:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:03,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:03,302 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) [2022-10-15 18:16:03,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 18:16:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:03,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 60 conjunts are in the unsatisfiable core [2022-10-15 18:16:03,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:03,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 18:16:03,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 18:16:03,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 18:16:03,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-10-15 18:16:03,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-10-15 18:16:03,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-10-15 18:16:03,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-10-15 18:16:03,649 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 18:16:03,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-10-15 18:16:03,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 18:16:03,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-10-15 18:16:03,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-15 18:16:03,823 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 18:16:03,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-10-15 18:16:03,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-15 18:16:03,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 18:16:03,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-10-15 18:16:03,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-15 18:16:04,060 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 18:16:04,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-10-15 18:16:04,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-15 18:16:04,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 18:16:04,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-10-15 18:16:04,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-10-15 18:16:04,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 10 [2022-10-15 18:16:04,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 18:16:04,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 14 [2022-10-15 18:16:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:04,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:04,265 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_666 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2022-10-15 18:16:04,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_666 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1))))) is different from false [2022-10-15 18:16:04,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_664))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2022-10-15 18:16:04,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_664))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2022-10-15 18:16:04,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_662) .cse0 v_ArrVal_665) (select (select (store .cse1 .cse0 v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_664)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)))) is different from false [2022-10-15 18:16:04,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_663))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_664)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_663))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_662) .cse4 v_ArrVal_665) (select (select (store .cse5 .cse4 v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)))) is different from false [2022-10-15 18:16:04,398 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_660))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_664)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_660))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_663))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_661) .cse4 v_ArrVal_662) .cse5 v_ArrVal_665) (select (select (store .cse6 .cse5 v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)))) is different from false [2022-10-15 18:16:04,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_660))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_664)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_660))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_663))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_661) .cse5 v_ArrVal_662) .cse6 v_ArrVal_665) (select (select (store .cse7 .cse6 v_ArrVal_664) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)))) is different from false [2022-10-15 18:16:10,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 18:16:10,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 237 [2022-10-15 18:16:10,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 18:16:10,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 111 [2022-10-15 18:16:10,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 3844 treesize of output 2820 [2022-10-15 18:16:10,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 18:16:10,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54792 treesize of output 53160 [2022-10-15 18:16:12,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53152 treesize of output 51712 [2022-10-15 18:16:13,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51712 treesize of output 46148 [2022-10-15 18:16:13,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46148 treesize of output 43172 [2022-10-15 18:16:13,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43172 treesize of output 42616 [2022-10-15 18:16:14,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42616 treesize of output 39960 [2022-10-15 18:16:14,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39960 treesize of output 38688 [2022-10-15 18:16:15,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38688 treesize of output 36676