/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:05:03,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:05:03,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:05:03,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:05:03,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:05:03,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:05:03,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:05:03,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:05:03,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:05:03,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:05:03,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:05:03,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:05:03,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:05:03,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:05:03,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:05:03,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:05:03,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:05:03,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:05:03,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:05:03,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:05:03,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:05:03,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:05:03,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:05:03,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:05:03,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:05:03,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:05:03,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:05:03,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:05:03,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:05:03,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:05:03,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:05:03,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:05:03,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:05:03,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:05:03,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:05:03,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:05:03,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:05:03,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:05:03,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:05:03,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:05:03,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:05:03,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:05:03,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:05:03,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:05:03,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:05:03,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:05:03,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:05:03,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:05:03,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:05:03,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:05:03,822 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:05:03,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:05:03,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:05:03,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:05:03,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:05:03,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:05:03,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:03,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:05:03,825 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:05:04,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:05:04,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:05:04,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:05:04,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:05:04,071 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:05:04,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2022-01-10 06:05:04,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4916bd94/9f43eb1b0eb74a04aee2015018f41c1e/FLAG698860288 [2022-01-10 06:05:04,505 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:05:04,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i [2022-01-10 06:05:04,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4916bd94/9f43eb1b0eb74a04aee2015018f41c1e/FLAG698860288 [2022-01-10 06:05:04,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4916bd94/9f43eb1b0eb74a04aee2015018f41c1e [2022-01-10 06:05:04,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:05:04,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:05:04,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:04,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:05:04,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:05:04,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775a38f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04, skipping insertion in model container [2022-01-10 06:05:04,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:05:04,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:05:04,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-01-10 06:05:04,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-01-10 06:05:04,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-01-10 06:05:04,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-01-10 06:05:04,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:04,850 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:05:04,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-01-10 06:05:04,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-01-10 06:05:04,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-01-10 06:05:04,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-01-10 06:05:04,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:04,905 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:05:04,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04 WrapperNode [2022-01-10 06:05:04,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:04,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:04,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:05:04,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:05:04,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,956 INFO L137 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2022-01-10 06:05:04,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:04,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:05:04,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:05:04,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:05:04,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:05:04,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:05:04,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:05:04,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:05:04,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (1/1) ... [2022-01-10 06:05:04,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:05:05,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:05:05,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:05:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:05:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:05:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:05:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:05:05,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:05:05,103 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:05:05,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:05:05,456 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:05:05,459 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:05:05,460 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 06:05:05,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:05 BoogieIcfgContainer [2022-01-10 06:05:05,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:05:05,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:05:05,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:05:05,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:05:05,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:05:04" (1/3) ... [2022-01-10 06:05:05,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20893671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:05, skipping insertion in model container [2022-01-10 06:05:05,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:04" (2/3) ... [2022-01-10 06:05:05,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20893671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:05, skipping insertion in model container [2022-01-10 06:05:05,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:05" (3/3) ... [2022-01-10 06:05:05,466 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2022-01-10 06:05:05,469 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:05:05,469 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 06:05:05,520 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:05:05,524 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:05:05,524 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 06:05:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 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-10 06:05:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 06:05:05,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:05,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 06:05:05,543 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash 889937798, now seen corresponding path program 1 times [2022-01-10 06:05:05,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:05,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145978089] [2022-01-10 06:05:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:05,554 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:05,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:05:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:05,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:05:05,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:05,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:05,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:05,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145978089] [2022-01-10 06:05:05,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145978089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:05,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:05,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:05:05,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893271756] [2022-01-10 06:05:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:05,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:05:05,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:05:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:05:05,708 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:05,721 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-01-10 06:05:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:05:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 06:05:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:05,728 INFO L225 Difference]: With dead ends: 60 [2022-01-10 06:05:05,728 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 06:05:05,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:05:05,732 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:05,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:05:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 06:05:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 06:05:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-10 06:05:05,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2022-01-10 06:05:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:05,755 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-10 06:05:05,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-10 06:05:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 06:05:05,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:05,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 06:05:05,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:05,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:05,963 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 889639888, now seen corresponding path program 1 times [2022-01-10 06:05:05,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:05,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098850073] [2022-01-10 06:05:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:05,964 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:05,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:05,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:05:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:06,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:05:06,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:06,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:06,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:06,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098850073] [2022-01-10 06:05:06,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098850073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:06,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:06,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:05:06,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103155553] [2022-01-10 06:05:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:06,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:05:06,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:05:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:05:06,052 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:06,149 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-01-10 06:05:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:05:06,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 06:05:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:06,151 INFO L225 Difference]: With dead ends: 29 [2022-01-10 06:05:06,151 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 06:05:06,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:06,152 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:06,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:05:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 06:05:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-01-10 06:05:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 06:05:06,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-01-10 06:05:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:06,156 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 06:05:06,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 06:05:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 06:05:06,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:06,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:06,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 06:05:06,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:06,363 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -977335784, now seen corresponding path program 1 times [2022-01-10 06:05:06,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:06,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821626692] [2022-01-10 06:05:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:06,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:06,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:05:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:06,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:05:06,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:06,471 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 13 treesize of output 9 [2022-01-10 06:05:06,545 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 19 treesize of output 7 [2022-01-10 06:05:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:06,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:06,557 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821626692] [2022-01-10 06:05:06,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821626692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:06,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:06,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:06,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137107298] [2022-01-10 06:05:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:06,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:06,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:06,559 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:06,790 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-01-10 06:05:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 06:05:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:06,791 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:05:06,791 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 06:05:06,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:06,793 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:06,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 06:05:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2022-01-10 06:05:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-10 06:05:06,798 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-01-10 06:05:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:06,799 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-10 06:05:06,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-10 06:05:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:05:06,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:06,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:06,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:07,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,006 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -822388269, now seen corresponding path program 1 times [2022-01-10 06:05:07,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:07,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611671437] [2022-01-10 06:05:07,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:07,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:07,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:07,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:05:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:07,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 06:05:07,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:07,171 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 13 treesize of output 9 [2022-01-10 06:05:07,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:05:07,237 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:05:07,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 06:05:07,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:07,246 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:07,253 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 16 treesize of output 18 [2022-01-10 06:05:07,316 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 06:05:07,316 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 2 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 06:05:07,325 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 8 treesize of output 7 [2022-01-10 06:05:07,360 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 7 treesize of output 3 [2022-01-10 06:05:07,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:05:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:07,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:07,506 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:07,506 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:05:07,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 (_ BitVec 64)) (v_arrayElimArr_2 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_105 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_2 (_ bv8 64)) ~unnamed1~0~BLACK)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_105) v_ArrVal_104 v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:07,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 (_ BitVec 64)) (v_ArrVal_102 (_ BitVec 64)) (v_arrayElimArr_2 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_100 (_ BitVec 32)) (v_ArrVal_105 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_102))) (not (= (select v_arrayElimArr_2 (_ bv8 64)) ~unnamed1~0~BLACK)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_100)) v_ArrVal_102 v_ArrVal_105) v_ArrVal_104 v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK))) is different from false [2022-01-10 06:05:07,668 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 06:05:07,668 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 2 case distinctions, treesize of input 24 treesize of output 1 [2022-01-10 06:05:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 06:05:07,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:07,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611671437] [2022-01-10 06:05:07,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611671437] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:07,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:07,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-01-10 06:05:07,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965952489] [2022-01-10 06:05:07,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:07,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:05:07,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:05:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2022-01-10 06:05:07,674 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:08,385 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-01-10 06:05:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:05:08,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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 11 [2022-01-10 06:05:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:08,386 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:05:08,386 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:05:08,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=120, Unknown=2, NotChecked=50, Total=240 [2022-01-10 06:05:08,387 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:08,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 81 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 73 Invalid, 0 Unknown, 62 Unchecked, 0.6s Time] [2022-01-10 06:05:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:05:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 34. [2022-01-10 06:05:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 06:05:08,392 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-01-10 06:05:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:08,392 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 06:05:08,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 06:05:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:08,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:08,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:08,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 06:05:08,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:08,601 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1674631615, now seen corresponding path program 1 times [2022-01-10 06:05:08,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:08,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088643977] [2022-01-10 06:05:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:08,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:08,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:05:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:08,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:05:08,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:08,667 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 13 treesize of output 9 [2022-01-10 06:05:08,729 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 19 treesize of output 7 [2022-01-10 06:05:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:08,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:08,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:08,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088643977] [2022-01-10 06:05:08,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088643977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:08,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:08,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:08,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777868500] [2022-01-10 06:05:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:08,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:08,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:08,745 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:08,972 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-01-10 06:05:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:08,974 INFO L225 Difference]: With dead ends: 67 [2022-01-10 06:05:08,974 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 06:05:08,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:08,975 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:08,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 06:05:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-01-10 06:05:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-01-10 06:05:08,980 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 13 [2022-01-10 06:05:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:08,980 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-01-10 06:05:08,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-01-10 06:05:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:08,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:08,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:08,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:09,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:09,188 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2053285582, now seen corresponding path program 2 times [2022-01-10 06:05:09,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:09,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705223715] [2022-01-10 06:05:09,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:05:09,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:09,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:09,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:05:09,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:05:09,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:05:09,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 06:05:09,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:09,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:05:09,462 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 13 treesize of output 9 [2022-01-10 06:05:09,505 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:05:09,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-01-10 06:05:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:09,517 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:09,521 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 16 treesize of output 18 [2022-01-10 06:05:09,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:09,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:09,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 06:05:09,604 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:05:09,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-01-10 06:05:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:09,710 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:05:09,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-01-10 06:05:09,743 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 06:05:09,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-01-10 06:05:09,812 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 06:05:09,812 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 2 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 06:05:09,819 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 8 treesize of output 7 [2022-01-10 06:05:09,842 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 7 treesize of output 3 [2022-01-10 06:05:09,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:05:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:09,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:09,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:09,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:05:10,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_238 (Array (_ BitVec 64) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_238) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))))) is different from false [2022-01-10 06:05:10,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_238 (Array (_ BitVec 64) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_236) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_238) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_36|))))) is different from false [2022-01-10 06:05:10,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_37| (_ BitVec 64)) (v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_231 (_ BitVec 1)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_238 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_37|)) (_ bv0 1))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_231) |v_ULTIMATE.start_main_~end~0#1.base_36|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_232) |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_236) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_238) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:10,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_37| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_38| (_ BitVec 64)) (v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_231 (_ BitVec 1)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_238 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_230 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_38| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_38|))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_230)) |v_ULTIMATE.start_main_~end~0#1.base_38| v_ArrVal_232) |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_236) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_238) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (not (= (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_231) |v_ULTIMATE.start_main_~end~0#1.base_36|) (_ bv0 1))) (not (= (bvneg (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_37|)) (_ bv0 1)))))) is different from false [2022-01-10 06:05:10,622 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 06:05:10,622 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 2 case distinctions, treesize of input 30 treesize of output 1 [2022-01-10 06:05:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-10 06:05:10,624 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:10,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705223715] [2022-01-10 06:05:10,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705223715] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:10,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:10,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-10 06:05:10,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890995145] [2022-01-10 06:05:10,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:10,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 06:05:10,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:10,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 06:05:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=81, Unknown=4, NotChecked=84, Total=210 [2022-01-10 06:05:10,625 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:11,720 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-01-10 06:05:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 06:05:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:11,723 INFO L225 Difference]: With dead ends: 86 [2022-01-10 06:05:11,723 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 06:05:11,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=243, Unknown=4, NotChecked=148, Total=506 [2022-01-10 06:05:11,724 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:11,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 167 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 107 Invalid, 0 Unknown, 171 Unchecked, 0.8s Time] [2022-01-10 06:05:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 06:05:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 44. [2022-01-10 06:05:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-01-10 06:05:11,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 13 [2022-01-10 06:05:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:11,729 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-01-10 06:05:11,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-01-10 06:05:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:11,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:11,729 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:11,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 06:05:11,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:11,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1848654704, now seen corresponding path program 1 times [2022-01-10 06:05:11,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088189502] [2022-01-10 06:05:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:11,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:11,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:05:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:12,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-10 06:05:12,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:12,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:05:12,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:05:12,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:12,194 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:12,209 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:05:12,210 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 16 treesize of output 22 [2022-01-10 06:05:12,217 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 7 treesize of output 3 [2022-01-10 06:05:12,245 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:05:12,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-01-10 06:05:12,289 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 16 treesize of output 18 [2022-01-10 06:05:12,327 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 06:05:12,327 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 2 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 06:05:12,346 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 7 treesize of output 3 [2022-01-10 06:05:12,386 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:05:12,386 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 14 treesize of output 14 [2022-01-10 06:05:12,451 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 06:05:12,451 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 2 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 06:05:12,458 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 8 treesize of output 7 [2022-01-10 06:05:12,496 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 06:05:12,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:05:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:12,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:12,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:12,657 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:05:12,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 64)) (v_arrayElimArr_8 (Array (_ BitVec 64) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv8 64)))))) is different from false [2022-01-10 06:05:12,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_45| (_ BitVec 64)) (v_arrayElimArr_8 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_45|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv8 64)))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_332) |v_ULTIMATE.start_main_~end~0#1.base_45| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:12,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_328 (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_45| (_ BitVec 64)) (v_ArrVal_326 (_ BitVec 1)) (v_ArrVal_325 (_ BitVec 64)) (v_arrayElimArr_8 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_325))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv8 64)))) (not (= (_ bv0 1) (select (store |c_#valid| v_ArrVal_325 v_ArrVal_326) |v_ULTIMATE.start_main_~end~0#1.base_45|))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_328)) v_ArrVal_325 v_ArrVal_332) |v_ULTIMATE.start_main_~end~0#1.base_45| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:13,003 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 06:05:13,004 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 2 case distinctions, treesize of input 27 treesize of output 1 [2022-01-10 06:05:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-10 06:05:13,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:13,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088189502] [2022-01-10 06:05:13,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088189502] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:13,006 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:13,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-01-10 06:05:13,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100988033] [2022-01-10 06:05:13,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:13,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 06:05:13,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:13,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 06:05:13,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=65, Unknown=3, NotChecked=54, Total=156 [2022-01-10 06:05:13,008 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:13,471 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-01-10 06:05:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:05:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:13,473 INFO L225 Difference]: With dead ends: 51 [2022-01-10 06:05:13,473 INFO L226 Difference]: Without dead ends: 49 [2022-01-10 06:05:13,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=107, Unknown=3, NotChecked=72, Total=240 [2022-01-10 06:05:13,473 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:13,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 55 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 59 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2022-01-10 06:05:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-10 06:05:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-01-10 06:05:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-10 06:05:13,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-01-10 06:05:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:13,477 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-10 06:05:13,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-10 06:05:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 06:05:13,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:13,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:13,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 06:05:13,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:13,687 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -761736198, now seen corresponding path program 1 times [2022-01-10 06:05:13,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:13,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521127404] [2022-01-10 06:05:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:13,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:13,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:05:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:13,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:05:13,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:13,811 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 19 treesize of output 7 [2022-01-10 06:05:13,823 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-10 06:05:13,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:13,823 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521127404] [2022-01-10 06:05:13,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521127404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:13,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:13,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:13,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169608664] [2022-01-10 06:05:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:13,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:13,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:13,825 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:13,984 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-01-10 06:05:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:05:13,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 06:05:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:13,985 INFO L225 Difference]: With dead ends: 46 [2022-01-10 06:05:13,985 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 06:05:13,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:05:13,986 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:13,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:05:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 06:05:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-01-10 06:05:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 06:05:13,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-01-10 06:05:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:13,998 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 06:05:13,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 06:05:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 06:05:13,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:13,999 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:14,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:14,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,206 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -270590612, now seen corresponding path program 1 times [2022-01-10 06:05:14,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647205122] [2022-01-10 06:05:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,207 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:14,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:05:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:14,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 06:05:14,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:14,286 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-10 06:05:14,286 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:05:14,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,291 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 16 treesize of output 17 [2022-01-10 06:05:14,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:05:14,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:05:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647205122] [2022-01-10 06:05:14,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647205122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:14,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:14,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-01-10 06:05:14,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164750658] [2022-01-10 06:05:14,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:14,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:14,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:14,456 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-10 06:05:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:14,681 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-10 06:05:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-10 06:05:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:14,682 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:05:14,682 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:05:14,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:14,683 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:14,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:05:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 06:05:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-10 06:05:14,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-01-10 06:05:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:14,686 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-10 06:05:14,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-10 06:05:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-10 06:05:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:05:14,686 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:14,686 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:14,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:14,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,887 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:14,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1451772591, now seen corresponding path program 1 times [2022-01-10 06:05:14,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080302989] [2022-01-10 06:05:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,888 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,889 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:14,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:05:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:15,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-10 06:05:15,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:15,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:05:15,080 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:15,097 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:05:15,098 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 14 treesize of output 20 [2022-01-10 06:05:15,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 06:05:15,133 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:05:15,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-01-10 06:05:15,144 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:15,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:05:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,244 INFO L353 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-01-10 06:05:15,244 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2022-01-10 06:05:15,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-01-10 06:05:15,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-01-10 06:05:15,270 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 12 treesize of output 11 [2022-01-10 06:05:15,291 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-01-10 06:05:15,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-01-10 06:05:15,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-10 06:05:15,680 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:05:15,680 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 60 treesize of output 23 [2022-01-10 06:05:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:15,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:15,813 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:15,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 44 [2022-01-10 06:05:15,822 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:15,823 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-01-10 06:05:15,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimArr_12 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_489 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_486 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (_ bv0 64) .cse0) (not (= (_ bv0 1) (bvneg (select |c_#valid| .cse0)))) (not (= (_ bv0 64) (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (not (= (_ bv0 64) (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_12) .cse0 v_ArrVal_489))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2022-01-10 06:05:15,941 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:15,941 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 64 treesize of output 65 [2022-01-10 06:05:15,953 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:15,954 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 56 treesize of output 49 [2022-01-10 06:05:16,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1525 treesize of output 1126 [2022-01-10 06:05:16,236 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,236 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 2187 treesize of output 2122 [2022-01-10 06:05:16,287 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 2107 treesize of output 2035 [2022-01-10 06:05:16,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,336 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 2041 treesize of output 2011 [2022-01-10 06:05:16,516 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1561 treesize of output 1521 [2022-01-10 06:05:16,916 INFO L353 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2022-01-10 06:05:16,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1952 treesize of output 1716