/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/list-ext2-properties/simple_and_skiplist_2lvl-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:59:05,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:59:05,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:59:05,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:59:05,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:59:05,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:59:05,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:59:05,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:59:05,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:59:05,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:59:05,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:59:05,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:59:05,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:59:05,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:59:05,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:59:05,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:59:05,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:59:05,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:59:05,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:59:05,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:59:05,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:59:05,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:59:05,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:59:05,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:59:05,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:59:05,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:59:05,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:59:05,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:59:05,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:59:05,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:59:05,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:59:05,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:59:05,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:59:05,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:59:05,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:59:05,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:59:05,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:59:05,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:59:05,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:59:05,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:59:05,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:59:05,906 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 16:59:05,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:59:05,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:59:05,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:59:05,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:59:05,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:59:05,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:59:05,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:59:05,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:59:05,973 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:59:05,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:59:05,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:59:05,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:59:05,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:59:05,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:59:05,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:59:05,977 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:59:05,977 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:59:05,977 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:59:05,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:59:05,978 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:59:05,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:59:05,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:59:05,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:59:05,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:59:05,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:59:05,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:59:05,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:59:05,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:59:05,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:59:05,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:59:05,981 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 16:59:06,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:59:06,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:59:06,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:59:06,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:59:06,491 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:59:06,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2022-10-15 16:59:06,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0058d40f8/3b841e0774bc4e52b149cb6e087b067d/FLAGba2621714 [2022-10-15 16:59:07,448 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:59:07,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2022-10-15 16:59:07,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0058d40f8/3b841e0774bc4e52b149cb6e087b067d/FLAGba2621714 [2022-10-15 16:59:07,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0058d40f8/3b841e0774bc4e52b149cb6e087b067d [2022-10-15 16:59:07,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:59:07,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:59:07,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:59:07,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:59:07,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:59:07,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:59:07" (1/1) ... [2022-10-15 16:59:07,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243b8fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:07, skipping insertion in model container [2022-10-15 16:59:07,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:59:07" (1/1) ... [2022-10-15 16:59:07,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:59:07,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:59:08,264 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/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2022-10-15 16:59:08,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:59:08,282 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:59:08,346 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/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2022-10-15 16:59:08,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:59:08,398 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:59:08,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08 WrapperNode [2022-10-15 16:59:08,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:59:08,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:59:08,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:59:08,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:59:08,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,501 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-10-15 16:59:08,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:59:08,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:59:08,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:59:08,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:59:08,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,550 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:59:08,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:59:08,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:59:08,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:59:08,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:59:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:08,619 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 16:59:08,627 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 16:59:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-15 16:59:08,703 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-15 16:59:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:59:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:59:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:59:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:59:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:59:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:59:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:59:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:59:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:59:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:59:08,882 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:59:08,886 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:59:08,993 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-15 16:59:09,908 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:59:09,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:59:09,940 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 16:59:09,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:59:09 BoogieIcfgContainer [2022-10-15 16:59:09,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:59:09,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:59:09,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:59:09,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:59:09,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:59:07" (1/3) ... [2022-10-15 16:59:09,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baf048f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:59:09, skipping insertion in model container [2022-10-15 16:59:09,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08" (2/3) ... [2022-10-15 16:59:09,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baf048f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:59:09, skipping insertion in model container [2022-10-15 16:59:09,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:59:09" (3/3) ... [2022-10-15 16:59:09,965 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2022-10-15 16:59:10,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:59:10,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-10-15 16:59:10,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:59:10,095 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;@540b3238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:59:10,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-10-15 16:59:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 89 states have (on average 2.101123595505618) internal successors, (187), 170 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:59:10,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:10,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:59:10,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517224, now seen corresponding path program 1 times [2022-10-15 16:59:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869471592] [2022-10-15 16:59:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:10,403 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 16:59:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869471592] [2022-10-15 16:59:10,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869471592] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:10,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:10,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:59:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021601500] [2022-10-15 16:59:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:10,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 16:59:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:10,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 16:59:10,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:59:10,461 INFO L87 Difference]: Start difference. First operand has 172 states, 89 states have (on average 2.101123595505618) internal successors, (187), 170 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:59:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:10,500 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-10-15 16:59:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 16:59:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:59:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:10,515 INFO L225 Difference]: With dead ends: 172 [2022-10-15 16:59:10,515 INFO L226 Difference]: Without dead ends: 166 [2022-10-15 16:59:10,518 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 16:59:10,524 INFO L413 NwaCegarLoop]: 182 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, 182 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 16:59:10,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:59:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-10-15 16:59:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-10-15 16:59:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 86 states have (on average 2.0232558139534884) internal successors, (174), 165 states have internal predecessors, (174), 0 states have call successors, (0), 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 16:59:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions. [2022-10-15 16:59:10,591 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 6 [2022-10-15 16:59:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:10,592 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions. [2022-10-15 16:59:10,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:59:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions. [2022-10-15 16:59:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:59:10,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:10,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:59:10,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238120, now seen corresponding path program 1 times [2022-10-15 16:59:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575189879] [2022-10-15 16:59:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:10,798 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 16:59:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575189879] [2022-10-15 16:59:10,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575189879] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:10,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:10,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:59:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916018119] [2022-10-15 16:59:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:10,809 INFO L87 Difference]: Start difference. First operand 166 states and 174 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:11,546 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2022-10-15 16:59:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:11,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:59:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:11,558 INFO L225 Difference]: With dead ends: 328 [2022-10-15 16:59:11,559 INFO L226 Difference]: Without dead ends: 328 [2022-10-15 16:59:11,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:11,567 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 448 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:11,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 173 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:59:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-10-15 16:59:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 168. [2022-10-15 16:59:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 92 states have (on average 1.9673913043478262) internal successors, (181), 167 states have internal predecessors, (181), 0 states have call successors, (0), 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 16:59:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2022-10-15 16:59:11,618 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 7 [2022-10-15 16:59:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:11,623 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2022-10-15 16:59:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-10-15 16:59:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:59:11,625 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:11,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:11,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:59:11,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238121, now seen corresponding path program 1 times [2022-10-15 16:59:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:11,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144522637] [2022-10-15 16:59:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:11,901 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 16:59:11,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:11,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144522637] [2022-10-15 16:59:11,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144522637] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:11,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:11,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:59:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294441647] [2022-10-15 16:59:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:11,908 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:12,407 INFO L93 Difference]: Finished difference Result 310 states and 326 transitions. [2022-10-15 16:59:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:59:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:12,414 INFO L225 Difference]: With dead ends: 310 [2022-10-15 16:59:12,414 INFO L226 Difference]: Without dead ends: 310 [2022-10-15 16:59:12,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:12,422 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 461 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:12,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 171 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:59:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-10-15 16:59:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 175. [2022-10-15 16:59:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 99 states have (on average 1.878787878787879) internal successors, (186), 174 states have internal predecessors, (186), 0 states have call successors, (0), 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 16:59:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2022-10-15 16:59:12,444 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 7 [2022-10-15 16:59:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:12,445 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2022-10-15 16:59:12,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2022-10-15 16:59:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:59:12,447 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:12,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:12,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:59:12,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1884133396, now seen corresponding path program 1 times [2022-10-15 16:59:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:12,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204748027] [2022-10-15 16:59:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:12,583 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 16:59:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:12,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204748027] [2022-10-15 16:59:12,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204748027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:12,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:12,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:59:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870939613] [2022-10-15 16:59:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:12,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:12,593 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:12,675 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2022-10-15 16:59:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:12,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:59:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:12,678 INFO L225 Difference]: With dead ends: 180 [2022-10-15 16:59:12,678 INFO L226 Difference]: Without dead ends: 180 [2022-10-15 16:59:12,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:12,693 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 192 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:12,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 305 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-10-15 16:59:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2022-10-15 16:59:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 99 states have (on average 1.8686868686868687) internal successors, (185), 174 states have internal predecessors, (185), 0 states have call successors, (0), 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 16:59:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2022-10-15 16:59:12,723 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 12 [2022-10-15 16:59:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:12,724 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2022-10-15 16:59:12,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2022-10-15 16:59:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:59:12,725 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:12,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:12,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:59:12,730 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1721365971, now seen corresponding path program 1 times [2022-10-15 16:59:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245323741] [2022-10-15 16:59:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:13,042 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 16:59:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245323741] [2022-10-15 16:59:13,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245323741] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:13,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:59:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132460647] [2022-10-15 16:59:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:59:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:59:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:59:13,047 INFO L87 Difference]: Start difference. First operand 175 states and 185 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:13,279 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-10-15 16:59:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:59:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:59:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:13,282 INFO L225 Difference]: With dead ends: 213 [2022-10-15 16:59:13,282 INFO L226 Difference]: Without dead ends: 213 [2022-10-15 16:59:13,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:59:13,284 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:13,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 883 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:59:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-15 16:59:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2022-10-15 16:59:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 103 states have (on average 1.8349514563106797) internal successors, (189), 178 states have internal predecessors, (189), 0 states have call successors, (0), 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 16:59:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2022-10-15 16:59:13,293 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 13 [2022-10-15 16:59:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:13,294 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2022-10-15 16:59:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2022-10-15 16:59:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:59:13,295 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:13,296 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:13,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:59:13,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 761251611, now seen corresponding path program 1 times [2022-10-15 16:59:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:13,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083397007] [2022-10-15 16:59:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:13,546 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 16:59:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:13,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083397007] [2022-10-15 16:59:13,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083397007] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:13,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:13,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404513440] [2022-10-15 16:59:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:59:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:59:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:13,551 INFO L87 Difference]: Start difference. First operand 179 states and 189 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:14,133 INFO L93 Difference]: Finished difference Result 315 states and 333 transitions. [2022-10-15 16:59:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:59:14,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:59:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:14,136 INFO L225 Difference]: With dead ends: 315 [2022-10-15 16:59:14,137 INFO L226 Difference]: Without dead ends: 315 [2022-10-15 16:59:14,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:59:14,141 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 171 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:14,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 775 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:59:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-10-15 16:59:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 177. [2022-10-15 16:59:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.8155339805825244) internal successors, (187), 176 states have internal predecessors, (187), 0 states have call successors, (0), 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 16:59:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2022-10-15 16:59:14,150 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 15 [2022-10-15 16:59:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:14,152 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2022-10-15 16:59:14,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2022-10-15 16:59:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:59:14,154 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:14,154 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:14,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:59:14,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash 761251612, now seen corresponding path program 1 times [2022-10-15 16:59:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:14,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283919587] [2022-10-15 16:59:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:14,401 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 16:59:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283919587] [2022-10-15 16:59:14,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283919587] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:14,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:14,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549955620] [2022-10-15 16:59:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:14,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:59:14,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:59:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:14,405 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:15,081 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2022-10-15 16:59:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:59:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:59:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:15,084 INFO L225 Difference]: With dead ends: 314 [2022-10-15 16:59:15,084 INFO L226 Difference]: Without dead ends: 314 [2022-10-15 16:59:15,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:59:15,085 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 161 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:15,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 829 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:59:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-10-15 16:59:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 167. [2022-10-15 16:59:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 98 states have (on average 1.8061224489795917) internal successors, (177), 166 states have internal predecessors, (177), 0 states have call successors, (0), 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 16:59:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 177 transitions. [2022-10-15 16:59:15,093 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 177 transitions. Word has length 15 [2022-10-15 16:59:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:15,093 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 177 transitions. [2022-10-15 16:59:15,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2022-10-15 16:59:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:59:15,095 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:15,095 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:59:15,095 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 700715683, now seen corresponding path program 1 times [2022-10-15 16:59:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:15,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654349178] [2022-10-15 16:59:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:15,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654349178] [2022-10-15 16:59:15,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654349178] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:15,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808924766] [2022-10-15 16:59:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:15,555 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 16:59:15,576 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 16:59:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 16:59:15,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:15,902 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 11 treesize of output 7 [2022-10-15 16:59:15,915 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 11 treesize of output 7 [2022-10-15 16:59:16,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 16:59:16,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 16:59:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:16,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:16,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-10-15 16:59:16,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:16,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:16,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808924766] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:16,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:16,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2022-10-15 16:59:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848292273] [2022-10-15 16:59:16,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:16,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-15 16:59:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-15 16:59:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:59:16,794 INFO L87 Difference]: Start difference. First operand 167 states and 177 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:17,274 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2022-10-15 16:59:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:59:17,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:59:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:17,278 INFO L225 Difference]: With dead ends: 183 [2022-10-15 16:59:17,278 INFO L226 Difference]: Without dead ends: 183 [2022-10-15 16:59:17,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:59:17,280 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 385 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:17,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 925 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2022-10-15 16:59:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-10-15 16:59:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2022-10-15 16:59:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 101 states have (on average 1.7821782178217822) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 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 16:59:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2022-10-15 16:59:17,290 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 16 [2022-10-15 16:59:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:17,291 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2022-10-15 16:59:17,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2022-10-15 16:59:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:59:17,292 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:17,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:17,343 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 16:59:17,507 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 16:59:17,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 247348413, now seen corresponding path program 1 times [2022-10-15 16:59:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859494069] [2022-10-15 16:59:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:17,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859494069] [2022-10-15 16:59:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859494069] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:17,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:59:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575099022] [2022-10-15 16:59:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:17,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:59:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:59:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:59:17,690 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:17,838 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2022-10-15 16:59:17,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:59:17,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:59:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:17,842 INFO L225 Difference]: With dead ends: 193 [2022-10-15 16:59:17,842 INFO L226 Difference]: Without dead ends: 193 [2022-10-15 16:59:17,842 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 16:59:17,846 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:17,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 125 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-10-15 16:59:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2022-10-15 16:59:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 162 states have internal predecessors, (173), 0 states have call successors, (0), 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 16:59:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2022-10-15 16:59:17,854 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 17 [2022-10-15 16:59:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:17,854 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2022-10-15 16:59:17,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2022-10-15 16:59:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:59:17,859 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:17,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:17,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:59:17,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 247348414, now seen corresponding path program 1 times [2022-10-15 16:59:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:17,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059857171] [2022-10-15 16:59:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059857171] [2022-10-15 16:59:17,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059857171] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:17,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:17,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:59:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690260315] [2022-10-15 16:59:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:18,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:59:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:59:18,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:59:18,001 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:18,119 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-10-15 16:59:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:59:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:59:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:18,122 INFO L225 Difference]: With dead ends: 156 [2022-10-15 16:59:18,122 INFO L226 Difference]: Without dead ends: 156 [2022-10-15 16:59:18,123 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 16:59:18,124 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 119 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:18,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-10-15 16:59:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-10-15 16:59:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 155 states have internal predecessors, (166), 0 states have call successors, (0), 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 16:59:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-10-15 16:59:18,132 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 17 [2022-10-15 16:59:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:18,132 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-10-15 16:59:18,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-10-15 16:59:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:59:18,134 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:18,134 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] [2022-10-15 16:59:18,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:59:18,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash 434822240, now seen corresponding path program 1 times [2022-10-15 16:59:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:18,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911022399] [2022-10-15 16:59:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:18,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911022399] [2022-10-15 16:59:18,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911022399] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:18,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001012688] [2022-10-15 16:59:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:18,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:18,670 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 16:59:18,699 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 16:59:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:18,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-15 16:59:18,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:18,885 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 11 treesize of output 7 [2022-10-15 16:59:18,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:59:18,936 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 16:59:19,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:19,041 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 21 treesize of output 20 [2022-10-15 16:59:19,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-10-15 16:59:19,206 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 14 treesize of output 16 [2022-10-15 16:59:19,227 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 14 treesize of output 16 [2022-10-15 16:59:19,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:19,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:19,318 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 15 treesize of output 10 [2022-10-15 16:59:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:19,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:19,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-15 16:59:19,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-15 16:59:19,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-15 16:59:19,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_201)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-15 16:59:19,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:19,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-10-15 16:59:19,803 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-15 16:59:19,804 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 30 treesize of output 29 [2022-10-15 16:59:19,817 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 9 treesize of output 7 [2022-10-15 16:59:19,854 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 16:59:19,855 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 13 treesize of output 12 [2022-10-15 16:59:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-15 16:59:20,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001012688] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:20,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:20,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-10-15 16:59:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137376222] [2022-10-15 16:59:20,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:20,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:59:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:59:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-10-15 16:59:20,023 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:20,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_201)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2022-10-15 16:59:21,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_26|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_201)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_26|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_26| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2022-10-15 16:59:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:22,294 INFO L93 Difference]: Finished difference Result 364 states and 385 transitions. [2022-10-15 16:59:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-15 16:59:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 16:59:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:22,298 INFO L225 Difference]: With dead ends: 364 [2022-10-15 16:59:22,299 INFO L226 Difference]: Without dead ends: 364 [2022-10-15 16:59:22,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=275, Invalid=1003, Unknown=6, NotChecked=438, Total=1722 [2022-10-15 16:59:22,302 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 598 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1115 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:22,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1556 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 853 Invalid, 0 Unknown, 1115 Unchecked, 0.8s Time] [2022-10-15 16:59:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-10-15 16:59:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 170. [2022-10-15 16:59:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.5739130434782609) internal successors, (181), 169 states have internal predecessors, (181), 0 states have call successors, (0), 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 16:59:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2022-10-15 16:59:22,311 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 21 [2022-10-15 16:59:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:22,311 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2022-10-15 16:59:22,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2022-10-15 16:59:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:59:22,313 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:22,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:22,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 16:59:22,528 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,SelfDestructingSolverStorable10 [2022-10-15 16:59:22,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -296760380, now seen corresponding path program 1 times [2022-10-15 16:59:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540955588] [2022-10-15 16:59:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:22,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540955588] [2022-10-15 16:59:22,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540955588] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:22,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:22,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:59:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941776749] [2022-10-15 16:59:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:22,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:59:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:59:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:22,899 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:23,118 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-10-15 16:59:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:59:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:59:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:23,121 INFO L225 Difference]: With dead ends: 169 [2022-10-15 16:59:23,121 INFO L226 Difference]: Without dead ends: 169 [2022-10-15 16:59:23,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 16:59:23,124 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 8 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:23,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 368 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:59:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-15 16:59:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-15 16:59:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 115 states have (on average 1.565217391304348) internal successors, (180), 168 states have internal predecessors, (180), 0 states have call successors, (0), 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 16:59:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2022-10-15 16:59:23,133 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 24 [2022-10-15 16:59:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:23,134 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2022-10-15 16:59:23,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2022-10-15 16:59:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:59:23,135 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:23,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:23,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:59:23,136 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -296760379, now seen corresponding path program 1 times [2022-10-15 16:59:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:23,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441949376] [2022-10-15 16:59:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:23,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441949376] [2022-10-15 16:59:23,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441949376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:23,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:23,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988952165] [2022-10-15 16:59:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:23,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:59:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:59:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:23,701 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:24,034 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2022-10-15 16:59:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:59:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:59:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:24,036 INFO L225 Difference]: With dead ends: 168 [2022-10-15 16:59:24,036 INFO L226 Difference]: Without dead ends: 168 [2022-10-15 16:59:24,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:59:24,038 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 8 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:24,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 406 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:59:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-10-15 16:59:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-10-15 16:59:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 115 states have (on average 1.5565217391304347) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 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 16:59:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-10-15 16:59:24,045 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 24 [2022-10-15 16:59:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:24,045 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-10-15 16:59:24,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-10-15 16:59:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:59:24,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:24,047 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] [2022-10-15 16:59:24,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:59:24,048 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash 172830608, now seen corresponding path program 1 times [2022-10-15 16:59:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:24,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439550330] [2022-10-15 16:59:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:24,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439550330] [2022-10-15 16:59:24,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439550330] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:24,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82312536] [2022-10-15 16:59:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:24,692 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 16:59:24,703 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 16:59:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:24,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 16:59:24,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:24,873 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:59:24,874 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 16:59:24,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:25,067 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:59:25,068 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-10-15 16:59:25,096 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:59:25,097 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 28 treesize of output 29 [2022-10-15 16:59:25,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:25,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-10-15 16:59:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:25,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:26,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:26,490 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-10-15 16:59:26,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:26,503 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 40 treesize of output 39 [2022-10-15 16:59:26,511 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 13 treesize of output 9 [2022-10-15 16:59:29,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:29,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 381 [2022-10-15 16:59:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:42,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82312536] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:42,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:42,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 31 [2022-10-15 16:59:42,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312595786] [2022-10-15 16:59:42,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:42,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-15 16:59:42,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-15 16:59:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=831, Unknown=6, NotChecked=0, Total=992 [2022-10-15 16:59:42,649 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:44,173 INFO L93 Difference]: Finished difference Result 339 states and 360 transitions. [2022-10-15 16:59:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:59:44,174 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:59:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:44,176 INFO L225 Difference]: With dead ends: 339 [2022-10-15 16:59:44,176 INFO L226 Difference]: Without dead ends: 339 [2022-10-15 16:59:44,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=257, Invalid=1069, Unknown=6, NotChecked=0, Total=1332 [2022-10-15 16:59:44,178 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 420 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 896 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:44,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 2597 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1804 Invalid, 0 Unknown, 896 Unchecked, 1.3s Time] [2022-10-15 16:59:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-10-15 16:59:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 172. [2022-10-15 16:59:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 119 states have (on average 1.5546218487394958) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 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 16:59:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2022-10-15 16:59:44,185 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 24 [2022-10-15 16:59:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:44,185 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2022-10-15 16:59:44,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2022-10-15 16:59:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:59:44,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:44,187 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] [2022-10-15 16:59:44,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:59:44,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:44,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 172830609, now seen corresponding path program 1 times [2022-10-15 16:59:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:44,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505513944] [2022-10-15 16:59:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:45,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505513944] [2022-10-15 16:59:45,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505513944] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:45,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893157095] [2022-10-15 16:59:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:45,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:45,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:45,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:59:45,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 16:59:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:45,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-15 16:59:45,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:45,274 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 16:59:45,289 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:59:45,290 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 16:59:45,324 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 16:59:45,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:45,460 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:59:45,461 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-10-15 16:59:45,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:45,472 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 14 treesize of output 16 [2022-10-15 16:59:45,492 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:59:45,492 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 38 treesize of output 37 [2022-10-15 16:59:45,499 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 18 treesize of output 20 [2022-10-15 16:59:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:45,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-10-15 16:59:45,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:45,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:45,635 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 27 treesize of output 16 [2022-10-15 16:59:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:45,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:45,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int))) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-15 16:59:46,024 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4)))))) is different from false [2022-10-15 16:59:46,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_36| Int) (v_ArrVal_397 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (or (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_36| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_36|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-15 16:59:46,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,074 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 1 case distinctions, treesize of input 45 treesize of output 46 [2022-10-15 16:59:46,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,082 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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-10-15 16:59:46,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,096 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 62 treesize of output 61 [2022-10-15 16:59:46,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,115 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 96 treesize of output 89 [2022-10-15 16:59:46,125 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 40 treesize of output 32 [2022-10-15 16:59:46,132 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 66 treesize of output 58 [2022-10-15 16:59:46,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,228 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-10-15 16:59:46,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:46,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:46,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:46,238 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-10-15 16:59:46,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:46,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-10-15 16:59:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-15 16:59:47,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893157095] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:47,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:47,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-10-15 16:59:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530243667] [2022-10-15 16:59:47,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:47,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:59:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:59:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=598, Unknown=3, NotChecked=156, Total=870 [2022-10-15 16:59:47,495 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:49,797 INFO L93 Difference]: Finished difference Result 510 states and 539 transitions. [2022-10-15 16:59:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-15 16:59:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:59:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:49,800 INFO L225 Difference]: With dead ends: 510 [2022-10-15 16:59:49,800 INFO L226 Difference]: Without dead ends: 510 [2022-10-15 16:59:49,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=1487, Unknown=3, NotChecked=252, Total=2070 [2022-10-15 16:59:49,804 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 754 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:49,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1507 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1949 Invalid, 0 Unknown, 1312 Unchecked, 1.5s Time] [2022-10-15 16:59:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-10-15 16:59:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 171. [2022-10-15 16:59:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 170 states have internal predecessors, (183), 0 states have call successors, (0), 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 16:59:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2022-10-15 16:59:49,813 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 24 [2022-10-15 16:59:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:49,813 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2022-10-15 16:59:49,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2022-10-15 16:59:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:59:49,815 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:49,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:49,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 16:59:50,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 16:59:50,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -609637115, now seen corresponding path program 1 times [2022-10-15 16:59:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:50,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980156629] [2022-10-15 16:59:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980156629] [2022-10-15 16:59:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980156629] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:50,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:50,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:59:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386483137] [2022-10-15 16:59:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:50,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:59:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:59:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:50,142 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 16:59:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:50,258 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-10-15 16:59:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:59:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 16:59:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:50,260 INFO L225 Difference]: With dead ends: 170 [2022-10-15 16:59:50,260 INFO L226 Difference]: Without dead ends: 170 [2022-10-15 16:59:50,261 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 16:59:50,261 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 6 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:50,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 462 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-15 16:59:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-10-15 16:59:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.5423728813559323) internal successors, (182), 169 states have internal predecessors, (182), 0 states have call successors, (0), 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 16:59:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2022-10-15 16:59:50,266 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 25 [2022-10-15 16:59:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:50,267 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2022-10-15 16:59:50,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 16:59:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-10-15 16:59:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:59:50,268 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:50,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:50,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:59:50,268 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash -609637114, now seen corresponding path program 1 times [2022-10-15 16:59:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:50,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351908354] [2022-10-15 16:59:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:50,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:59:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:50,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351908354] [2022-10-15 16:59:50,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351908354] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:50,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:50,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:59:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391598151] [2022-10-15 16:59:50,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:50,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:59:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:59:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:59:50,690 INFO L87 Difference]: Start difference. First operand 170 states and 182 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 16:59:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:51,033 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-10-15 16:59:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:59:51,033 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 16:59:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:51,035 INFO L225 Difference]: With dead ends: 169 [2022-10-15 16:59:51,035 INFO L226 Difference]: Without dead ends: 169 [2022-10-15 16:59:51,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:59:51,036 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:51,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:59:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-15 16:59:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-15 16:59:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 168 states have internal predecessors, (181), 0 states have call successors, (0), 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 16:59:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-10-15 16:59:51,041 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 25 [2022-10-15 16:59:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:51,042 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-10-15 16:59:51,042 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 16:59:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-10-15 16:59:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:59:51,043 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:51,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:51,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:59:51,043 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:59:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1413509039, now seen corresponding path program 1 times [2022-10-15 16:59:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:51,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5114955] [2022-10-15 16:59:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:51,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5114955] [2022-10-15 16:59:51,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5114955] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:51,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375028771] [2022-10-15 16:59:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:51,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:51,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:51,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:59:51,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:59:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:51,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-15 16:59:51,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:51,936 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:59:51,937 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 16:59:51,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:51,977 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 16:59:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:59:52,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:59:52,077 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 14 treesize of output 16 [2022-10-15 16:59:52,105 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:59:52,106 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 59 treesize of output 54 [2022-10-15 16:59:52,110 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 18 treesize of output 20 [2022-10-15 16:59:52,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-10-15 16:59:52,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:52,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-10-15 16:59:52,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:52,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:52,269 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 29 treesize of output 18 [2022-10-15 16:59:52,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 16:59:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:52,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:52,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_41| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_542)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1))) is different from false [2022-10-15 16:59:52,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 177 [2022-10-15 16:59:52,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:52,882 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-10-15 16:59:52,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:52,896 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 36 treesize of output 35 [2022-10-15 16:59:52,903 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 11 treesize of output 7 [2022-10-15 16:59:52,939 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-15 16:59:52,940 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 1 case distinctions, treesize of input 22 treesize of output 1 [2022-10-15 16:59:53,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:59:53,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-10-15 16:59:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:54,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375028771] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:54,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:54,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 31 [2022-10-15 16:59:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484742410] [2022-10-15 16:59:54,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:54,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 16:59:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 16:59:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=771, Unknown=1, NotChecked=56, Total=930 [2022-10-15 16:59:54,331 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)