/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_SUM.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:24:16,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:24:16,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:24:17,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:24:17,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:24:17,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:24:17,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:24:17,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:24:17,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:24:17,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:24:17,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:24:17,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:24:17,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:24:17,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:24:17,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:24:17,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:24:17,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:24:17,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:24:17,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:24:17,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:24:17,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:24:17,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:24:17,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:24:17,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:24:17,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:24:17,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:24:17,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:24:17,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:24:17,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:24:17,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:24:17,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:24:17,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:24:17,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:24:17,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:24:17,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:24:17,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:24:17,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:24:17,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:24:17,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:24:17,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:24:17,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:24:17,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:24:17,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:24:17,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:24:17,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:24:17,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:24:17,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:24:17,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:24:17,138 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:24:17,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:24:17,139 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:24:17,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:17,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:24:17,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:24:17,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:24:17,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:24:17,142 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:24:17,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:24:17,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:24:17,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:24:17,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:24:17,430 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:24:17,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2022-01-11 05:24:17,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ffd03d3a/c0c6a5b749a3445094d4321c659dc71e/FLAGa77a33e6e [2022-01-11 05:24:17,968 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:24:17,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2022-01-11 05:24:17,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ffd03d3a/c0c6a5b749a3445094d4321c659dc71e/FLAGa77a33e6e [2022-01-11 05:24:18,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ffd03d3a/c0c6a5b749a3445094d4321c659dc71e [2022-01-11 05:24:18,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:24:18,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:24:18,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:18,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:24:18,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:24:18,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e30abb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18, skipping insertion in model container [2022-01-11 05:24:18,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:24:18,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:24:18,626 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-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-01-11 05:24:18,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:18,637 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:24:18,674 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-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-01-11 05:24:18,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:18,695 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:24:18,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18 WrapperNode [2022-01-11 05:24:18,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:18,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:18,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:24:18,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:24:18,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,741 INFO L137 Inliner]: procedures = 125, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-01-11 05:24:18,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:18,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:24:18,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:24:18,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:24:18,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:24:18,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:24:18,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:24:18,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:24:18,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:18,822 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-11 05:24:18,824 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-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:24:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:24:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:24:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:24:18,976 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:24:18,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:24:19,489 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:24:19,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:24:19,495 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-11 05:24:19,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19 BoogieIcfgContainer [2022-01-11 05:24:19,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:24:19,497 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:24:19,497 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:24:19,498 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:24:19,504 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19" (1/1) ... [2022-01-11 05:24:19,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:19 BasicIcfg [2022-01-11 05:24:19,630 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:24:19,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:24:19,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:24:19,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:24:19,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:24:18" (1/4) ... [2022-01-11 05:24:19,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e4fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (2/4) ... [2022-01-11 05:24:19,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e4fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19" (3/4) ... [2022-01-11 05:24:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e4fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:19" (4/4) ... [2022-01-11 05:24:19,640 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.iTransformedIcfg [2022-01-11 05:24:19,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:24:19,645 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:24:19,679 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:24:19,694 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-11 05:24:19,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:24:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 05:24:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:24:19,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:19,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:19,715 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1999168892, now seen corresponding path program 1 times [2022-01-11 05:24:19,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:19,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724014373] [2022-01-11 05:24:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:19,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:19,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:19,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724014373] [2022-01-11 05:24:19,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724014373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:19,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:19,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:24:19,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746369875] [2022-01-11 05:24:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:19,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:24:19,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:24:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:24:19,977 INFO L87 Difference]: Start difference. First operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,000 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2022-01-11 05:24:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:24:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-11 05:24:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,010 INFO L225 Difference]: With dead ends: 88 [2022-01-11 05:24:20,011 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:24:20,013 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-11 05:24:20,017 INFO L933 BasicCegarLoop]: 63 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, 63 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-11 05:24:20,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:24:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-11 05:24:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 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-11 05:24:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-01-11 05:24:20,057 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 16 [2022-01-11 05:24:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,058 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-01-11 05:24:20,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-01-11 05:24:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:24:20,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:24:20,060 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 865918013, now seen corresponding path program 1 times [2022-01-11 05:24:20,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92291936] [2022-01-11 05:24:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,144 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-11 05:24:20,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92291936] [2022-01-11 05:24:20,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92291936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:20,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365650169] [2022-01-11 05:24:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:24:20,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:24:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:24:20,148 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11 05:24:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,174 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2022-01-11 05:24:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:24:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-01-11 05:24:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,177 INFO L225 Difference]: With dead ends: 64 [2022-01-11 05:24:20,177 INFO L226 Difference]: Without dead ends: 46 [2022-01-11 05:24:20,181 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-11 05:24:20,183 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-11 05:24:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-11 05:24:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 0 states have call successors, (0), 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-11 05:24:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-01-11 05:24:20,196 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 18 [2022-01-11 05:24:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,196 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-01-11 05:24:20,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11 05:24:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-01-11 05:24:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:24:20,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:24:20,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1233113289, now seen corresponding path program 1 times [2022-01-11 05:24:20,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143993159] [2022-01-11 05:24:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:20,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143993159] [2022-01-11 05:24:20,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143993159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:20,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281386525] [2022-01-11 05:24:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:24:20,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:24:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:24:20,286 INFO L87 Difference]: Start difference. First operand 46 states and 66 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-11 05:24:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,302 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-01-11 05:24:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:24:20,303 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-11 05:24:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,303 INFO L225 Difference]: With dead ends: 82 [2022-01-11 05:24:20,304 INFO L226 Difference]: Without dead ends: 48 [2022-01-11 05:24:20,304 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-11 05:24:20,305 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-11 05:24:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-11 05:24:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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-11 05:24:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2022-01-11 05:24:20,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 24 [2022-01-11 05:24:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,310 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2022-01-11 05:24:20,311 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-11 05:24:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-01-11 05:24:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:24:20,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:24:20,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2064781654, now seen corresponding path program 1 times [2022-01-11 05:24:20,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197382093] [2022-01-11 05:24:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:20,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197382093] [2022-01-11 05:24:20,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197382093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:20,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159872964] [2022-01-11 05:24:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:20,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:20,567 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,752 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-11 05:24:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:24:20,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-11 05:24:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,754 INFO L225 Difference]: With dead ends: 71 [2022-01-11 05:24:20,754 INFO L226 Difference]: Without dead ends: 67 [2022-01-11 05:24:20,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:24:20,756 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-11 05:24:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-01-11 05:24:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 05:24:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2022-01-11 05:24:20,762 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 24 [2022-01-11 05:24:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,762 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2022-01-11 05:24:20,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-01-11 05:24:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:24:20,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,764 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, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:24:20,764 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 6081297, now seen corresponding path program 1 times [2022-01-11 05:24:20,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909002456] [2022-01-11 05:24:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:21,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:21,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909002456] [2022-01-11 05:24:21,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909002456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:21,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:21,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:21,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159933803] [2022-01-11 05:24:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:21,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:21,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:21,011 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:21,182 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-11 05:24:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:24:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:24:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:21,184 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:24:21,184 INFO L226 Difference]: Without dead ends: 65 [2022-01-11 05:24:21,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:24:21,185 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:21,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-11 05:24:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-01-11 05:24:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2022-01-11 05:24:21,191 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 26 [2022-01-11 05:24:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:21,193 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2022-01-11 05:24:21,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-01-11 05:24:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:24:21,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:21,198 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, 1, 1, 1, 1, 1] [2022-01-11 05:24:21,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:24:21,198 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1915639696, now seen corresponding path program 1 times [2022-01-11 05:24:21,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183408026] [2022-01-11 05:24:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:21,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:21,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183408026] [2022-01-11 05:24:21,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183408026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:21,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:21,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:21,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507445074] [2022-01-11 05:24:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:21,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:21,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:21,368 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:21,501 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-11 05:24:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:24:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:24:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:21,503 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:24:21,503 INFO L226 Difference]: Without dead ends: 62 [2022-01-11 05:24:21,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:24:21,507 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:21,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 146 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-11 05:24:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-11 05:24:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 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-11 05:24:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2022-01-11 05:24:21,518 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 26 [2022-01-11 05:24:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:21,518 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2022-01-11 05:24:21,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2022-01-11 05:24:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:24:21,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:21,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:21,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 05:24:21,523 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1948184160, now seen corresponding path program 1 times [2022-01-11 05:24:21,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:21,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265285106] [2022-01-11 05:24:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:21,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:21,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:21,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265285106] [2022-01-11 05:24:21,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265285106] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:21,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344114535] [2022-01-11 05:24:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:21,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:21,736 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-11 05:24:21,738 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-11 05:24:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-11 05:24:21,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:22,026 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-11 05:24:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:22,104 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 23 treesize of output 22 [2022-01-11 05:24:22,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:22,192 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:22,193 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 19 treesize of output 22 [2022-01-11 05:24:22,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:22,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:22,557 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 10 [2022-01-11 05:24:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:22,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:24,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-11 05:24:25,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (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_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-11 05:24:25,833 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 543 treesize of output 527 [2022-01-11 05:24:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:26,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344114535] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:26,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:26,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2022-01-11 05:24:26,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600618127] [2022-01-11 05:24:26,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:26,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-11 05:24:26,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-11 05:24:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=310, Unknown=2, NotChecked=74, Total=462 [2022-01-11 05:24:26,900 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:24:29,033 WARN L838 $PredicateComparison]: unable to prove that (and (= (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|) 2) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (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_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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 |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:31,040 WARN L838 $PredicateComparison]: unable to prove that (and (= (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|) 2) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (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_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:31,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= 2 (select .cse1 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-11 05:24:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:32,101 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-01-11 05:24:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:24:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:24:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:32,103 INFO L225 Difference]: With dead ends: 91 [2022-01-11 05:24:32,103 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 05:24:32,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=96, Invalid=381, Unknown=5, NotChecked=220, Total=702 [2022-01-11 05:24:32,104 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:32,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 552 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 136 Unchecked, 0.2s Time] [2022-01-11 05:24:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 05:24:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 58. [2022-01-11 05:24:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2022-01-11 05:24:32,109 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 27 [2022-01-11 05:24:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:32,109 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-01-11 05:24:32,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:24:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2022-01-11 05:24:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:24:32,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:32,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:32,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 05:24:32,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:32,313 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2058372434, now seen corresponding path program 1 times [2022-01-11 05:24:32,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:32,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162808570] [2022-01-11 05:24:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:32,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:32,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:32,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162808570] [2022-01-11 05:24:32,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162808570] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:32,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989704106] [2022-01-11 05:24:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:32,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:32,551 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-11 05:24:32,553 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-11 05:24:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:32,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-11 05:24:32,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:32,742 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-11 05:24:32,828 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-11 05:24:32,837 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:32,838 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 16 treesize of output 14 [2022-01-11 05:24:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:32,897 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-11 05:24:32,969 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-11 05:24:32,997 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-11 05:24:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:33,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:33,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_280) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-11 05:24:33,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 Int) (v_ArrVal_280 (Array Int Int))) (= (select (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_277)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_280) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-11 05:24:33,125 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:33,126 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 25 treesize of output 31 [2022-01-11 05:24:33,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:33,139 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 30 treesize of output 33 [2022-01-11 05:24:33,145 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-11 05:24:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:33,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989704106] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:33,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:33,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-01-11 05:24:33,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319401214] [2022-01-11 05:24:33,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:33,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:24:33,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:33,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:24:33,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=278, Unknown=2, NotChecked=70, Total=420 [2022-01-11 05:24:33,311 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-11 05:24:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:33,719 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-01-11 05:24:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:24:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:24:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:33,725 INFO L225 Difference]: With dead ends: 103 [2022-01-11 05:24:33,725 INFO L226 Difference]: Without dead ends: 97 [2022-01-11 05:24:33,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=471, Unknown=2, NotChecked=94, Total=702 [2022-01-11 05:24:33,726 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 67 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:33,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 567 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 233 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-01-11 05:24:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-11 05:24:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-01-11 05:24:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 05:24:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-01-11 05:24:33,732 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 27 [2022-01-11 05:24:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:33,732 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-01-11 05:24:33,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-11 05:24:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-01-11 05:24:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:24:33,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:33,733 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:33,766 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-11 05:24:33,951 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,SelfDestructingSolverStorable7 [2022-01-11 05:24:33,952 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 426565851, now seen corresponding path program 1 times [2022-01-11 05:24:33,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:33,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494992972] [2022-01-11 05:24:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:33,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:34,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494992972] [2022-01-11 05:24:34,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494992972] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744337454] [2022-01-11 05:24:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:34,130 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-11 05:24:34,155 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-11 05:24:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-11 05:24:34,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:34,528 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-11 05:24:34,539 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-11 05:24:34,629 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:24:34,629 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 64 treesize of output 67 [2022-01-11 05:24:34,638 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 31 treesize of output 21 [2022-01-11 05:24:34,655 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-11 05:24:34,655 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 56 treesize of output 64 [2022-01-11 05:24:34,669 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 29 treesize of output 17 [2022-01-11 05:24:34,690 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 32 treesize of output 14 [2022-01-11 05:24:34,903 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 73 treesize of output 57 [2022-01-11 05:24:34,908 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 68 treesize of output 36 [2022-01-11 05:24:35,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:35,035 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:35,036 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 22 treesize of output 14 [2022-01-11 05:24:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:35,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:35,165 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,165 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 106 treesize of output 109 [2022-01-11 05:24:35,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,289 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 53 treesize of output 54 [2022-01-11 05:24:35,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,294 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 54 treesize of output 54 [2022-01-11 05:24:35,304 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,305 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 70 treesize of output 73 [2022-01-11 05:24:35,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,317 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 89 treesize of output 92 [2022-01-11 05:24:35,322 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 45 treesize of output 39 [2022-01-11 05:24:35,326 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 39 treesize of output 33 [2022-01-11 05:24:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:35,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744337454] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:35,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:35,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-01-11 05:24:35,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014328449] [2022-01-11 05:24:35,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:35,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:24:35,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:24:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-01-11 05:24:35,523 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:24:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:35,909 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2022-01-11 05:24:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:24:35,910 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-11 05:24:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:35,910 INFO L225 Difference]: With dead ends: 74 [2022-01-11 05:24:35,910 INFO L226 Difference]: Without dead ends: 66 [2022-01-11 05:24:35,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2022-01-11 05:24:35,912 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:35,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 282 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2022-01-11 05:24:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-11 05:24:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-01-11 05:24:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2022-01-11 05:24:35,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 29 [2022-01-11 05:24:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:35,917 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-01-11 05:24:35,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:24:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2022-01-11 05:24:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:24:35,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:35,918 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:35,946 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-11 05:24:36,131 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-11 05:24:36,132 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1495155142, now seen corresponding path program 1 times [2022-01-11 05:24:36,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:36,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764211013] [2022-01-11 05:24:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:36,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:36,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:36,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764211013] [2022-01-11 05:24:36,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764211013] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:36,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97633429] [2022-01-11 05:24:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:36,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:36,296 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-11 05:24:36,298 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-11 05:24:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:36,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-11 05:24:36,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:36,508 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-11 05:24:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:36,555 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 23 treesize of output 22 [2022-01-11 05:24:36,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:36,611 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:36,612 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 19 treesize of output 22 [2022-01-11 05:24:36,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:36,687 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:36,688 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 26 treesize of output 22 [2022-01-11 05:24:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:36,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:37,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-11 05:24:39,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| Int)) (not (= (select (select (let ((.cse0 (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_431)))) (store .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| (store (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-11 05:24:39,744 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 377 treesize of output 361 [2022-01-11 05:24:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:39,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97633429] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:39,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:39,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2022-01-11 05:24:39,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887368850] [2022-01-11 05:24:39,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:39,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-11 05:24:39,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:39,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-11 05:24:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=216, Unknown=2, NotChecked=62, Total=342 [2022-01-11 05:24:39,841 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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-11 05:24:40,987 WARN L838 $PredicateComparison]: unable to prove that (and (= (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|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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 |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (forall ((v_ArrVal_431 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| Int)) (not (= (select (select (let ((.cse0 (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_431)))) (store .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| (store (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:42,581 WARN L838 $PredicateComparison]: unable to prove that (and (= (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|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (forall ((v_ArrVal_431 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| Int)) (not (= (select (select (let ((.cse0 (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_431)))) (store .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24| (store (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_24|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:43,754 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= 2 (select .cse0 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-11 05:24:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:43,902 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2022-01-11 05:24:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:24:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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) Word has length 29 [2022-01-11 05:24:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:43,903 INFO L225 Difference]: With dead ends: 99 [2022-01-11 05:24:43,903 INFO L226 Difference]: Without dead ends: 88 [2022-01-11 05:24:43,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=86, Invalid=309, Unknown=5, NotChecked=200, Total=600 [2022-01-11 05:24:43,904 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 48 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:43,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 456 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 126 Unchecked, 0.2s Time] [2022-01-11 05:24:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-11 05:24:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2022-01-11 05:24:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2022-01-11 05:24:43,909 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 29 [2022-01-11 05:24:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:43,910 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2022-01-11 05:24:43,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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-11 05:24:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-01-11 05:24:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:24:43,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:43,911 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:43,930 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-11 05:24:44,123 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-11 05:24:44,123 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 515034476, now seen corresponding path program 1 times [2022-01-11 05:24:44,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:44,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238832060] [2022-01-11 05:24:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:44,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:44,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238832060] [2022-01-11 05:24:44,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238832060] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735760581] [2022-01-11 05:24:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:44,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:44,420 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-11 05:24:44,421 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-11 05:24:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:44,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-11 05:24:44,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:44,627 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-11 05:24:44,675 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:44,675 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 16 treesize of output 14 [2022-01-11 05:24:44,718 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-11 05:24:44,727 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-11 05:24:44,782 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:24:44,782 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-11 05:24:44,791 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-11 05:24:44,796 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-11 05:24:44,834 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 47 treesize of output 23 [2022-01-11 05:24:44,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-11 05:24:44,852 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-11 05:24:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:44,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:44,929 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 91 treesize of output 65 [2022-01-11 05:24:44,937 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_513) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_512 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_512) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))))) is different from false [2022-01-11 05:24:44,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:44,965 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 26 treesize of output 27 [2022-01-11 05:24:44,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:44,974 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 42 treesize of output 45 [2022-01-11 05:24:44,978 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 13 treesize of output 7 [2022-01-11 05:24:45,009 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-11 05:24:45,010 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 26 treesize of output 1 [2022-01-11 05:24:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:45,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735760581] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:45,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:45,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-01-11 05:24:45,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509188252] [2022-01-11 05:24:45,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:45,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-11 05:24:45,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-11 05:24:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-01-11 05:24:45,137 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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-11 05:24:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:45,725 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-01-11 05:24:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:24:45,726 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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) Word has length 29 [2022-01-11 05:24:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:45,726 INFO L225 Difference]: With dead ends: 80 [2022-01-11 05:24:45,726 INFO L226 Difference]: Without dead ends: 76 [2022-01-11 05:24:45,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=642, Unknown=1, NotChecked=52, Total=812 [2022-01-11 05:24:45,728 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 55 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:45,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 458 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 283 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2022-01-11 05:24:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-11 05:24:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-01-11 05:24:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-01-11 05:24:45,732 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 29 [2022-01-11 05:24:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:45,732 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-01-11 05:24:45,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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-11 05:24:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2022-01-11 05:24:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:24:45,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:45,733 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:45,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:45,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-11 05:24:45,934 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1798064874, now seen corresponding path program 2 times [2022-01-11 05:24:45,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:45,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705969048] [2022-01-11 05:24:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:45,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:46,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705969048] [2022-01-11 05:24:46,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705969048] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522059201] [2022-01-11 05:24:46,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:24:46,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:46,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:46,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:46,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 05:24:46,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:24:46,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:46,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-11 05:24:46,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:46,485 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-11 05:24:46,589 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:46,589 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 18 treesize of output 16 [2022-01-11 05:24:46,602 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-11 05:24:46,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:46,652 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-11 05:24:46,671 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-11 05:24:46,710 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-11 05:24:46,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:46,763 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:46,763 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 19 treesize of output 22 [2022-01-11 05:24:47,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:47,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:47,059 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 10 [2022-01-11 05:24:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:47,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:48,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-11 05:24:48,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_623))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= 2 .cse0)))) is different from false [2022-01-11 05:24:48,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_623))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (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| 0)) (= 3 .cse0) (= 2 .cse0)))) is different from false [2022-01-11 05:24:48,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (v_ArrVal_618 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| Int)) (let ((.cse0 (select (select (let ((.cse1 (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_618)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_623))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= 2 .cse0) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0)) (= 3 .cse0)))) is different from false [2022-01-11 05:24:48,985 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:48,985 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 103 treesize of output 63 [2022-01-11 05:24:49,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:49,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 405 [2022-01-11 05:24:49,020 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 403 treesize of output 375 [2022-01-11 05:24:49,051 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-11 05:24:49,132 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-11 05:24:49,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,154 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:49,268 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 21 treesize of output 25 [2022-01-11 05:24:49,471 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:24:49,472 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 55 treesize of output 1 [2022-01-11 05:24:49,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,487 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,498 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,580 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:24:49,580 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 55 treesize of output 1 [2022-01-11 05:24:49,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,599 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,611 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,648 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:49,648 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 45 treesize of output 45 [2022-01-11 05:24:49,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,685 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,729 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-01-11 05:24:49,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,754 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,986 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:50,178 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-11 05:24:50,277 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:50,277 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 21 treesize of output 25 [2022-01-11 05:24:50,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:50,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:50,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-11 05:24:50,569 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-11 05:24:51,110 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:51,110 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 345 treesize of output 329 [2022-01-11 05:24:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-11 05:24:52,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522059201] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:52,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:52,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 28 [2022-01-11 05:24:52,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186910574] [2022-01-11 05:24:52,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:52,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-11 05:24:52,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:52,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-11 05:24:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=466, Unknown=4, NotChecked=188, Total=756 [2022-01-11 05:24:52,409 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 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-11 05:24:52,569 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_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_623))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (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| 0)) (= 3 .cse0) (= 2 .cse0)))) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:52,576 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|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((v_ArrVal_623 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_623))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_38|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= 2 .cse0)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:53,499 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 ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:53,670 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2022-01-11 05:24:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-11 05:24:53,671 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 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 30 [2022-01-11 05:24:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:53,671 INFO L225 Difference]: With dead ends: 108 [2022-01-11 05:24:53,671 INFO L226 Difference]: Without dead ends: 102 [2022-01-11 05:24:53,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=132, Invalid=645, Unknown=7, NotChecked=406, Total=1190 [2022-01-11 05:24:53,672 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:53,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 544 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 217 Unchecked, 0.3s Time] [2022-01-11 05:24:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-11 05:24:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2022-01-11 05:24:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 0 states have call successors, (0), 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-11 05:24:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2022-01-11 05:24:53,676 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 30 [2022-01-11 05:24:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:53,676 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2022-01-11 05:24:53,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 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-11 05:24:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2022-01-11 05:24:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:24:53,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:53,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:53,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:53,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:53,878 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 388271140, now seen corresponding path program 1 times [2022-01-11 05:24:53,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133181334] [2022-01-11 05:24:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:53,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:54,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:54,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133181334] [2022-01-11 05:24:54,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133181334] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:54,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729979143] [2022-01-11 05:24:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:54,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:54,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:54,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:54,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 05:24:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:54,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-11 05:24:54,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:54,366 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-11 05:24:54,399 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:54,399 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 16 treesize of output 14 [2022-01-11 05:24:54,407 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-11 05:24:54,427 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-11 05:24:54,449 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-11 05:24:54,488 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-11 05:24:54,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:54,527 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:54,527 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 19 treesize of output 22 [2022-01-11 05:24:54,699 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-11 05:24:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:54,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:56,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-11 05:24:56,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (= .cse0 1)))) is different from false [2022-01-11 05:24:56,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14|)) (= .cse0 1)))) is different from false [2022-01-11 05:24:57,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_731 Int) (v_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (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_731)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 2 .cse0) (<= .cse0 3)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14|)) (= .cse0 1)))) is different from false [2022-01-11 05:24:57,135 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:57,136 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 155 treesize of output 85 [2022-01-11 05:24:57,155 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:57,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 397 [2022-01-11 05:24:57,171 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 393 treesize of output 369 [2022-01-11 05:25:01,667 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-11 05:25:01,715 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-11 05:25:01,725 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-11 05:25:01,735 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-11 05:25:01,757 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:01,757 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 64 treesize of output 64 [2022-01-11 05:25:01,823 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-11 05:25:01,838 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:01,838 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 43 treesize of output 43 [2022-01-11 05:25:01,880 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2022-01-11 05:25:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-11 05:25:01,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729979143] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:01,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:01,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 26 [2022-01-11 05:25:01,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040174752] [2022-01-11 05:25:01,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:01,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 05:25:01,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 05:25:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=386, Unknown=4, NotChecked=172, Total=650 [2022-01-11 05:25:01,997 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:25:02,208 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_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14|)) (= .cse0 1)))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:25:02,219 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_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_14|)) (= .cse0 1)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:25:02,224 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|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_734 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_46|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (= .cse0 1)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:25:03,438 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:25:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:03,535 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-01-11 05:25:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-11 05:25:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 05:25:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:03,536 INFO L225 Difference]: With dead ends: 107 [2022-01-11 05:25:03,537 INFO L226 Difference]: Without dead ends: 103 [2022-01-11 05:25:03,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=125, Invalid=499, Unknown=8, NotChecked=424, Total=1056 [2022-01-11 05:25:03,539 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:03,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 716 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 249 Invalid, 0 Unknown, 219 Unchecked, 0.3s Time] [2022-01-11 05:25:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-11 05:25:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-01-11 05:25:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 0 states have call successors, (0), 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-11 05:25:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2022-01-11 05:25:03,544 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 30 [2022-01-11 05:25:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:03,545 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2022-01-11 05:25:03,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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-11 05:25:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2022-01-11 05:25:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:25:03,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:03,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:03,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-11 05:25:03,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:03,747 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 99860438, now seen corresponding path program 2 times [2022-01-11 05:25:03,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:03,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027437969] [2022-01-11 05:25:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:03,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:25:03,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027437969] [2022-01-11 05:25:03,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027437969] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218039618] [2022-01-11 05:25:03,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:03,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:03,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:03,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 05:25:04,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:04,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:04,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-11 05:25:04,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:04,129 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-11 05:25:04,181 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-11 05:25:04,188 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:04,188 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 16 treesize of output 14 [2022-01-11 05:25:04,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:04,231 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-11 05:25:04,258 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-11 05:25:04,296 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-11 05:25:04,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:04,345 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:25:04,346 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 19 treesize of output 22 [2022-01-11 05:25:04,425 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-11 05:25:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:04,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:06,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-11 05:25:06,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_844))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (<= .cse0 3) (< 2 .cse0))))) is different from false [2022-01-11 05:25:06,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_844))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (= .cse0 1)))) is different from false [2022-01-11 05:25:06,614 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| Int) (v_ArrVal_842 Int)) (let ((.cse0 (select (select (let ((.cse1 (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_842)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_844))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (<= .cse0 3) (< 2 .cse0))))) is different from false [2022-01-11 05:25:06,668 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:25:06,669 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 155 treesize of output 85 [2022-01-11 05:25:06,688 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:06,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 819 treesize of output 793 [2022-01-11 05:25:06,703 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 815 treesize of output 767 [2022-01-11 05:25:06,756 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-11 05:25:06,971 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:06,971 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 281 treesize of output 271 [2022-01-11 05:25:07,538 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-11 05:25:07,593 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:07,593 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 134 treesize of output 132 [2022-01-11 05:25:07,714 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:25:07,715 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 249 treesize of output 1 [2022-01-11 05:25:07,747 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:25:07,747 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 236 treesize of output 1 [2022-01-11 05:25:08,072 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 275 treesize of output 259 [2022-01-11 05:25:09,118 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 275 treesize of output 259 [2022-01-11 05:25:09,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:09,553 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 376 treesize of output 354 [2022-01-11 05:25:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-11 05:25:10,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218039618] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:10,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:10,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2022-01-11 05:25:10,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190489039] [2022-01-11 05:25:10,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:10,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-11 05:25:10,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-11 05:25:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=458, Unknown=4, NotChecked=188, Total=756 [2022-01-11 05:25:10,040 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 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-11 05:25:10,217 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 |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (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_844 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_844))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (= .cse0 1))))) is different from false [2022-01-11 05:25:10,228 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|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_844 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_844))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_54|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (<= .cse0 3) (< 2 .cse0))))) (= (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)) is different from false [2022-01-11 05:25:11,536 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (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)) is different from false [2022-01-11 05:25:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:11,693 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2022-01-11 05:25:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-11 05:25:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 05:25:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:11,694 INFO L225 Difference]: With dead ends: 107 [2022-01-11 05:25:11,694 INFO L226 Difference]: Without dead ends: 103 [2022-01-11 05:25:11,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=162, Invalid=671, Unknown=7, NotChecked=420, Total=1260 [2022-01-11 05:25:11,694 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:11,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 616 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 191 Unchecked, 0.2s Time] [2022-01-11 05:25:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-11 05:25:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-01-11 05:25:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 0 states have call successors, (0), 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-11 05:25:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2022-01-11 05:25:11,698 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 30 [2022-01-11 05:25:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:11,698 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2022-01-11 05:25:11,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 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-11 05:25:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2022-01-11 05:25:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 05:25:11,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:11,700 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:11,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:11,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-11 05:25:11,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1052694951, now seen corresponding path program 1 times [2022-01-11 05:25:11,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531295016] [2022-01-11 05:25:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:11,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:12,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531295016] [2022-01-11 05:25:12,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531295016] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914622149] [2022-01-11 05:25:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:12,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:12,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:12,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:12,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 05:25:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:12,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-11 05:25:12,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:12,410 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-11 05:25:12,448 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:12,449 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 16 treesize of output 14 [2022-01-11 05:25:12,481 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-11 05:25:12,489 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-11 05:25:12,532 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:12,533 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-11 05:25:12,541 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 50 treesize of output 52 [2022-01-11 05:25:12,545 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-11 05:25:12,578 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 47 treesize of output 23 [2022-01-11 05:25:12,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-11 05:25:12,594 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 17 treesize of output 9 [2022-01-11 05:25:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:12,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:12,668 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 60 treesize of output 34 [2022-01-11 05:25:12,673 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_925 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_925) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_926 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_926) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))))) is different from false [2022-01-11 05:25:12,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:12,691 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 26 treesize of output 27 [2022-01-11 05:25:12,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:12,699 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 46 treesize of output 41 [2022-01-11 05:25:12,701 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 13 treesize of output 7 [2022-01-11 05:25:12,729 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-11 05:25:12,729 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-11 05:25:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:25:12,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914622149] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:12,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:12,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-01-11 05:25:12,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686425550] [2022-01-11 05:25:12,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:12,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-11 05:25:12,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-11 05:25:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2022-01-11 05:25:12,860 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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-11 05:25:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:13,426 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-01-11 05:25:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:25:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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) Word has length 31 [2022-01-11 05:25:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:13,427 INFO L225 Difference]: With dead ends: 91 [2022-01-11 05:25:13,427 INFO L226 Difference]: Without dead ends: 83 [2022-01-11 05:25:13,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=797, Unknown=2, NotChecked=58, Total=992 [2022-01-11 05:25:13,429 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:13,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 448 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 322 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2022-01-11 05:25:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-11 05:25:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-01-11 05:25:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2022-01-11 05:25:13,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 31 [2022-01-11 05:25:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:13,433 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2022-01-11 05:25:13,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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-11 05:25:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2022-01-11 05:25:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 05:25:13,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:13,434 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:13,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:13,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-11 05:25:13,636 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -869026042, now seen corresponding path program 2 times [2022-01-11 05:25:13,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:13,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849086533] [2022-01-11 05:25:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:13,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:13,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849086533] [2022-01-11 05:25:13,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849086533] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161633883] [2022-01-11 05:25:13,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:13,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:13,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:13,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-11 05:25:14,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:14,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:14,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-11 05:25:14,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:14,173 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-11 05:25:14,227 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:14,228 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 16 treesize of output 14 [2022-01-11 05:25:14,279 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-11 05:25:14,285 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-11 05:25:14,345 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:14,345 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-11 05:25:14,348 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-11 05:25:14,351 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-11 05:25:14,390 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 47 treesize of output 23 [2022-01-11 05:25:14,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-11 05:25:14,408 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-11 05:25:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:14,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:14,471 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 60 treesize of output 34 [2022-01-11 05:25:14,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1004 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1004) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_1005 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1005) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))))) is different from false [2022-01-11 05:25:14,501 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:14,501 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 26 treesize of output 27 [2022-01-11 05:25:14,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:14,508 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 46 treesize of output 41 [2022-01-11 05:25:14,511 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 13 treesize of output 7 [2022-01-11 05:25:14,541 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-11 05:25:14,541 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-11 05:25:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:25:14,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161633883] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:14,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:14,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-01-11 05:25:14,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392383650] [2022-01-11 05:25:14,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:14,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-11 05:25:14,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-11 05:25:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=394, Unknown=1, NotChecked=40, Total=506 [2022-01-11 05:25:14,644 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:15,106 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2022-01-11 05:25:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-11 05:25:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-11 05:25:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:15,107 INFO L225 Difference]: With dead ends: 89 [2022-01-11 05:25:15,107 INFO L226 Difference]: Without dead ends: 76 [2022-01-11 05:25:15,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=675, Unknown=2, NotChecked=54, Total=870 [2022-01-11 05:25:15,108 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:15,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 512 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 270 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2022-01-11 05:25:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-11 05:25:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-01-11 05:25:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 05:25:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2022-01-11 05:25:15,112 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 31 [2022-01-11 05:25:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:15,112 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2022-01-11 05:25:15,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2022-01-11 05:25:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 05:25:15,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:15,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:15,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:15,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-11 05:25:15,324 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1337688367, now seen corresponding path program 2 times [2022-01-11 05:25:15,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100005256] [2022-01-11 05:25:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:15,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:15,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100005256] [2022-01-11 05:25:15,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100005256] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868715935] [2022-01-11 05:25:15,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:15,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:15,644 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:15,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-11 05:25:15,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:15,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:15,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-11 05:25:15,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:16,077 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-11 05:25:16,086 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-11 05:25:16,141 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-11 05:25:16,141 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 45 treesize of output 28 [2022-01-11 05:25:16,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:16,152 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 23 treesize of output 22 [2022-01-11 05:25:16,156 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-11 05:25:16,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:16,241 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-11 05:25:16,241 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 195 treesize of output 137 [2022-01-11 05:25:16,259 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-11 05:25:16,259 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 122 treesize of output 76 [2022-01-11 05:25:16,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:16,268 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 39 treesize of output 38 [2022-01-11 05:25:16,437 INFO L353 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-01-11 05:25:16,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 208 [2022-01-11 05:25:16,477 INFO L353 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-01-11 05:25:16,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 193 [2022-01-11 05:25:16,535 INFO L353 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2022-01-11 05:25:16,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 167 [2022-01-11 05:25:16,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 68 treesize of output 32 [2022-01-11 05:25:16,793 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 53 treesize of output 29 [2022-01-11 05:25:16,812 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 32 [2022-01-11 05:25:16,960 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 115 treesize of output 67 [2022-01-11 05:25:17,038 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 146 treesize of output 104 [2022-01-11 05:25:17,059 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 146 treesize of output 104 [2022-01-11 05:25:17,244 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 93 treesize of output 69 [2022-01-11 05:25:17,273 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 93 treesize of output 69 [2022-01-11 05:25:17,316 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 47 treesize of output 23 [2022-01-11 05:25:17,411 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-11 05:25:17,411 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2022-01-11 05:25:17,780 INFO L353 Elim1Store]: treesize reduction 24, result has 14.3 percent of original size [2022-01-11 05:25:17,780 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 171 [2022-01-11 05:25:17,797 INFO L353 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-01-11 05:25:17,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 80 [2022-01-11 05:25:18,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:18,035 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:18,035 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 22 treesize of output 14 [2022-01-11 05:25:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:18,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:18,632 INFO L353 Elim1Store]: treesize reduction 4, result has 93.7 percent of original size [2022-01-11 05:25:18,633 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 12723 treesize of output 11870