/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:31:46,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:31:46,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:31:46,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:31:46,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:31:46,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:31:46,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:31:46,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:31:46,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:31:46,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:31:46,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:31:46,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:31:46,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:31:46,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:31:46,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:31:46,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:31:46,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:31:46,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:31:46,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:31:46,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:31:46,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:31:46,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:31:46,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:31:46,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:31:46,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:31:46,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:31:46,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:31:46,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:31:46,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:31:46,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:31:46,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:31:46,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:31:46,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:31:46,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:31:46,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:31:46,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:31:46,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:31:46,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:31:46,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:31:46,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:31:46,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:31:46,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:31:46,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:31:46,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:31:46,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:31:46,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:31:46,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:31:46,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:31:46,479 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:31:46,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:31:46,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:31:46,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:31:46,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:31:46,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:31:46,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:31:46,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:31:46,483 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:31:46,483 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:31:46,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:31:46,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:31:46,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:31:46,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:31:46,694 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:31:46,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 23:31:46,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05e4a66b/4cdbc310fa7f4cab97c733c00cd8b8f3/FLAG6fdfea3fa [2022-01-10 23:31:47,276 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:31:47,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 23:31:47,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05e4a66b/4cdbc310fa7f4cab97c733c00cd8b8f3/FLAG6fdfea3fa [2022-01-10 23:31:47,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05e4a66b/4cdbc310fa7f4cab97c733c00cd8b8f3 [2022-01-10 23:31:47,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:31:47,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:31:47,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:31:47,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:31:47,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:31:47,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:31:47" (1/1) ... [2022-01-10 23:31:47,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66856073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:47, skipping insertion in model container [2022-01-10 23:31:47,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:31:47" (1/1) ... [2022-01-10 23:31:47,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:31:47,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:31:48,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 23:31:48,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:31:48,093 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:31:48,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 23:31:48,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:31:48,160 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:31:48,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48 WrapperNode [2022-01-10 23:31:48,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:31:48,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:31:48,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:31:48,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:31:48,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,202 INFO L137 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 110 [2022-01-10 23:31:48,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:31:48,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:31:48,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:31:48,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:31:48,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:31:48,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:31:48,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:31:48,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:31:48,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:31:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:48,266 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-01-10 23:31:48,275 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-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:31:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:31:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:31:48,381 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:31:48,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:31:48,566 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:31:48,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:31:48,571 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 23:31:48,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:31:48 BoogieIcfgContainer [2022-01-10 23:31:48,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:31:48,573 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:31:48,573 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:31:48,575 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:31:48,577 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:31:48" (1/1) ... [2022-01-10 23:31:48,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:31:48 BasicIcfg [2022-01-10 23:31:48,699 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:31:48,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:31:48,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:31:48,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:31:48,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:31:47" (1/4) ... [2022-01-10 23:31:48,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566c9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:31:48, skipping insertion in model container [2022-01-10 23:31:48,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:31:48" (2/4) ... [2022-01-10 23:31:48,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566c9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:31:48, skipping insertion in model container [2022-01-10 23:31:48,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:31:48" (3/4) ... [2022-01-10 23:31:48,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566c9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:31:48, skipping insertion in model container [2022-01-10 23:31:48,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:31:48" (4/4) ... [2022-01-10 23:31:48,707 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.iTransformedIcfg [2022-01-10 23:31:48,712 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:31:48,712 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:31:48,750 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:31:48,757 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:31:48,757 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:31:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 23:31:48,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:48,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:48,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 904625206, now seen corresponding path program 1 times [2022-01-10 23:31:48,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:48,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810489530] [2022-01-10 23:31:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:48,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:49,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810489530] [2022-01-10 23:31:49,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810489530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:49,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:49,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:31:49,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374556406] [2022-01-10 23:31:49,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:49,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:31:49,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:31:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:31:49,077 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-01-10 23:31:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:49,090 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-01-10 23:31:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:31:49,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-01-10 23:31:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:49,099 INFO L225 Difference]: With dead ends: 45 [2022-01-10 23:31:49,100 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 23:31:49,102 INFO L932 BasicCegarLoop]: 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-01-10 23:31:49,105 INFO L933 BasicCegarLoop]: 37 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, 37 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-01-10 23:31:49,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:31:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 23:31:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 23:31:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-10 23:31:49,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2022-01-10 23:31:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:49,131 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-10 23:31:49,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-01-10 23:31:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-10 23:31:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:31:49,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:49,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:49,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:31:49,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 495463428, now seen corresponding path program 1 times [2022-01-10 23:31:49,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:49,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116416861] [2022-01-10 23:31:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:49,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:49,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:49,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116416861] [2022-01-10 23:31:49,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116416861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:49,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:49,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:31:49,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368841570] [2022-01-10 23:31:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:49,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:31:49,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:31:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:31:49,291 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-01-10 23:31:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:49,364 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-01-10 23:31:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:31:49,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-01-10 23:31:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:49,366 INFO L225 Difference]: With dead ends: 39 [2022-01-10 23:31:49,366 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 23:31:49,366 INFO L932 BasicCegarLoop]: 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-01-10 23:31:49,367 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:49,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:31:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 23:31:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-01-10 23:31:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 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-01-10 23:31:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-01-10 23:31:49,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2022-01-10 23:31:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:49,384 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-01-10 23:31:49,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-01-10 23:31:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-01-10 23:31:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:31:49,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:49,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:49,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:31:49,386 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash -601965088, now seen corresponding path program 1 times [2022-01-10 23:31:49,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130905562] [2022-01-10 23:31:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:49,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:49,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130905562] [2022-01-10 23:31:49,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130905562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:49,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:49,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:31:49,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706361408] [2022-01-10 23:31:49,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:49,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:31:49,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:31:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:31:49,534 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-01-10 23:31:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:49,608 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-01-10 23:31:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:31:49,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-01-10 23:31:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:49,615 INFO L225 Difference]: With dead ends: 46 [2022-01-10 23:31:49,615 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 23:31:49,618 INFO L932 BasicCegarLoop]: 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-01-10 23:31:49,621 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:49,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:31:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 23:31:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-01-10 23:31:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-01-10 23:31:49,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 15 [2022-01-10 23:31:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:49,637 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-01-10 23:31:49,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-01-10 23:31:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-01-10 23:31:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:31:49,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:49,639 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:49,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:31:49,640 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1523204959, now seen corresponding path program 1 times [2022-01-10 23:31:49,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:49,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967826909] [2022-01-10 23:31:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:49,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:31:49,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:49,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967826909] [2022-01-10 23:31:49,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967826909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:49,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:49,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:31:49,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700650253] [2022-01-10 23:31:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:49,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:31:49,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:31:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:31:49,853 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:49,954 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-01-10 23:31:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:31:49,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 23:31:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:49,956 INFO L225 Difference]: With dead ends: 68 [2022-01-10 23:31:49,956 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 23:31:49,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:31:49,957 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:49,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:31:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 23:31:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-10 23:31:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 23:31:49,966 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-01-10 23:31:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:49,966 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 23:31:49,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 23:31:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:31:49,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:49,967 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:49,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:31:49,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1773103351, now seen corresponding path program 1 times [2022-01-10 23:31:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:49,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733647137] [2022-01-10 23:31:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:49,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:50,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:50,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733647137] [2022-01-10 23:31:50,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733647137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:50,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706702262] [2022-01-10 23:31:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:50,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:50,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:50,404 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-01-10 23:31:50,405 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-01-10 23:31:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:50,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 23:31:50,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:50,610 INFO L387 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-01-10 23:31:50,761 INFO L387 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-01-10 23:31:50,821 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:50,824 INFO L387 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-01-10 23:31:50,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:50,927 INFO L387 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 23 treesize of output 22 [2022-01-10 23:31:51,006 INFO L387 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-01-10 23:31:51,110 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 23:31:51,110 INFO L387 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 23 treesize of output 30 [2022-01-10 23:31:51,201 INFO L387 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-01-10 23:31:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:51,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:55,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_102 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)) (= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1))) is different from false [2022-01-10 23:31:55,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_99 Int) (v_ArrVal_102 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_99)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)))) is different from false [2022-01-10 23:31:55,640 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 23:31:55,644 INFO L387 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 2 case distinctions, treesize of input 32 treesize of output 38 [2022-01-10 23:31:55,664 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:55,665 INFO L387 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 44 treesize of output 48 [2022-01-10 23:31:55,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:55,674 INFO L387 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-01-10 23:31:55,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:55,761 INFO L387 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 5 treesize of output 3 [2022-01-10 23:31:55,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:55,781 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:55,781 INFO L387 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 20 treesize of output 24 [2022-01-10 23:31:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 23:31:56,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706702262] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:56,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:56,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-01-10 23:31:56,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231730867] [2022-01-10 23:31:56,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:56,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 23:31:56,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 23:31:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=636, Unknown=6, NotChecked=106, Total=870 [2022-01-10 23:31:56,059 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:31:56,660 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_99 Int) (v_ArrVal_102 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_99)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-10 23:31:57,171 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_102 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)) (= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1)))) is different from false [2022-01-10 23:32:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:06,610 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-01-10 23:32:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 23:32:06,611 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 23:32:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:06,612 INFO L225 Difference]: With dead ends: 56 [2022-01-10 23:32:06,612 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 23:32:06,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=151, Invalid=777, Unknown=18, NotChecked=244, Total=1190 [2022-01-10 23:32:06,613 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:06,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 149 Unchecked, 0.1s Time] [2022-01-10 23:32:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 23:32:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-01-10 23:32:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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-01-10 23:32:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2022-01-10 23:32:06,620 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 21 [2022-01-10 23:32:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:06,620 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2022-01-10 23:32:06,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-01-10 23:32:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:32:06,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:06,621 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:32:06,662 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-01-10 23:32:06,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:06,822 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1262569174, now seen corresponding path program 1 times [2022-01-10 23:32:06,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:06,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158222033] [2022-01-10 23:32:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:06,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:32:06,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158222033] [2022-01-10 23:32:06,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158222033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:32:06,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:32:06,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:32:06,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120043104] [2022-01-10 23:32:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:32:06,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:32:06,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:32:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:32:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:32:06,858 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:06,875 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-01-10 23:32:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:32:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 23:32:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:06,877 INFO L225 Difference]: With dead ends: 97 [2022-01-10 23:32:06,877 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 23:32:06,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:32:06,881 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:06,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:32:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 23:32:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-01-10 23:32:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 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-01-10 23:32:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-01-10 23:32:06,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 21 [2022-01-10 23:32:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:06,909 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-01-10 23:32:06,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-01-10 23:32:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 23:32:06,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:06,910 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:32:06,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:32:06,910 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1149670574, now seen corresponding path program 1 times [2022-01-10 23:32:06,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:06,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25902056] [2022-01-10 23:32:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:06,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:07,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:07,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25902056] [2022-01-10 23:32:07,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25902056] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:32:07,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642393369] [2022-01-10 23:32:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:07,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:07,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:32:07,382 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-01-10 23:32:07,384 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-01-10 23:32:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:07,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-10 23:32:07,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:32:07,726 INFO L387 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 15 treesize of output 11 [2022-01-10 23:32:07,736 INFO L387 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 15 treesize of output 11 [2022-01-10 23:32:07,847 INFO L387 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-01-10 23:32:07,851 INFO L387 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-01-10 23:32:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:32:07,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:32:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:32:08,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642393369] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:32:08,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:32:08,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 21 [2022-01-10 23:32:08,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992192822] [2022-01-10 23:32:08,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:32:08,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 23:32:08,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:32:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 23:32:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-10 23:32:08,139 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 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-01-10 23:32:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:09,162 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-01-10 23:32:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 23:32:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 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 23 [2022-01-10 23:32:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:09,164 INFO L225 Difference]: With dead ends: 90 [2022-01-10 23:32:09,164 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 23:32:09,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 23:32:09,165 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 177 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:09,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 131 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:32:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 23:32:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2022-01-10 23:32:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-01-10 23:32:09,174 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 23 [2022-01-10 23:32:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:09,175 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-01-10 23:32:09,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 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-01-10 23:32:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-01-10 23:32:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:32:09,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:09,177 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:32:09,205 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-01-10 23:32:09,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-10 23:32:09,406 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1352436018, now seen corresponding path program 2 times [2022-01-10 23:32:09,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:09,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276162673] [2022-01-10 23:32:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:09,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:32:09,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:09,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276162673] [2022-01-10 23:32:09,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276162673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:32:09,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:32:09,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:32:09,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009037060] [2022-01-10 23:32:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:32:09,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:32:09,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:32:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:32:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:32:09,448 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-01-10 23:32:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:09,466 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-01-10 23:32:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:32:09,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-01-10 23:32:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:09,467 INFO L225 Difference]: With dead ends: 102 [2022-01-10 23:32:09,467 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 23:32:09,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:32:09,469 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:09,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:32:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 23:32:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2022-01-10 23:32:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-01-10 23:32:09,478 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2022-01-10 23:32:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:09,479 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-01-10 23:32:09,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-01-10 23:32:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-01-10 23:32:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:32:09,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:09,480 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:32:09,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 23:32:09,480 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash -464932337, now seen corresponding path program 1 times [2022-01-10 23:32:09,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:09,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53681093] [2022-01-10 23:32:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:09,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:09,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53681093] [2022-01-10 23:32:09,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53681093] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:32:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834609618] [2022-01-10 23:32:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:09,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:32:09,912 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-01-10 23:32:09,914 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-01-10 23:32:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:10,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 23:32:10,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:32:10,160 INFO L387 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-01-10 23:32:10,290 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:32:10,290 INFO L387 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-01-10 23:32:10,346 INFO L387 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 15 treesize of output 11 [2022-01-10 23:32:10,353 INFO L387 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 15 treesize of output 11 [2022-01-10 23:32:10,428 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:32:10,428 INFO L387 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 76 treesize of output 73 [2022-01-10 23:32:10,434 INFO L387 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 35 treesize of output 23 [2022-01-10 23:32:10,442 INFO L387 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 38 treesize of output 40 [2022-01-10 23:32:10,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:10,577 INFO L387 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 47 treesize of output 39 [2022-01-10 23:32:10,593 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:10,593 INFO L387 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 27 treesize of output 27 [2022-01-10 23:32:10,877 INFO L387 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-01-10 23:32:10,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:10,986 INFO L387 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 19 [2022-01-10 23:32:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:11,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:32:11,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20|)) (= 3 (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_304) (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 23:32:11,457 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:11,457 INFO L387 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 40 treesize of output 41 [2022-01-10 23:32:11,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:11,468 INFO L387 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 85 treesize of output 88 [2022-01-10 23:32:11,475 INFO L387 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 31 treesize of output 18 [2022-01-10 23:32:13,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:13,719 INFO L387 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 81 [2022-01-10 23:32:13,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:13,726 INFO L387 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 81 treesize of output 69 [2022-01-10 23:32:13,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:13,736 INFO L387 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 85 treesize of output 88 [2022-01-10 23:32:13,747 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:13,747 INFO L387 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 120 treesize of output 115 [2022-01-10 23:32:13,755 INFO L387 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 68 treesize of output 62 [2022-01-10 23:32:13,760 INFO L387 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 62 treesize of output 56 [2022-01-10 23:32:13,765 INFO L387 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 56 treesize of output 50 [2022-01-10 23:32:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:14,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834609618] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:32:14,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:32:14,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-01-10 23:32:14,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894122649] [2022-01-10 23:32:14,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:32:14,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 23:32:14,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:32:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 23:32:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=4, NotChecked=62, Total=1122 [2022-01-10 23:32:14,442 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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-01-10 23:32:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:15,130 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-01-10 23:32:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 23:32:15,130 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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-01-10 23:32:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:15,131 INFO L225 Difference]: With dead ends: 66 [2022-01-10 23:32:15,131 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 23:32:15,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=211, Invalid=1766, Unknown=7, NotChecked=86, Total=2070 [2022-01-10 23:32:15,132 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:15,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-01-10 23:32:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 23:32:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-01-10 23:32:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-01-10 23:32:15,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-01-10 23:32:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:15,137 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-01-10 23:32:15,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 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-01-10 23:32:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-01-10 23:32:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 23:32:15,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:15,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:32:15,172 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-01-10 23:32:15,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:15,352 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2125717568, now seen corresponding path program 1 times [2022-01-10 23:32:15,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:15,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419675255] [2022-01-10 23:32:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:15,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:15,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419675255] [2022-01-10 23:32:15,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419675255] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:32:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107291063] [2022-01-10 23:32:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:15,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:32:15,713 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-01-10 23:32:15,714 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-01-10 23:32:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:15,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-10 23:32:15,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:32:15,865 INFO L387 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-01-10 23:32:15,920 INFO L387 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-01-10 23:32:15,956 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:32:15,957 INFO L387 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-01-10 23:32:16,009 INFO L387 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 19 treesize of output 18 [2022-01-10 23:32:16,064 INFO L387 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-01-10 23:32:16,090 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 23:32:16,090 INFO L387 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-01-10 23:32:16,149 INFO L387 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 14 treesize of output 16 [2022-01-10 23:32:16,173 INFO L387 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-01-10 23:32:16,257 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 23:32:16,257 INFO L387 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 23 treesize of output 30 [2022-01-10 23:32:16,331 INFO L387 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-01-10 23:32:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:16,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:32:18,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 23:32:24,715 INFO L353 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2022-01-10 23:32:24,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2022-01-10 23:32:24,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:24,728 INFO L387 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 232 treesize of output 232 [2022-01-10 23:32:24,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:24,743 INFO L387 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 382 treesize of output 382 [2022-01-10 23:32:24,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:32:24,761 INFO L387 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 319 treesize of output 315 [2022-01-10 23:32:24,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:32:24,772 INFO L387 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 287 treesize of output 279 [2022-01-10 23:32:24,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:32:24,784 INFO L387 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 251 treesize of output 243 [2022-01-10 23:32:24,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:32:24,795 INFO L387 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 229 treesize of output 225 [2022-01-10 23:32:24,817 INFO L387 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 6 treesize of output 4 [2022-01-10 23:32:24,847 INFO L387 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 6 treesize of output 4 [2022-01-10 23:32:25,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:32:25,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:25,143 INFO L387 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 37 treesize of output 41 [2022-01-10 23:32:25,220 INFO L387 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 6 treesize of output 4 [2022-01-10 23:32:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 23:32:27,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107291063] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:32:27,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:32:27,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 36 [2022-01-10 23:32:27,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702282030] [2022-01-10 23:32:27,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:32:27,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 23:32:27,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:32:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 23:32:27,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1024, Unknown=17, NotChecked=66, Total=1260 [2022-01-10 23:32:27,762 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:30,102 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_400) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_400) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12|) 0)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 23:32:32,106 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 23:32:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:32:33,254 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-01-10 23:32:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 23:32:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 23:32:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:32:33,255 INFO L225 Difference]: With dead ends: 63 [2022-01-10 23:32:33,255 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 23:32:33,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=329, Invalid=2011, Unknown=24, NotChecked=288, Total=2652 [2022-01-10 23:32:33,258 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:32:33,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 218 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 252 Unchecked, 0.1s Time] [2022-01-10 23:32:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 23:32:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-01-10 23:32:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-01-10 23:32:33,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2022-01-10 23:32:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:32:33,270 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-01-10 23:32:33,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:32:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-01-10 23:32:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 23:32:33,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:32:33,271 INFO L514 BasicCegarLoop]: 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-01-10 23:32:33,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 23:32:33,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:33,472 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:32:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:32:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1224799706, now seen corresponding path program 1 times [2022-01-10 23:32:33,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:32:33,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134459651] [2022-01-10 23:32:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:33,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:32:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:34,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:32:34,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134459651] [2022-01-10 23:32:34,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134459651] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:32:34,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693230969] [2022-01-10 23:32:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:32:34,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:32:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:32:34,215 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-01-10 23:32:34,216 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-01-10 23:32:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:32:34,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 23:32:34,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:32:34,687 INFO L387 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-01-10 23:32:34,734 INFO L387 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-01-10 23:32:34,761 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:32:34,762 INFO L387 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-01-10 23:32:34,808 INFO L387 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 19 treesize of output 18 [2022-01-10 23:32:34,815 INFO L387 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-01-10 23:32:34,865 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:32:34,865 INFO L387 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 22 treesize of output 22 [2022-01-10 23:32:34,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:32:34,872 INFO L387 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-01-10 23:32:34,942 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:32:34,943 INFO L387 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 29 treesize of output 30 [2022-01-10 23:32:34,947 INFO L387 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-01-10 23:32:35,018 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:32:35,018 INFO L387 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 15 treesize of output 21 [2022-01-10 23:32:35,032 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 23:32:35,032 INFO L387 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 19 treesize of output 22 [2022-01-10 23:32:35,067 INFO L387 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 6 treesize of output 4 [2022-01-10 23:32:35,303 INFO L387 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 12 [2022-01-10 23:32:35,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:32:35,373 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:32:35,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-10 23:32:35,478 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 23:32:35,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-01-10 23:32:35,561 INFO L387 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-01-10 23:32:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:32:35,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:32:36,150 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:36,151 INFO L387 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 124 treesize of output 125 [2022-01-10 23:32:36,172 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:32:36,172 INFO L387 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 918 treesize of output 913 [2022-01-10 23:32:36,182 INFO L387 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 445 treesize of output 433 [2022-01-10 23:32:36,191 INFO L387 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 878 treesize of output 854