/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-16 01:35:08,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:35:08,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:35:08,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:35:08,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:35:08,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:35:08,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:35:08,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:35:08,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:35:08,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:35:08,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:35:08,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:35:08,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:35:08,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:35:08,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:35:08,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:35:08,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:35:08,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:35:08,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:35:08,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:35:08,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:35:08,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:35:08,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:35:08,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:35:08,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:35:08,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:35:08,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:35:08,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:35:08,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:35:08,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:35:08,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:35:08,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:35:08,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:35:08,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:35:08,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:35:08,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:35:08,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:35:08,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:35:08,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:35:08,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:35:08,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:35:08,644 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-16 01:35:08,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:35:08,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:35:08,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:35:08,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:35:08,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:35:08,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:35:08,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:35:08,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:35:08,679 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:35:08,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:35:08,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:35:08,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:35:08,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:35:08,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:35:08,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:35:08,680 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:35:08,681 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:35:08,681 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:35:08,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:35:08,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:35:08,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:35:08,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:35:08,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:35:08,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:35:08,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:35:08,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:35:08,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:35:08,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:35:08,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:35:08,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:35:08,684 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-16 01:35:09,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:35:09,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:35:09,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:35:09,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:35:09,097 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:35:09,098 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-16 01:35:09,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbc98bea/72f349bd862a4a9387f662835da18fa8/FLAG2121a3a12 [2022-10-16 01:35:10,014 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:35:10,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2022-10-16 01:35:10,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbc98bea/72f349bd862a4a9387f662835da18fa8/FLAG2121a3a12 [2022-10-16 01:35:10,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbc98bea/72f349bd862a4a9387f662835da18fa8 [2022-10-16 01:35:10,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:35:10,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:35:10,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:35:10,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:35:10,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:35:10,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120c7aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10, skipping insertion in model container [2022-10-16 01:35:10,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:35:10,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:35:10,721 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-16 01:35:10,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:35:10,748 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:35:10,851 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-16 01:35:10,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:35:10,894 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:35:10,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10 WrapperNode [2022-10-16 01:35:10,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:35:10,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:35:10,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:35:10,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:35:10,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,974 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-10-16 01:35:10,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:35:10,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:35:10,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:35:10,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:35:10,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:10,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,058 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:35:11,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:35:11,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:35:11,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:35:11,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (1/1) ... [2022-10-16 01:35:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:35:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:11,142 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-16 01:35:11,164 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-16 01:35:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-16 01:35:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-16 01:35:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 01:35:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:35:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:35:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:35:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:35:11,328 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:35:11,330 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:35:11,420 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-16 01:35:12,105 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:35:12,123 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:35:12,124 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-16 01:35:12,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:12 BoogieIcfgContainer [2022-10-16 01:35:12,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:35:12,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:35:12,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:35:12,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:35:12,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:35:10" (1/3) ... [2022-10-16 01:35:12,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54caec4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:12, skipping insertion in model container [2022-10-16 01:35:12,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:10" (2/3) ... [2022-10-16 01:35:12,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54caec4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:12, skipping insertion in model container [2022-10-16 01:35:12,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:12" (3/3) ... [2022-10-16 01:35:12,141 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2022-10-16 01:35:12,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:35:12,166 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-10-16 01:35:12,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:35:12,241 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;@36493f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:35:12,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-10-16 01:35:12,247 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-16 01:35:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:35:12,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:12,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:35:12,258 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-16 01:35:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517224, now seen corresponding path program 1 times [2022-10-16 01:35:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635864594] [2022-10-16 01:35:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:12,469 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-16 01:35:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635864594] [2022-10-16 01:35:12,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635864594] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:12,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:12,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610089284] [2022-10-16 01:35:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:12,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 01:35:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 01:35:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 01:35:12,520 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-16 01:35:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:12,553 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-10-16 01:35:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 01:35:12,556 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-16 01:35:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:12,567 INFO L225 Difference]: With dead ends: 172 [2022-10-16 01:35:12,567 INFO L226 Difference]: Without dead ends: 166 [2022-10-16 01:35:12,570 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-16 01:35:12,575 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-16 01:35:12,576 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-16 01:35:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-10-16 01:35:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-10-16 01:35:12,639 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-16 01:35:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 174 transitions. [2022-10-16 01:35:12,649 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 174 transitions. Word has length 6 [2022-10-16 01:35:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:12,649 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 174 transitions. [2022-10-16 01:35:12,650 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-16 01:35:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 174 transitions. [2022-10-16 01:35:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 01:35:12,652 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:12,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:12,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:35:12,654 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-16 01:35:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238120, now seen corresponding path program 1 times [2022-10-16 01:35:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:12,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214789151] [2022-10-16 01:35:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:12,898 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-16 01:35:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214789151] [2022-10-16 01:35:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214789151] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:12,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:12,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:35:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925863991] [2022-10-16 01:35:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:12,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:12,903 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-16 01:35:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:13,267 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2022-10-16 01:35:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:35:13,268 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-16 01:35:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:13,274 INFO L225 Difference]: With dead ends: 328 [2022-10-16 01:35:13,275 INFO L226 Difference]: Without dead ends: 328 [2022-10-16 01:35:13,280 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-16 01:35:13,282 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 448 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:13,283 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.3s Time] [2022-10-16 01:35:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-10-16 01:35:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 168. [2022-10-16 01:35:13,316 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-16 01:35:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2022-10-16 01:35:13,319 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 7 [2022-10-16 01:35:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:13,321 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2022-10-16 01:35:13,321 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-16 01:35:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-10-16 01:35:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 01:35:13,323 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:13,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:13,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:35:13,324 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-16 01:35:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238121, now seen corresponding path program 1 times [2022-10-16 01:35:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:13,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671834190] [2022-10-16 01:35:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:13,534 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-16 01:35:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671834190] [2022-10-16 01:35:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671834190] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:35:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247302495] [2022-10-16 01:35:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:13,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:13,538 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-16 01:35:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:13,847 INFO L93 Difference]: Finished difference Result 310 states and 326 transitions. [2022-10-16 01:35:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:35:13,848 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-16 01:35:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:13,850 INFO L225 Difference]: With dead ends: 310 [2022-10-16 01:35:13,850 INFO L226 Difference]: Without dead ends: 310 [2022-10-16 01:35:13,850 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-16 01:35:13,852 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 461 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:13,852 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.3s Time] [2022-10-16 01:35:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-10-16 01:35:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 175. [2022-10-16 01:35:13,862 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-16 01:35:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2022-10-16 01:35:13,863 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 7 [2022-10-16 01:35:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:13,864 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2022-10-16 01:35:13,864 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-16 01:35:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2022-10-16 01:35:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 01:35:13,865 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:13,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:35:13,866 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-16 01:35:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1884133396, now seen corresponding path program 1 times [2022-10-16 01:35:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:13,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874334363] [2022-10-16 01:35:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:13,958 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-16 01:35:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874334363] [2022-10-16 01:35:13,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874334363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:13,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:13,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:35:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401024168] [2022-10-16 01:35:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:13,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:35:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:35:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:35:13,963 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-16 01:35:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:14,019 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2022-10-16 01:35:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:35:14,020 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-16 01:35:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:14,021 INFO L225 Difference]: With dead ends: 180 [2022-10-16 01:35:14,021 INFO L226 Difference]: Without dead ends: 180 [2022-10-16 01:35:14,022 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-16 01:35:14,032 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 192 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:14,034 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.0s Time] [2022-10-16 01:35:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-10-16 01:35:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2022-10-16 01:35:14,048 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-16 01:35:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 185 transitions. [2022-10-16 01:35:14,050 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 185 transitions. Word has length 12 [2022-10-16 01:35:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:14,050 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 185 transitions. [2022-10-16 01:35:14,051 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-16 01:35:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2022-10-16 01:35:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 01:35:14,052 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:14,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:35:14,052 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-16 01:35:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1721365971, now seen corresponding path program 1 times [2022-10-16 01:35:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:14,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823532892] [2022-10-16 01:35:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:14,308 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-16 01:35:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:14,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823532892] [2022-10-16 01:35:14,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823532892] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:14,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:14,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 01:35:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122538130] [2022-10-16 01:35:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:14,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 01:35:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:14,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 01:35:14,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:35:14,312 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-16 01:35:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:14,489 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-10-16 01:35:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:35:14,490 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-16 01:35:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:14,492 INFO L225 Difference]: With dead ends: 213 [2022-10-16 01:35:14,492 INFO L226 Difference]: Without dead ends: 213 [2022-10-16 01:35:14,493 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-16 01:35:14,494 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:14,494 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.1s Time] [2022-10-16 01:35:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-16 01:35:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2022-10-16 01:35:14,500 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-16 01:35:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2022-10-16 01:35:14,501 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 13 [2022-10-16 01:35:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:14,502 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2022-10-16 01:35:14,502 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-16 01:35:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2022-10-16 01:35:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:35:14,503 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:14,503 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:14,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:35:14,504 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-16 01:35:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 761251611, now seen corresponding path program 1 times [2022-10-16 01:35:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:14,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939685100] [2022-10-16 01:35:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:14,681 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-16 01:35:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:14,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939685100] [2022-10-16 01:35:14,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939685100] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:14,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:35:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594470211] [2022-10-16 01:35:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:14,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:14,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:14,685 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-16 01:35:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:15,181 INFO L93 Difference]: Finished difference Result 315 states and 333 transitions. [2022-10-16 01:35:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:35:15,181 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-16 01:35:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:15,183 INFO L225 Difference]: With dead ends: 315 [2022-10-16 01:35:15,183 INFO L226 Difference]: Without dead ends: 315 [2022-10-16 01:35:15,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 01:35:15,185 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.4s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:15,185 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.4s Time] [2022-10-16 01:35:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-10-16 01:35:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 177. [2022-10-16 01:35:15,190 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-16 01:35:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2022-10-16 01:35:15,191 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 15 [2022-10-16 01:35:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:15,192 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2022-10-16 01:35:15,192 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-16 01:35:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2022-10-16 01:35:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:35:15,193 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:15,193 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:15,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:35:15,194 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-16 01:35:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 761251612, now seen corresponding path program 1 times [2022-10-16 01:35:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:15,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502698255] [2022-10-16 01:35:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:15,400 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-16 01:35:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502698255] [2022-10-16 01:35:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502698255] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:15,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:15,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:35:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486829417] [2022-10-16 01:35:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:15,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:15,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:15,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:15,403 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-16 01:35:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:15,957 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2022-10-16 01:35:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:35:15,957 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-16 01:35:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:15,959 INFO L225 Difference]: With dead ends: 314 [2022-10-16 01:35:15,960 INFO L226 Difference]: Without dead ends: 314 [2022-10-16 01:35:15,960 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-16 01:35:15,961 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 161 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:15,962 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.4s Time] [2022-10-16 01:35:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-10-16 01:35:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 167. [2022-10-16 01:35:15,966 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-16 01:35:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 177 transitions. [2022-10-16 01:35:15,967 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 177 transitions. Word has length 15 [2022-10-16 01:35:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:15,968 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 177 transitions. [2022-10-16 01:35:15,968 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-16 01:35:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2022-10-16 01:35:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 01:35:15,969 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:15,970 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:35:15,970 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-16 01:35:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 700715683, now seen corresponding path program 1 times [2022-10-16 01:35:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213914714] [2022-10-16 01:35:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:16,339 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-16 01:35:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:16,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213914714] [2022-10-16 01:35:16,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213914714] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:16,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482721598] [2022-10-16 01:35:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:16,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:16,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:16,345 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-16 01:35:16,356 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-16 01:35:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:16,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 01:35:16,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:16,640 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-16 01:35:16,646 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-16 01:35:16,723 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-16 01:35:16,727 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-16 01:35:16,738 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-16 01:35:16,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:16,946 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-16 01:35:16,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:16,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:17,173 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-16 01:35:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482721598] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:17,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:17,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2022-10-16 01:35:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030454153] [2022-10-16 01:35:17,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:17,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 01:35:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 01:35:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 01:35:17,190 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-16 01:35:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:17,535 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2022-10-16 01:35:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 01:35:17,536 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-16 01:35:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:17,537 INFO L225 Difference]: With dead ends: 183 [2022-10-16 01:35:17,538 INFO L226 Difference]: Without dead ends: 183 [2022-10-16 01:35:17,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-10-16 01:35:17,539 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 385 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:17,539 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.2s Time] [2022-10-16 01:35:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-10-16 01:35:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2022-10-16 01:35:17,544 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-16 01:35:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2022-10-16 01:35:17,545 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 16 [2022-10-16 01:35:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:17,545 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2022-10-16 01:35:17,545 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-16 01:35:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2022-10-16 01:35:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 01:35:17,546 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:17,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:17,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:17,760 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-16 01:35:17,761 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-16 01:35:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash 247348413, now seen corresponding path program 1 times [2022-10-16 01:35:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:17,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166627449] [2022-10-16 01:35:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:17,834 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-16 01:35:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166627449] [2022-10-16 01:35:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166627449] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963216396] [2022-10-16 01:35:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:17,837 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-16 01:35:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:17,942 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2022-10-16 01:35:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:17,942 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-16 01:35:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:17,944 INFO L225 Difference]: With dead ends: 193 [2022-10-16 01:35:17,944 INFO L226 Difference]: Without dead ends: 193 [2022-10-16 01:35:17,945 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-16 01:35:17,947 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-16 01:35:17,948 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-16 01:35:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-10-16 01:35:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2022-10-16 01:35:17,954 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-16 01:35:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2022-10-16 01:35:17,955 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 17 [2022-10-16 01:35:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:17,955 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2022-10-16 01:35:17,955 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-16 01:35:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2022-10-16 01:35:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 01:35:17,959 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:17,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:17,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 01:35:17,960 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-16 01:35:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 247348414, now seen corresponding path program 1 times [2022-10-16 01:35:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:17,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177524146] [2022-10-16 01:35:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,068 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-16 01:35:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177524146] [2022-10-16 01:35:18,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177524146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:18,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:18,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:35:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509882531] [2022-10-16 01:35:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:35:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:35:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:35:18,071 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-16 01:35:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:18,173 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-10-16 01:35:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:35:18,176 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-16 01:35:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:18,177 INFO L225 Difference]: With dead ends: 156 [2022-10-16 01:35:18,177 INFO L226 Difference]: Without dead ends: 156 [2022-10-16 01:35:18,177 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-16 01:35:18,178 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-16 01:35:18,179 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-16 01:35:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-10-16 01:35:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-10-16 01:35:18,182 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-16 01:35:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-10-16 01:35:18,183 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 17 [2022-10-16 01:35:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:18,184 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-10-16 01:35:18,184 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-16 01:35:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-10-16 01:35:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 01:35:18,185 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:18,185 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-16 01:35:18,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:35:18,185 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-16 01:35:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 434822240, now seen corresponding path program 1 times [2022-10-16 01:35:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:18,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5086778] [2022-10-16 01:35:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,623 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-16 01:35:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5086778] [2022-10-16 01:35:18,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5086778] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058182386] [2022-10-16 01:35:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:18,626 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-16 01:35:18,647 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-16 01:35:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:18,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 01:35:18,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:18,804 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-16 01:35:18,856 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:35:18,857 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-16 01:35:18,918 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-16 01:35:18,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:18,933 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-16 01:35:18,971 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-16 01:35:19,048 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-16 01:35:19,066 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-16 01:35:19,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:19,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:19,128 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-16 01:35:19,135 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-16 01:35:19,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:19,231 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-16 01:35:19,298 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-16 01:35:19,315 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-16 01:35:19,337 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-16 01:35:19,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:19,505 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-16 01:35:19,522 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-16 01:35:19,522 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-16 01:35:19,531 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-16 01:35:19,556 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 01:35:19,557 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-16 01:35:19,666 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-16 01:35:19,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058182386] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:19,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:19,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-10-16 01:35:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714103799] [2022-10-16 01:35:19,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:19,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 01:35:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 01:35:19,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-10-16 01:35:19,669 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-16 01:35:20,396 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-16 01:35:20,890 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-16 01:35:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:21,831 INFO L93 Difference]: Finished difference Result 364 states and 385 transitions. [2022-10-16 01:35:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 01:35:21,832 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-16 01:35:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:21,834 INFO L225 Difference]: With dead ends: 364 [2022-10-16 01:35:21,834 INFO L226 Difference]: Without dead ends: 364 [2022-10-16 01:35:21,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=1003, Unknown=6, NotChecked=438, Total=1722 [2022-10-16 01:35:21,836 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.7s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:21,836 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.7s Time] [2022-10-16 01:35:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-10-16 01:35:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 170. [2022-10-16 01:35:21,842 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-16 01:35:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2022-10-16 01:35:21,843 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 21 [2022-10-16 01:35:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:21,844 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2022-10-16 01:35:21,844 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-16 01:35:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2022-10-16 01:35:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:35:21,845 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:21,845 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-16 01:35:21,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:22,060 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-16 01:35:22,060 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-16 01:35:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -296760380, now seen corresponding path program 1 times [2022-10-16 01:35:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:22,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160473639] [2022-10-16 01:35:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:22,291 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-16 01:35:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:22,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160473639] [2022-10-16 01:35:22,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160473639] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:22,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:22,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:35:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346570195] [2022-10-16 01:35:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:22,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:35:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:35:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:35:22,294 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-16 01:35:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:22,454 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-10-16 01:35:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:35:22,455 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-16 01:35:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:22,456 INFO L225 Difference]: With dead ends: 169 [2022-10-16 01:35:22,456 INFO L226 Difference]: Without dead ends: 169 [2022-10-16 01:35:22,457 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-16 01:35:22,457 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 8 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:22,458 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.1s Time] [2022-10-16 01:35:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-16 01:35:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-16 01:35:22,462 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-16 01:35:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2022-10-16 01:35:22,462 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 24 [2022-10-16 01:35:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:22,463 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2022-10-16 01:35:22,463 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-16 01:35:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2022-10-16 01:35:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:35:22,464 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:22,464 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-16 01:35:22,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 01:35:22,464 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-16 01:35:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -296760379, now seen corresponding path program 1 times [2022-10-16 01:35:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:22,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656645870] [2022-10-16 01:35:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:22,842 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-16 01:35:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:22,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656645870] [2022-10-16 01:35:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656645870] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:22,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:22,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:35:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678636761] [2022-10-16 01:35:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:35:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:35:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:35:22,845 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-16 01:35:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:23,092 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2022-10-16 01:35:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:35:23,093 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-16 01:35:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:23,094 INFO L225 Difference]: With dead ends: 168 [2022-10-16 01:35:23,094 INFO L226 Difference]: Without dead ends: 168 [2022-10-16 01:35:23,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-16 01:35:23,095 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:23,095 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.2s Time] [2022-10-16 01:35:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-10-16 01:35:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-10-16 01:35:23,099 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-16 01:35:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-10-16 01:35:23,100 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 24 [2022-10-16 01:35:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:23,100 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-10-16 01:35:23,100 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-16 01:35:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-10-16 01:35:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:35:23,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:23,101 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-16 01:35:23,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 01:35:23,102 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-16 01:35:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 172830608, now seen corresponding path program 1 times [2022-10-16 01:35:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:23,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422627288] [2022-10-16 01:35:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:23,556 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-16 01:35:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:23,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422627288] [2022-10-16 01:35:23,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422627288] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:23,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579118847] [2022-10-16 01:35:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:23,562 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-16 01:35:23,572 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-16 01:35:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:23,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-16 01:35:23,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:23,777 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 01:35:23,777 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-16 01:35:23,834 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-16 01:35:23,966 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:35:23,967 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-16 01:35:24,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:35:24,006 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-16 01:35:24,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:24,123 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-16 01:35:24,190 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-16 01:35:24,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:25,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:25,298 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-16 01:35:25,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:25,309 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-16 01:35:25,315 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-16 01:35:27,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:27,877 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-16 01:35:39,679 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-16 01:35:39,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579118847] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:39,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:39,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 31 [2022-10-16 01:35:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074733575] [2022-10-16 01:35:39,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:39,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 01:35:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:39,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 01:35:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=831, Unknown=6, NotChecked=0, Total=992 [2022-10-16 01:35:39,683 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-16 01:35:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:41,168 INFO L93 Difference]: Finished difference Result 339 states and 360 transitions. [2022-10-16 01:35:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 01:35:41,169 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-16 01:35:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:41,170 INFO L225 Difference]: With dead ends: 339 [2022-10-16 01:35:41,171 INFO L226 Difference]: Without dead ends: 339 [2022-10-16 01:35:41,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=257, Invalid=1069, Unknown=6, NotChecked=0, Total=1332 [2022-10-16 01:35:41,172 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 420 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:41,173 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.2s Time] [2022-10-16 01:35:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-10-16 01:35:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 172. [2022-10-16 01:35:41,178 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-16 01:35:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2022-10-16 01:35:41,179 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 24 [2022-10-16 01:35:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:41,180 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2022-10-16 01:35:41,180 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-16 01:35:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2022-10-16 01:35:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:35:41,181 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:41,181 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-16 01:35:41,216 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-16 01:35:41,395 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-16 01:35:41,396 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-16 01:35:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 172830609, now seen corresponding path program 1 times [2022-10-16 01:35:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:41,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269345250] [2022-10-16 01:35:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:42,069 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-16 01:35:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:42,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269345250] [2022-10-16 01:35:42,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269345250] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:42,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268464419] [2022-10-16 01:35:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:42,071 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-16 01:35:42,089 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-16 01:35:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:42,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 01:35:42,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:42,237 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-16 01:35:42,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:35:42,249 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-16 01:35:42,284 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-16 01:35:42,290 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-16 01:35:42,404 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:35:42,404 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-16 01:35:42,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:42,413 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-16 01:35:42,431 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:35:42,431 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-16 01:35:42,441 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-16 01:35:42,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:42,585 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-16 01:35:42,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:42,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:42,592 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-16 01:35:42,605 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-16 01:35:42,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:42,882 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-16 01:35:42,981 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-16 01:35:43,011 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-16 01:35:43,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,030 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-16 01:35:43,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,038 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-16 01:35:43,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,049 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-16 01:35:43,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,068 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-16 01:35:43,078 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-16 01:35:43,087 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-16 01:35:43,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,174 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-16 01:35:43,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:43,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:43,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:35:43,184 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-16 01:35:43,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:43,428 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-16 01:35:44,294 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-16 01:35:44,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268464419] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:44,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:44,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-10-16 01:35:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884483951] [2022-10-16 01:35:44,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 01:35:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 01:35:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=598, Unknown=3, NotChecked=156, Total=870 [2022-10-16 01:35:44,297 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-16 01:35:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:46,470 INFO L93 Difference]: Finished difference Result 510 states and 539 transitions. [2022-10-16 01:35:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 01:35:46,471 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-16 01:35:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:46,477 INFO L225 Difference]: With dead ends: 510 [2022-10-16 01:35:46,477 INFO L226 Difference]: Without dead ends: 510 [2022-10-16 01:35:46,481 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-16 01:35:46,482 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 754 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-16 01:35:46,482 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-16 01:35:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-10-16 01:35:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 171. [2022-10-16 01:35:46,489 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-16 01:35:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2022-10-16 01:35:46,490 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 24 [2022-10-16 01:35:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:46,490 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2022-10-16 01:35:46,490 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-16 01:35:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2022-10-16 01:35:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 01:35:46,491 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:46,491 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-16 01:35:46,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:46,706 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-16 01:35:46,707 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-16 01:35:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash -609637115, now seen corresponding path program 1 times [2022-10-16 01:35:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527720745] [2022-10-16 01:35:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:46,806 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-16 01:35:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:46,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527720745] [2022-10-16 01:35:46,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527720745] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:46,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:35:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333896825] [2022-10-16 01:35:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:46,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:35:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:35:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:35:46,809 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-16 01:35:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:46,929 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-10-16 01:35:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:35:46,930 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-16 01:35:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:46,931 INFO L225 Difference]: With dead ends: 170 [2022-10-16 01:35:46,931 INFO L226 Difference]: Without dead ends: 170 [2022-10-16 01:35:46,931 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-16 01:35:46,933 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-16 01:35:46,934 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-16 01:35:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-16 01:35:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-10-16 01:35:46,941 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-16 01:35:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2022-10-16 01:35:46,942 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 25 [2022-10-16 01:35:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:46,943 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2022-10-16 01:35:46,944 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-16 01:35:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-10-16 01:35:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 01:35:46,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:46,945 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-16 01:35:46,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 01:35:46,945 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-16 01:35:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash -609637114, now seen corresponding path program 1 times [2022-10-16 01:35:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407240487] [2022-10-16 01:35:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:47,385 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-16 01:35:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407240487] [2022-10-16 01:35:47,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407240487] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:47,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:47,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 01:35:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72257396] [2022-10-16 01:35:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:47,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 01:35:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 01:35:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 01:35:47,388 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-16 01:35:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:47,692 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-10-16 01:35:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:35:47,692 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-16 01:35:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:47,693 INFO L225 Difference]: With dead ends: 169 [2022-10-16 01:35:47,694 INFO L226 Difference]: Without dead ends: 169 [2022-10-16 01:35:47,694 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-16 01:35:47,695 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:47,695 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.2s Time] [2022-10-16 01:35:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-16 01:35:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-16 01:35:47,699 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-16 01:35:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-10-16 01:35:47,700 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 25 [2022-10-16 01:35:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:47,700 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-10-16 01:35:47,701 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-16 01:35:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-10-16 01:35:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 01:35:47,701 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:47,702 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-16 01:35:47,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 01:35:47,702 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-16 01:35:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1413509039, now seen corresponding path program 1 times [2022-10-16 01:35:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:47,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574944121] [2022-10-16 01:35:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:48,363 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-16 01:35:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:48,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574944121] [2022-10-16 01:35:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574944121] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:35:48,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791564200] [2022-10-16 01:35:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:35:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:35:48,366 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-16 01:35:48,392 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-16 01:35:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:48,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 01:35:48,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:35:48,534 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:35:48,536 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-16 01:35:48,559 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-16 01:35:48,566 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-16 01:35:48,648 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-16 01:35:48,655 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-16 01:35:48,663 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-16 01:35:48,686 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:35:48,688 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-16 01:35:48,694 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-16 01:35:48,701 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-16 01:35:48,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:48,829 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-16 01:35:48,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:35:48,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:48,839 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-16 01:35:48,871 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-16 01:35:48,874 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-16 01:35:48,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:35:49,035 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-16 01:35:49,052 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-16 01:35:49,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:49,436 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-16 01:35:49,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:49,446 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-16 01:35:49,451 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-16 01:35:49,481 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 01:35:49,482 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-16 01:35:49,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:35:49,705 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-16 01:35:50,722 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-16 01:35:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791564200] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:35:50,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:35:50,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 31 [2022-10-16 01:35:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658897128] [2022-10-16 01:35:50,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:35:50,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 01:35:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 01:35:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=771, Unknown=1, NotChecked=56, Total=930 [2022-10-16 01:35:50,725 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) [2022-10-16 01:35:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:57,100 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2022-10-16 01:35:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 01:35:57,101 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 26 [2022-10-16 01:35:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:57,103 INFO L225 Difference]: With dead ends: 230 [2022-10-16 01:35:57,103 INFO L226 Difference]: Without dead ends: 230 [2022-10-16 01:35:57,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=284, Invalid=1609, Unknown=3, NotChecked=84, Total=1980 [2022-10-16 01:35:57,109 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 473 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:57,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1167 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1033 Invalid, 0 Unknown, 739 Unchecked, 0.8s Time] [2022-10-16 01:35:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-10-16 01:35:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 171. [2022-10-16 01:35:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 120 states have (on average 1.525) 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-16 01:35:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2022-10-16 01:35:57,119 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 26 [2022-10-16 01:35:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:57,119 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2022-10-16 01:35:57,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-10-16 01:35:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2022-10-16 01:35:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 01:35:57,122 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:57,123 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, 1, 1, 1, 1] [2022-10-16 01:35:57,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 01:35:57,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 01:35:57,337 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:35:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1702189513, now seen corresponding path program 1 times [2022-10-16 01:35:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:57,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303710820] [2022-10-16 01:35:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:57,768 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-16 01:35:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303710820] [2022-10-16 01:35:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303710820] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:57,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:57,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 01:35:57,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86449843] [2022-10-16 01:35:57,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:57,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 01:35:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 01:35:57,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-10-16 01:35:57,772 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 01:35:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:58,052 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-10-16 01:35:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 01:35:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 01:35:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:58,054 INFO L225 Difference]: With dead ends: 170 [2022-10-16 01:35:58,054 INFO L226 Difference]: Without dead ends: 170 [2022-10-16 01:35:58,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-10-16 01:35:58,055 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 24 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:58,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 657 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:35:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-16 01:35:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-10-16 01:35:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.5166666666666666) 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-16 01:35:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2022-10-16 01:35:58,063 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 29 [2022-10-16 01:35:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:58,064 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2022-10-16 01:35:58,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 01:35:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-10-16 01:35:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 01:35:58,065 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:58,065 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, 1, 1, 1, 1] [2022-10-16 01:35:58,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 01:35:58,065 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:35:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1702189514, now seen corresponding path program 1 times [2022-10-16 01:35:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044506410] [2022-10-16 01:35:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:35:58,637 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-16 01:35:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:35:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044506410] [2022-10-16 01:35:58,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044506410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:35:58,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:35:58,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 01:35:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407571811] [2022-10-16 01:35:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:35:58,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 01:35:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:35:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 01:35:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-10-16 01:35:58,641 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 01:35:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:35:59,058 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-10-16 01:35:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 01:35:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 01:35:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:35:59,061 INFO L225 Difference]: With dead ends: 169 [2022-10-16 01:35:59,061 INFO L226 Difference]: Without dead ends: 169 [2022-10-16 01:35:59,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-10-16 01:35:59,063 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 17 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 01:35:59,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 828 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 01:35:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-16 01:35:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-16 01:35:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 120 states have (on average 1.5083333333333333) 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-16 01:35:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-10-16 01:35:59,069 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 29 [2022-10-16 01:35:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:35:59,070 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-10-16 01:35:59,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 01:35:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-10-16 01:35:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 01:35:59,072 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:35:59,072 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:35:59,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 01:35:59,073 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:35:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:35:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1983567361, now seen corresponding path program 2 times [2022-10-16 01:35:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:35:59,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322861800] [2022-10-16 01:35:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:35:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:35:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322861800] [2022-10-16 01:36:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322861800] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:36:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026413000] [2022-10-16 01:36:00,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 01:36:00,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:36:00,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:36:00,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 01:36:00,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 01:36:00,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:36:00,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 01:36:00,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:36:00,215 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-16 01:36:00,225 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:36:00,226 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-16 01:36:00,280 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-16 01:36:00,286 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-16 01:36:00,459 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:36:00,460 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-16 01:36:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:36:00,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-16 01:36:00,536 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-16 01:36:00,537 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 71 treesize of output 49 [2022-10-16 01:36:00,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-10-16 01:36:00,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-10-16 01:36:01,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:01,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:01,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:01,207 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-10-16 01:36:01,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 44 [2022-10-16 01:36:01,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:01,219 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 01:36:01,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-10-16 01:36:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:01,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:36:07,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:07,378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-10-16 01:36:07,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:07,386 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2022-10-16 01:36:07,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:07,419 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-10-16 01:36:07,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:07,428 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 53 [2022-10-16 01:36:08,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,193 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 85 treesize of output 75 [2022-10-16 01:36:08,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,203 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 50 treesize of output 41 [2022-10-16 01:36:08,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2022-10-16 01:36:08,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,281 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 239 treesize of output 208 [2022-10-16 01:36:08,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,309 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 191 treesize of output 171 [2022-10-16 01:36:08,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:08,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2022-10-16 01:36:15,926 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 01:36:15,927 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 60 treesize of output 1 [2022-10-16 01:36:16,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:16,465 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 74 treesize of output 144 [2022-10-16 01:36:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:17,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026413000] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:36:17,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:36:17,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 39 [2022-10-16 01:36:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237699754] [2022-10-16 01:36:17,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:36:17,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-16 01:36:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-16 01:36:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1338, Unknown=14, NotChecked=0, Total=1482 [2022-10-16 01:36:17,787 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 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-16 01:36:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:19,202 INFO L93 Difference]: Finished difference Result 431 states and 455 transitions. [2022-10-16 01:36:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 01:36:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 01:36:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:19,206 INFO L225 Difference]: With dead ends: 431 [2022-10-16 01:36:19,206 INFO L226 Difference]: Without dead ends: 431 [2022-10-16 01:36:19,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=243, Invalid=2095, Unknown=14, NotChecked=0, Total=2352 [2022-10-16 01:36:19,208 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 634 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1085 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:19,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 2243 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1034 Invalid, 0 Unknown, 1085 Unchecked, 0.8s Time] [2022-10-16 01:36:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-10-16 01:36:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 167. [2022-10-16 01:36:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 166 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-16 01:36:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2022-10-16 01:36:19,215 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 29 [2022-10-16 01:36:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:19,215 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2022-10-16 01:36:19,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 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-16 01:36:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2022-10-16 01:36:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 01:36:19,216 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:19,216 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:36:19,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 01:36:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:19,433 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2095068269, now seen corresponding path program 2 times [2022-10-16 01:36:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:19,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942490577] [2022-10-16 01:36:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942490577] [2022-10-16 01:36:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942490577] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:36:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990535303] [2022-10-16 01:36:20,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 01:36:20,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:36:20,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:36:20,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 01:36:20,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 01:36:20,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:36:20,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 01:36:20,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:36:20,261 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-16 01:36:20,306 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:36:20,307 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-16 01:36:20,353 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-16 01:36:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:36:20,360 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-16 01:36:20,408 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-16 01:36:20,496 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-16 01:36:20,515 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 01:36:20,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-16 01:36:20,556 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-16 01:36:20,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 01:36:20,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-10-16 01:36:20,688 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-16 01:36:20,699 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-16 01:36:20,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:20,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:20,764 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-16 01:36:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:20,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:36:20,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_796 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:20,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_796 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:20,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_796 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (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_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:20,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:21,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_794) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:21,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_794) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:21,135 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 01:36:21,136 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-16 01:36:21,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (= (select (select (store (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_790)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_794) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~t~0#1.base_24| |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) is different from false [2022-10-16 01:36:21,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:21,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-10-16 01:36:21,291 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-16 01:36:21,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 59 [2022-10-16 01:36:21,299 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 48 treesize of output 44 [2022-10-16 01:36:21,306 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 22 treesize of output 20 [2022-10-16 01:36:21,317 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 01:36:21,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-16 01:36:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-10-16 01:36:21,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990535303] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:36:21,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:36:21,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 43 [2022-10-16 01:36:21,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635458650] [2022-10-16 01:36:21,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:36:21,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-10-16 01:36:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-10-16 01:36:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1067, Unknown=11, NotChecked=518, Total=1806 [2022-10-16 01:36:21,454 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:22,207 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (= (select (select (store (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_790)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_794) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~t~0#1.base_24| |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~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) (= |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-16 01:36:22,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_790 Int) (|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_53| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (= (select (select (store (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_790)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_794) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_796) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_53|) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_53| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~t~0#1.base_24| |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_53|)))) (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) (= |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-16 01:36:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:25,171 INFO L93 Difference]: Finished difference Result 353 states and 375 transitions. [2022-10-16 01:36:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 01:36:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 01:36:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:25,176 INFO L225 Difference]: With dead ends: 353 [2022-10-16 01:36:25,176 INFO L226 Difference]: Without dead ends: 353 [2022-10-16 01:36:25,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=435, Invalid=2027, Unknown=24, NotChecked=936, Total=3422 [2022-10-16 01:36:25,179 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 406 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2013 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:25,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2209 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1105 Invalid, 0 Unknown, 2013 Unchecked, 0.8s Time] [2022-10-16 01:36:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-10-16 01:36:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 189. [2022-10-16 01:36:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.45) internal successors, (203), 188 states have internal predecessors, (203), 0 states have call successors, (0), 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-16 01:36:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2022-10-16 01:36:25,189 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 29 [2022-10-16 01:36:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:25,190 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2022-10-16 01:36:25,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2022-10-16 01:36:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 01:36:25,191 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:25,191 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, 1, 1, 1, 1, 1] [2022-10-16 01:36:25,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 01:36:25,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:25,398 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1228267437, now seen corresponding path program 1 times [2022-10-16 01:36:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:25,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471401873] [2022-10-16 01:36:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:25,482 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-16 01:36:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:25,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471401873] [2022-10-16 01:36:25,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471401873] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:36:25,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:36:25,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:36:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054106812] [2022-10-16 01:36:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:36:25,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:36:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:36:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:36:25,484 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 01:36:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:25,598 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2022-10-16 01:36:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:36:25,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 01:36:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:25,600 INFO L225 Difference]: With dead ends: 188 [2022-10-16 01:36:25,600 INFO L226 Difference]: Without dead ends: 188 [2022-10-16 01:36:25,600 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-16 01:36:25,601 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 5 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:25,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 451 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:36:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-10-16 01:36:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-10-16 01:36:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 187 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2022-10-16 01:36:25,606 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 30 [2022-10-16 01:36:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:25,607 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2022-10-16 01:36:25,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 01:36:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2022-10-16 01:36:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 01:36:25,607 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:25,608 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, 1, 1, 1, 1, 1] [2022-10-16 01:36:25,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 01:36:25,608 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1228267438, now seen corresponding path program 1 times [2022-10-16 01:36:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:25,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990429097] [2022-10-16 01:36:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:26,273 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-16 01:36:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990429097] [2022-10-16 01:36:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990429097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:36:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:36:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-16 01:36:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652841065] [2022-10-16 01:36:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:36:26,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-16 01:36:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:26,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-16 01:36:26,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-10-16 01:36:26,278 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 01:36:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:26,580 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2022-10-16 01:36:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 01:36:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 01:36:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:26,583 INFO L225 Difference]: With dead ends: 187 [2022-10-16 01:36:26,583 INFO L226 Difference]: Without dead ends: 187 [2022-10-16 01:36:26,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-10-16 01:36:26,584 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 27 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:26,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 515 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:36:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-10-16 01:36:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-10-16 01:36:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.4357142857142857) internal successors, (201), 186 states have internal predecessors, (201), 0 states have call successors, (0), 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-16 01:36:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2022-10-16 01:36:26,592 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 30 [2022-10-16 01:36:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:26,592 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2022-10-16 01:36:26,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 01:36:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2022-10-16 01:36:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 01:36:26,593 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:26,594 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:36:26,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 01:36:26,594 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 290787197, now seen corresponding path program 3 times [2022-10-16 01:36:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514680446] [2022-10-16 01:36:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:27,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514680446] [2022-10-16 01:36:27,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514680446] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:36:27,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403307037] [2022-10-16 01:36:27,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 01:36:27,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:36:27,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:36:27,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 01:36:27,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 01:36:27,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:36:27,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 01:36:27,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:36:27,517 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 01:36:27,518 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-16 01:36:27,564 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-16 01:36:27,626 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-16 01:36:27,679 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-16 01:36:27,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 01:36:27,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-16 01:36:27,925 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:27,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 59 [2022-10-16 01:36:27,963 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:27,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 59 [2022-10-16 01:36:28,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:28,185 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-10-16 01:36:28,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 27 [2022-10-16 01:36:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:28,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:36:28,594 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-10-16 01:36:28,595 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 31 treesize of output 30 [2022-10-16 01:36:28,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_60| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_990 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_60| 4)) |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_60| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_60|)))) is different from false [2022-10-16 01:36:28,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:28,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 01:36:29,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:29,031 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 29 treesize of output 30 [2022-10-16 01:36:29,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:29,046 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 86 treesize of output 85 [2022-10-16 01:36:29,070 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 70 treesize of output 62 [2022-10-16 01:36:29,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:29,084 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 72 treesize of output 56 [2022-10-16 01:36:29,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:29,718 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 95 treesize of output 365 [2022-10-16 01:36:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 01:36:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403307037] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:36:42,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:36:42,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 40 [2022-10-16 01:36:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201213377] [2022-10-16 01:36:42,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:36:42,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 01:36:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 01:36:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1375, Unknown=14, NotChecked=76, Total=1640 [2022-10-16 01:36:42,539 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand has 41 states, 40 states have (on average 2.05) internal successors, (82), 41 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:44,303 INFO L93 Difference]: Finished difference Result 553 states and 589 transitions. [2022-10-16 01:36:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 01:36:44,304 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 41 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 01:36:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:44,306 INFO L225 Difference]: With dead ends: 553 [2022-10-16 01:36:44,307 INFO L226 Difference]: Without dead ends: 553 [2022-10-16 01:36:44,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=362, Invalid=2280, Unknown=14, NotChecked=100, Total=2756 [2022-10-16 01:36:44,308 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 600 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1824 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:44,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 3036 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1530 Invalid, 0 Unknown, 1824 Unchecked, 1.0s Time] [2022-10-16 01:36:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-10-16 01:36:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 197. [2022-10-16 01:36:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.42) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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-16 01:36:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2022-10-16 01:36:44,317 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 32 [2022-10-16 01:36:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:44,317 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2022-10-16 01:36:44,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 41 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-10-16 01:36:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 01:36:44,318 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:44,318 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:36:44,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 01:36:44,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-16 01:36:44,535 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 290787198, now seen corresponding path program 2 times [2022-10-16 01:36:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367772030] [2022-10-16 01:36:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367772030] [2022-10-16 01:36:45,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367772030] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:36:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102723134] [2022-10-16 01:36:45,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 01:36:45,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:36:45,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:36:45,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 01:36:45,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 01:36:45,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:36:45,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 01:36:45,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:36:45,598 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 01:36:45,599 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-16 01:36:45,670 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-16 01:36:45,679 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-16 01:36:45,876 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 01:36:45,877 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 14 treesize of output 20 [2022-10-16 01:36:45,895 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:36:45,896 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-16 01:36:45,984 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-16 01:36:45,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-16 01:36:46,078 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 01:36:46,078 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 14 treesize of output 20 [2022-10-16 01:36:46,104 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-16 01:36:46,105 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 1 case distinctions, treesize of input 37 treesize of output 28 [2022-10-16 01:36:46,402 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 01:36:46,402 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 14 treesize of output 20 [2022-10-16 01:36:46,427 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:46,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 61 [2022-10-16 01:36:46,520 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:46,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2022-10-16 01:36:46,528 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 24 treesize of output 26 [2022-10-16 01:36:46,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:46,803 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-16 01:36:46,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:46,815 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-10-16 01:36:46,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 29 [2022-10-16 01:36:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:46,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:36:47,146 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1088) |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_1087) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_1088 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4)))))) is different from false [2022-10-16 01:36:47,229 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1088) |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_1087) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_1088 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 01:36:47,255 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_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1087) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1088 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))))))) is different from false [2022-10-16 01:36:47,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:47,291 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 81 treesize of output 85 [2022-10-16 01:36:47,403 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_19 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_18) |c_ULTIMATE.start_main_~a~0#1.base|) (+ v_prenex_19 4))) (not (<= 0 v_prenex_19)) (not (<= v_prenex_19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4)) (+ 5 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_1087 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_68| Int)) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_68| 4))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_68|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_68| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 01:36:47,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:47,625 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 01:36:48,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,301 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 25 treesize of output 26 [2022-10-16 01:36:48,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,312 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 140 treesize of output 133 [2022-10-16 01:36:48,320 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 118 treesize of output 102 [2022-10-16 01:36:48,328 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 55 treesize of output 47 [2022-10-16 01:36:48,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,457 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 29 treesize of output 30 [2022-10-16 01:36:48,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:48,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,469 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-16 01:36:48,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,484 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 22 treesize of output 22 [2022-10-16 01:36:48,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,530 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 25 treesize of output 26 [2022-10-16 01:36:48,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:48,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:48,538 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-16 01:36:48,547 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-16 01:36:49,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:49,040 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 67 treesize of output 137 [2022-10-16 01:36:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-10-16 01:36:49,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102723134] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:36:49,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:36:49,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 47 [2022-10-16 01:36:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115518451] [2022-10-16 01:36:49,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:36:49,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-16 01:36:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:36:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-16 01:36:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1664, Unknown=21, NotChecked=348, Total=2256 [2022-10-16 01:36:49,510 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:36:52,987 INFO L93 Difference]: Finished difference Result 563 states and 597 transitions. [2022-10-16 01:36:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 01:36:52,988 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 01:36:52,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:36:52,991 INFO L225 Difference]: With dead ends: 563 [2022-10-16 01:36:52,991 INFO L226 Difference]: Without dead ends: 563 [2022-10-16 01:36:52,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=494, Invalid=3283, Unknown=21, NotChecked=492, Total=4290 [2022-10-16 01:36:52,996 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 649 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 3982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1923 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 01:36:52,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 3198 Invalid, 3982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1999 Invalid, 0 Unknown, 1923 Unchecked, 1.5s Time] [2022-10-16 01:36:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-16 01:36:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 196. [2022-10-16 01:36:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 195 states have internal predecessors, (211), 0 states have call successors, (0), 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-16 01:36:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2022-10-16 01:36:53,016 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 32 [2022-10-16 01:36:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:36:53,016 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2022-10-16 01:36:53,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:36:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2022-10-16 01:36:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 01:36:53,018 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:36:53,018 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:36:53,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 01:36:53,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-16 01:36:53,231 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:36:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:36:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 273623294, now seen corresponding path program 2 times [2022-10-16 01:36:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:36:53,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416790421] [2022-10-16 01:36:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:36:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:36:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:36:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:36:54,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416790421] [2022-10-16 01:36:54,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416790421] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:36:54,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091851344] [2022-10-16 01:36:54,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 01:36:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:36:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:36:54,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:36:54,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 01:36:54,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 01:36:54,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:36:54,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 69 conjunts are in the unsatisfiable core [2022-10-16 01:36:54,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:36:54,587 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 01:36:54,588 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-16 01:36:54,652 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-16 01:36:54,665 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-16 01:36:54,881 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-16 01:36:54,896 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:36:54,896 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-16 01:36:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:36:54,909 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 21 [2022-10-16 01:36:54,953 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-16 01:36:54,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 01:36:55,017 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-16 01:36:55,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:36:55,024 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 21 treesize of output 20 [2022-10-16 01:36:55,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-16 01:36:55,195 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 01:36:55,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-16 01:36:55,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:36:55,205 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-16 01:36:55,229 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:55,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 49 [2022-10-16 01:36:55,295 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:36:55,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 65 [2022-10-16 01:36:55,303 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 22 treesize of output 24 [2022-10-16 01:36:55,309 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 26 treesize of output 28 [2022-10-16 01:36:55,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:55,486 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-16 01:36:55,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:36:55,500 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-10-16 01:36:55,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 29 [2022-10-16 01:36:55,532 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-16 01:36:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:36:55,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:36:55,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_74| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_74| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_74| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1190) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1191) |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_1192) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_74|)))) is different from false [2022-10-16 01:36:55,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_74| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_74| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_74| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1190) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_74|)))) is different from false [2022-10-16 01:36:55,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_74| Int)) (or (= (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))) (.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_74| 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1190) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1191) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1192) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_74| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_74|)))) is different from false [2022-10-16 01:36:56,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,075 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-10-16 01:36:56,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,089 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 59 treesize of output 65 [2022-10-16 01:36:56,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,104 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 118 treesize of output 121 [2022-10-16 01:36:56,113 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 45 treesize of output 27 [2022-10-16 01:36:56,161 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 30 treesize of output 22 [2022-10-16 01:36:56,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,864 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 142 treesize of output 133 [2022-10-16 01:36:56,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,877 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 122 treesize of output 123 [2022-10-16 01:36:56,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,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 325 treesize of output 234 [2022-10-16 01:36:56,904 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 214 treesize of output 198 [2022-10-16 01:36:56,912 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 198 treesize of output 190 [2022-10-16 01:36:56,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 433 [2022-10-16 01:36:56,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,970 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 398 treesize of output 383 [2022-10-16 01:36:56,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:36:56,994 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 374 treesize of output 315 [2022-10-16 01:36:57,009 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 306 treesize of output 290 [2022-10-16 01:36:57,032 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 290 treesize of output 282 [2022-10-16 01:37:12,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:12,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 236 [2022-10-16 01:37:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-10-16 01:37:17,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091851344] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:37:17,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:37:17,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 45 [2022-10-16 01:37:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388386923] [2022-10-16 01:37:17,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:37:17,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 01:37:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 01:37:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1538, Unknown=9, NotChecked=246, Total=1980 [2022-10-16 01:37:17,776 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 45 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:20,504 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2022-10-16 01:37:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 01:37:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 01:37:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:20,508 INFO L225 Difference]: With dead ends: 376 [2022-10-16 01:37:20,508 INFO L226 Difference]: Without dead ends: 376 [2022-10-16 01:37:20,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=538, Invalid=3613, Unknown=21, NotChecked=384, Total=4556 [2022-10-16 01:37:20,510 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 511 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2096 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:20,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2003 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1554 Invalid, 0 Unknown, 2096 Unchecked, 1.1s Time] [2022-10-16 01:37:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-10-16 01:37:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 196. [2022-10-16 01:37:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 195 states have internal predecessors, (211), 0 states have call successors, (0), 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-16 01:37:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2022-10-16 01:37:20,521 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 34 [2022-10-16 01:37:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:20,522 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2022-10-16 01:37:20,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 45 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2022-10-16 01:37:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 01:37:20,522 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:20,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:20,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-10-16 01:37:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 01:37:20,739 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash -454761710, now seen corresponding path program 1 times [2022-10-16 01:37:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174114070] [2022-10-16 01:37:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:20,845 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-16 01:37:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:20,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174114070] [2022-10-16 01:37:20,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174114070] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:20,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:20,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:37:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280445681] [2022-10-16 01:37:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:20,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:37:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:37:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:37:20,848 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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-16 01:37:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:21,063 INFO L93 Difference]: Finished difference Result 257 states and 275 transitions. [2022-10-16 01:37:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 01:37:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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 35 [2022-10-16 01:37:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:21,065 INFO L225 Difference]: With dead ends: 257 [2022-10-16 01:37:21,065 INFO L226 Difference]: Without dead ends: 257 [2022-10-16 01:37:21,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 01:37:21,066 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 362 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:21,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 245 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:37:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-10-16 01:37:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2022-10-16 01:37:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 193 states have internal predecessors, (209), 0 states have call successors, (0), 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-16 01:37:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2022-10-16 01:37:21,072 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 35 [2022-10-16 01:37:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:21,072 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2022-10-16 01:37:21,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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-16 01:37:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2022-10-16 01:37:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 01:37:21,073 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:21,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:21,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-10-16 01:37:21,074 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash -454761709, now seen corresponding path program 1 times [2022-10-16 01:37:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:21,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107979898] [2022-10-16 01:37:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:21,279 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-16 01:37:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107979898] [2022-10-16 01:37:21,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107979898] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:21,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:21,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 01:37:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162448886] [2022-10-16 01:37:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:21,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 01:37:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 01:37:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:37:21,281 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 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-16 01:37:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:21,494 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-10-16 01:37:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 01:37:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 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 35 [2022-10-16 01:37:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:21,497 INFO L225 Difference]: With dead ends: 228 [2022-10-16 01:37:21,498 INFO L226 Difference]: Without dead ends: 228 [2022-10-16 01:37:21,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-10-16 01:37:21,499 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 382 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:21,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 229 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:37:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-16 01:37:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2022-10-16 01:37:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 149 states have (on average 1.389261744966443) internal successors, (207), 191 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 01:37:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2022-10-16 01:37:21,505 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 35 [2022-10-16 01:37:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:21,505 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2022-10-16 01:37:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 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-16 01:37:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2022-10-16 01:37:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 01:37:21,506 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:21,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:21,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-16 01:37:21,507 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1212709897, now seen corresponding path program 1 times [2022-10-16 01:37:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368094094] [2022-10-16 01:37:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:21,623 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-16 01:37:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368094094] [2022-10-16 01:37:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368094094] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:21,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:21,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:37:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252548128] [2022-10-16 01:37:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:21,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:37:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:37:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:37:21,625 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:21,827 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-10-16 01:37:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:37:21,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 01:37:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:21,829 INFO L225 Difference]: With dead ends: 213 [2022-10-16 01:37:21,829 INFO L226 Difference]: Without dead ends: 213 [2022-10-16 01:37:21,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 01:37:21,830 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 297 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:21,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 220 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:37:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-16 01:37:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2022-10-16 01:37:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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-16 01:37:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-10-16 01:37:21,837 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 36 [2022-10-16 01:37:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:21,838 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-10-16 01:37:21,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-10-16 01:37:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 01:37:21,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:21,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:21,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-10-16 01:37:21,839 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1212709896, now seen corresponding path program 1 times [2022-10-16 01:37:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:21,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380625331] [2022-10-16 01:37:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:22,074 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-16 01:37:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:22,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380625331] [2022-10-16 01:37:22,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380625331] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:22,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:22,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 01:37:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97166546] [2022-10-16 01:37:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:22,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 01:37:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:22,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 01:37:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:37:22,076 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:22,284 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2022-10-16 01:37:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 01:37:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 01:37:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:22,285 INFO L225 Difference]: With dead ends: 184 [2022-10-16 01:37:22,285 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 01:37:22,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-10-16 01:37:22,286 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 287 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:22,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 01:37:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 01:37:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-10-16 01:37:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 183 states have internal predecessors, (199), 0 states have call successors, (0), 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-16 01:37:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2022-10-16 01:37:22,291 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 36 [2022-10-16 01:37:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:22,291 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2022-10-16 01:37:22,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2022-10-16 01:37:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 01:37:22,292 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:22,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:22,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-10-16 01:37:22,293 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1060664247, now seen corresponding path program 1 times [2022-10-16 01:37:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043301053] [2022-10-16 01:37:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:23,020 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-16 01:37:23,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:23,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043301053] [2022-10-16 01:37:23,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043301053] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:23,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:23,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-10-16 01:37:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140100827] [2022-10-16 01:37:23,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 01:37:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 01:37:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-10-16 01:37:23,023 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:24,060 INFO L93 Difference]: Finished difference Result 252 states and 273 transitions. [2022-10-16 01:37:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 01:37:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-16 01:37:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:24,061 INFO L225 Difference]: With dead ends: 252 [2022-10-16 01:37:24,062 INFO L226 Difference]: Without dead ends: 252 [2022-10-16 01:37:24,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 01:37:24,063 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 411 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:24,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1154 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 01:37:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-10-16 01:37:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-10-16 01:37:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 155 states have (on average 1.303225806451613) internal successors, (202), 184 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 202 transitions. [2022-10-16 01:37:24,068 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 202 transitions. Word has length 37 [2022-10-16 01:37:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:24,069 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 202 transitions. [2022-10-16 01:37:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 202 transitions. [2022-10-16 01:37:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 01:37:24,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:24,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-10-16 01:37:24,070 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1060664248, now seen corresponding path program 1 times [2022-10-16 01:37:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:24,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324539388] [2022-10-16 01:37:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:25,154 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-16 01:37:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:25,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324539388] [2022-10-16 01:37:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324539388] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:37:25,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:37:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-10-16 01:37:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707009479] [2022-10-16 01:37:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:37:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 01:37:25,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:37:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 01:37:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-10-16 01:37:25,158 INFO L87 Difference]: Start difference. First operand 185 states and 202 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:37:26,534 INFO L93 Difference]: Finished difference Result 298 states and 324 transitions. [2022-10-16 01:37:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 01:37:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-16 01:37:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:37:26,537 INFO L225 Difference]: With dead ends: 298 [2022-10-16 01:37:26,537 INFO L226 Difference]: Without dead ends: 298 [2022-10-16 01:37:26,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 01:37:26,539 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 625 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 01:37:26,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1154 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 01:37:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-10-16 01:37:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 209. [2022-10-16 01:37:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 208 states have internal predecessors, (242), 0 states have call successors, (0), 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-16 01:37:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 242 transitions. [2022-10-16 01:37:26,546 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 242 transitions. Word has length 37 [2022-10-16 01:37:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:37:26,546 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 242 transitions. [2022-10-16 01:37:26,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:37:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 242 transitions. [2022-10-16 01:37:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 01:37:26,547 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:37:26,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:37:26,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-10-16 01:37:26,548 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-16 01:37:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:37:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -331532750, now seen corresponding path program 4 times [2022-10-16 01:37:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:37:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776677163] [2022-10-16 01:37:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:37:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:37:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:37:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:37:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:37:27,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776677163] [2022-10-16 01:37:27,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776677163] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:37:27,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021512458] [2022-10-16 01:37:27,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 01:37:27,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:37:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:37:27,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 01:37:27,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 01:37:27,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 01:37:27,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 01:37:27,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 71 conjunts are in the unsatisfiable core [2022-10-16 01:37:27,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:37:28,045 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-16 01:37:28,064 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 01:37:28,065 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-16 01:37:28,140 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-16 01:37:28,158 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-16 01:37:28,387 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 01:37:28,388 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 40 treesize of output 36 [2022-10-16 01:37:28,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:37:28,404 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-16 01:37:28,487 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-10-16 01:37:28,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-10-16 01:37:28,527 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-10-16 01:37:28,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-10-16 01:37:28,679 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-16 01:37:28,679 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 1 case distinctions, treesize of input 55 treesize of output 38 [2022-10-16 01:37:28,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-10-16 01:37:28,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:37:28,711 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 14 treesize of output 16 [2022-10-16 01:37:29,039 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:37:29,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 62 [2022-10-16 01:37:29,081 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 01:37:29,082 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 14 treesize of output 20 [2022-10-16 01:37:29,174 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 01:37:29,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 72 [2022-10-16 01:37:29,181 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 24 treesize of output 26 [2022-10-16 01:37:29,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:37:29,490 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-16 01:37:29,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:37:29,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 01:37:29,786 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-10-16 01:37:29,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 35 [2022-10-16 01:37:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:37:29,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:37:30,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1634))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 4))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_83|)) (<= (+ .cse2 1) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_83| |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 01:37:30,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (<= (+ .cse0 1) 0) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1634))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse0 4))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_83|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_83| |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 01:37:30,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1635) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1634))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 4))) 1) (<= (+ .cse3 1) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_83|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_83| |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 01:37:30,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:30,643 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-10-16 01:37:31,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:31,086 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 122 treesize of output 112 [2022-10-16 01:37:31,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:31,096 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 80 treesize of output 71 [2022-10-16 01:37:31,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:31,114 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 661 treesize of output 642 [2022-10-16 01:37:32,059 INFO L356 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2022-10-16 01:37:32,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 13000 treesize of output 12007 [2022-10-16 01:37:32,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:32,354 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 11826 treesize of output 8010 [2022-10-16 01:37:32,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 01:37:32,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7784 treesize of output 6688 [2022-10-16 01:37:32,704 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 334 treesize of output 250 [2022-10-16 01:37:32,841 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 372 treesize of output 280