./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:35:11,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:35:11,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:35:11,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:35:11,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:35:11,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:35:11,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:35:11,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:35:11,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:35:11,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:35:11,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:35:11,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:35:11,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:35:11,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:35:11,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:35:11,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:35:11,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:35:11,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:35:11,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:35:11,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:35:11,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:35:11,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:35:11,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:35:11,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:35:11,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:35:11,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:35:11,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:35:11,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:35:11,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:35:11,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:35:11,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:35:11,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:35:11,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:35:11,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:35:11,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:35:11,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:35:11,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:35:11,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:35:11,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:35:11,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:35:11,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:35:11,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:35:11,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:35:11,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:35:11,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:35:11,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:35:11,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:35:11,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:35:11,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:35:11,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:35:11,888 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:35:11,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:35:11,889 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:35:11,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:35:11,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:35:11,890 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:35:11,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:35:11,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:35:11,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:35:11,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:35:11,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:35:11,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:35:11,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:35:11,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:35:11,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2021-12-14 13:35:12,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:35:12,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:35:12,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:35:12,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:35:12,126 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:35:12,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-14 13:35:12,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23292e592/02f18a40f9844bfbb9627d5797667be8/FLAG2bae64548 [2021-12-14 13:35:12,604 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:35:12,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-14 13:35:12,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23292e592/02f18a40f9844bfbb9627d5797667be8/FLAG2bae64548 [2021-12-14 13:35:12,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23292e592/02f18a40f9844bfbb9627d5797667be8 [2021-12-14 13:35:12,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:35:12,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:35:12,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:35:12,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:35:12,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:35:12,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:12,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a274143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12, skipping insertion in model container [2021-12-14 13:35:12,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:12,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:35:12,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:35:12,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2021-12-14 13:35:12,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:35:12,875 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:35:12,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2021-12-14 13:35:12,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:35:12,953 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:35:12,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12 WrapperNode [2021-12-14 13:35:12,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:35:12,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:35:12,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:35:12,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:35:12,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:12,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:12,995 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2021-12-14 13:35:12,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:35:12,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:35:12,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:35:12,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:35:13,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:35:13,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:35:13,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:35:13,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:35:13,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2021-12-14 13:35:13,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:35:13,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:13,072 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) [2021-12-14 13:35:13,077 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 [2021-12-14 13:35:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:35:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-12-14 13:35:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-12-14 13:35:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-14 13:35:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-14 13:35:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:35:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:35:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:35:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:35:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:35:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:35:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:35:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:35:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:35:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:35:13,223 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:35:13,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:35:13,503 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:35:13,507 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:35:13,515 INFO L301 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-14 13:35:13,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:13 BoogieIcfgContainer [2021-12-14 13:35:13,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:35:13,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:35:13,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:35:13,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:35:13,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:35:12" (1/3) ... [2021-12-14 13:35:13,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb38dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:13, skipping insertion in model container [2021-12-14 13:35:13,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (2/3) ... [2021-12-14 13:35:13,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb38dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:13, skipping insertion in model container [2021-12-14 13:35:13,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:13" (3/3) ... [2021-12-14 13:35:13,526 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2021-12-14 13:35:13,529 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:35:13,536 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:35:13,578 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:35:13,584 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 [2021-12-14 13:35:13,585 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:35:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 13:35:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 13:35:13,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:13,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:13,646 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2021-12-14 13:35:13,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373885586] [2021-12-14 13:35:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:13,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:13,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:13,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373885586] [2021-12-14 13:35:13,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373885586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:13,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:13,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:35:13,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319784678] [2021-12-14 13:35:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:13,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:35:13,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:35:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:35:13,769 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:13,804 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2021-12-14 13:35:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:35:13,806 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 13:35:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:13,819 INFO L225 Difference]: With dead ends: 188 [2021-12-14 13:35:13,819 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 13:35:13,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:35:13,827 INFO L933 BasicCegarLoop]: 119 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, 119 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 [2021-12-14 13:35:13,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 13:35:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-14 13:35:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2021-12-14 13:35:13,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2021-12-14 13:35:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:13,875 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2021-12-14 13:35:13,876 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2021-12-14 13:35:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:35:13,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:13,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:13,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:35:13,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2021-12-14 13:35:13,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:13,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81649852] [2021-12-14 13:35:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:13,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:13,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:13,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81649852] [2021-12-14 13:35:13,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81649852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:13,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:13,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:35:13,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474611542] [2021-12-14 13:35:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:13,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:35:13,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:35:13,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:35:13,926 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:13,962 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2021-12-14 13:35:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:35:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 13:35:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:13,965 INFO L225 Difference]: With dead ends: 172 [2021-12-14 13:35:13,965 INFO L226 Difference]: Without dead ends: 93 [2021-12-14 13:35:13,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:35:13,969 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:13,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-14 13:35:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-12-14 13:35:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2021-12-14 13:35:13,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2021-12-14 13:35:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:13,978 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2021-12-14 13:35:13,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2021-12-14 13:35:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:35:13,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:13,980 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:13,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:35:13,980 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2021-12-14 13:35:13,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145080070] [2021-12-14 13:35:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:13,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:14,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:14,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145080070] [2021-12-14 13:35:14,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145080070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:14,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:14,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:35:14,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500578891] [2021-12-14 13:35:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:14,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:35:14,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:14,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:35:14,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:35:14,096 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:14,210 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2021-12-14 13:35:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:35:14,211 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 13:35:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:14,215 INFO L225 Difference]: With dead ends: 235 [2021-12-14 13:35:14,215 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 13:35:14,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:35:14,216 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:14,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 13:35:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2021-12-14 13:35:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2021-12-14 13:35:14,237 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2021-12-14 13:35:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:14,237 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2021-12-14 13:35:14,237 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2021-12-14 13:35:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:35:14,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:14,238 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:14,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:35:14,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2021-12-14 13:35:14,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281812681] [2021-12-14 13:35:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:14,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:14,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281812681] [2021-12-14 13:35:14,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281812681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:14,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:14,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:35:14,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339193574] [2021-12-14 13:35:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:14,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:35:14,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:35:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:35:14,344 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:14,445 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2021-12-14 13:35:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:35:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 13:35:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:14,447 INFO L225 Difference]: With dead ends: 94 [2021-12-14 13:35:14,447 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 13:35:14,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:14,467 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:14,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 319 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 13:35:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-14 13:35:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2021-12-14 13:35:14,473 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2021-12-14 13:35:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:14,473 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2021-12-14 13:35:14,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2021-12-14 13:35:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:35:14,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:14,474 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:14,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:35:14,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2021-12-14 13:35:14,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135546281] [2021-12-14 13:35:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:14,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:14,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:14,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135546281] [2021-12-14 13:35:14,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135546281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:14,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:14,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:35:14,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237278515] [2021-12-14 13:35:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:14,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:35:14,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:35:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:35:14,550 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:14,662 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2021-12-14 13:35:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:35:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 13:35:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:14,664 INFO L225 Difference]: With dead ends: 118 [2021-12-14 13:35:14,664 INFO L226 Difference]: Without dead ends: 115 [2021-12-14 13:35:14,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:14,669 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:14,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-14 13:35:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2021-12-14 13:35:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2021-12-14 13:35:14,681 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2021-12-14 13:35:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:14,682 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2021-12-14 13:35:14,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2021-12-14 13:35:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:35:14,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:14,683 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:14,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:35:14,684 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2021-12-14 13:35:14,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:14,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022963268] [2021-12-14 13:35:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:14,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:14,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:14,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022963268] [2021-12-14 13:35:14,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022963268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:14,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:14,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:35:14,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666530051] [2021-12-14 13:35:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:14,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:14,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:14,760 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:14,920 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2021-12-14 13:35:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:35:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:35:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:14,922 INFO L225 Difference]: With dead ends: 195 [2021-12-14 13:35:14,923 INFO L226 Difference]: Without dead ends: 192 [2021-12-14 13:35:14,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:35:14,924 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 348 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:14,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-14 13:35:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2021-12-14 13:35:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-14 13:35:14,934 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2021-12-14 13:35:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:14,935 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-14 13:35:14,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-14 13:35:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:35:14,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:14,935 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:14,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:35:14,935 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2021-12-14 13:35:14,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115580531] [2021-12-14 13:35:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:14,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:14,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:14,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115580531] [2021-12-14 13:35:14,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115580531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:14,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:14,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:35:14,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539738470] [2021-12-14 13:35:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:14,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:14,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:14,996 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:15,150 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2021-12-14 13:35:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:35:15,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:35:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:15,152 INFO L225 Difference]: With dead ends: 194 [2021-12-14 13:35:15,152 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 13:35:15,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:35:15,153 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 345 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:15,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 13:35:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2021-12-14 13:35:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2021-12-14 13:35:15,165 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2021-12-14 13:35:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:15,166 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2021-12-14 13:35:15,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2021-12-14 13:35:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:35:15,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:15,167 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:15,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 13:35:15,167 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2021-12-14 13:35:15,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:15,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495877476] [2021-12-14 13:35:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:15,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:15,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:15,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495877476] [2021-12-14 13:35:15,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495877476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:15,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:15,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:35:15,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241442541] [2021-12-14 13:35:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:15,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:35:15,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:35:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:35:15,266 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:15,548 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2021-12-14 13:35:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:35:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:35:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:15,552 INFO L225 Difference]: With dead ends: 264 [2021-12-14 13:35:15,552 INFO L226 Difference]: Without dead ends: 261 [2021-12-14 13:35:15,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:15,553 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 527 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:15,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:35:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-14 13:35:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2021-12-14 13:35:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2021-12-14 13:35:15,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2021-12-14 13:35:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:15,570 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2021-12-14 13:35:15,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2021-12-14 13:35:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:35:15,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:15,576 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:15,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 13:35:15,577 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2021-12-14 13:35:15,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:15,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719293331] [2021-12-14 13:35:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:15,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:15,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719293331] [2021-12-14 13:35:15,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719293331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:15,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:15,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:35:15,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261278103] [2021-12-14 13:35:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:15,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:35:15,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:15,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:35:15,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:35:15,702 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:15,975 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2021-12-14 13:35:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:35:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:35:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:15,976 INFO L225 Difference]: With dead ends: 263 [2021-12-14 13:35:15,976 INFO L226 Difference]: Without dead ends: 260 [2021-12-14 13:35:15,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:15,977 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 523 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:15,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:35:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-14 13:35:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2021-12-14 13:35:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 105 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-12-14 13:35:15,983 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2021-12-14 13:35:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:15,984 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-12-14 13:35:15,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-12-14 13:35:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 13:35:15,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:15,985 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:15,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 13:35:15,985 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2021-12-14 13:35:15,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534580614] [2021-12-14 13:35:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:15,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:16,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:16,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534580614] [2021-12-14 13:35:16,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534580614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:16,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352297001] [2021-12-14 13:35:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:16,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:16,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:16,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:35:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:16,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:35:16,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:16,308 INFO L388 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 31 treesize of output 19 [2021-12-14 13:35:16,311 INFO L388 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 25 treesize of output 13 [2021-12-14 13:35:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:16,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:16,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352297001] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:16,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:16,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 13:35:16,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845067424] [2021-12-14 13:35:16,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:16,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:16,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:16,474 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:16,579 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-12-14 13:35:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:35:16,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 13:35:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:16,580 INFO L225 Difference]: With dead ends: 110 [2021-12-14 13:35:16,580 INFO L226 Difference]: Without dead ends: 106 [2021-12-14 13:35:16,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:35:16,581 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 84 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:16,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-14 13:35:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-14 13:35:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2021-12-14 13:35:16,596 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2021-12-14 13:35:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:16,596 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2021-12-14 13:35:16,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2021-12-14 13:35:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 13:35:16,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:16,597 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:16,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:16,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 13:35:16,807 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2021-12-14 13:35:16,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137201940] [2021-12-14 13:35:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:16,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:16,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137201940] [2021-12-14 13:35:16,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137201940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:16,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:16,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:35:16,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592565930] [2021-12-14 13:35:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:16,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:16,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:16,849 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:16,892 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2021-12-14 13:35:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:35:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 13:35:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:16,893 INFO L225 Difference]: With dead ends: 146 [2021-12-14 13:35:16,893 INFO L226 Difference]: Without dead ends: 143 [2021-12-14 13:35:16,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:35:16,894 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 271 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:16,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 325 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-14 13:35:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2021-12-14 13:35:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 107 states have internal predecessors, (118), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-12-14 13:35:16,901 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2021-12-14 13:35:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:16,901 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-12-14 13:35:16,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-12-14 13:35:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 13:35:16,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:16,902 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:16,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 13:35:16,902 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2021-12-14 13:35:16,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:16,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472930614] [2021-12-14 13:35:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:16,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:17,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:17,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472930614] [2021-12-14 13:35:17,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472930614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:17,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942157795] [2021-12-14 13:35:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:17,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:17,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:17,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:17,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:35:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 13:35:17,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:17,293 INFO L388 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 [2021-12-14 13:35:17,298 INFO L388 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 [2021-12-14 13:35:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:17,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:35:17,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942157795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:17,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:35:17,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2021-12-14 13:35:17,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869557230] [2021-12-14 13:35:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:17,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:35:17,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:35:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-14 13:35:17,306 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:17,550 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2021-12-14 13:35:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:35:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-14 13:35:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:17,551 INFO L225 Difference]: With dead ends: 199 [2021-12-14 13:35:17,551 INFO L226 Difference]: Without dead ends: 196 [2021-12-14 13:35:17,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:35:17,552 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 344 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:17,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 521 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:35:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-14 13:35:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 119. [2021-12-14 13:35:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 116 states have internal predecessors, (128), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2021-12-14 13:35:17,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 36 [2021-12-14 13:35:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:17,564 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2021-12-14 13:35:17,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2021-12-14 13:35:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 13:35:17,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:17,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:17,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:17,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 13:35:17,772 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2021-12-14 13:35:17,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:17,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712567864] [2021-12-14 13:35:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:17,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:35:17,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712567864] [2021-12-14 13:35:17,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712567864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:17,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145111139] [2021-12-14 13:35:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:17,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:17,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:17,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:35:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-14 13:35:17,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:17,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:17,996 INFO L388 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 [2021-12-14 13:35:18,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:18,002 INFO L388 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 [2021-12-14 13:35:18,061 INFO L388 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 [2021-12-14 13:35:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:35:18,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:35:18,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145111139] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:18,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:18,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2021-12-14 13:35:18,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203782994] [2021-12-14 13:35:18,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:18,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:35:18,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:35:18,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:18,193 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:18,448 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2021-12-14 13:35:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:35:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 13:35:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:18,449 INFO L225 Difference]: With dead ends: 299 [2021-12-14 13:35:18,450 INFO L226 Difference]: Without dead ends: 214 [2021-12-14 13:35:18,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:35:18,451 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 234 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:18,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 546 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:35:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-14 13:35:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2021-12-14 13:35:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 127 states have internal predecessors, (140), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2021-12-14 13:35:18,461 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 38 [2021-12-14 13:35:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:18,461 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2021-12-14 13:35:18,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2021-12-14 13:35:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 13:35:18,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:18,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:18,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:18,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:18,679 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2021-12-14 13:35:18,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54373958] [2021-12-14 13:35:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:18,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:18,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:18,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54373958] [2021-12-14 13:35:18,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54373958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:18,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:18,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:35:18,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616855981] [2021-12-14 13:35:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:18,722 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:18,782 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2021-12-14 13:35:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:35:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 13:35:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:18,784 INFO L225 Difference]: With dead ends: 238 [2021-12-14 13:35:18,784 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 13:35:18,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:35:18,785 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 347 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:18,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 380 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 13:35:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2021-12-14 13:35:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.184873949579832) internal successors, (141), 128 states have internal predecessors, (141), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2021-12-14 13:35:18,793 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 38 [2021-12-14 13:35:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:18,793 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2021-12-14 13:35:18,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2021-12-14 13:35:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:35:18,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:18,794 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:18,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 13:35:18,794 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2021-12-14 13:35:18,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:18,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355749729] [2021-12-14 13:35:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:18,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:18,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:18,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355749729] [2021-12-14 13:35:18,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355749729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:18,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:18,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:35:18,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951425172] [2021-12-14 13:35:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:18,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:35:18,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:35:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:35:18,836 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:19,018 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2021-12-14 13:35:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:35:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 13:35:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:19,023 INFO L225 Difference]: With dead ends: 165 [2021-12-14 13:35:19,023 INFO L226 Difference]: Without dead ends: 162 [2021-12-14 13:35:19,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:19,024 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 239 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:19,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 331 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-14 13:35:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2021-12-14 13:35:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.184) internal successors, (148), 134 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:35:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2021-12-14 13:35:19,034 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 39 [2021-12-14 13:35:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:19,034 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2021-12-14 13:35:19,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2021-12-14 13:35:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:35:19,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:19,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:19,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 13:35:19,035 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2021-12-14 13:35:19,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:19,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305160565] [2021-12-14 13:35:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:19,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:19,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:19,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305160565] [2021-12-14 13:35:19,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305160565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:19,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:19,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 13:35:19,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191546171] [2021-12-14 13:35:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:19,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:35:19,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:35:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:35:19,100 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:19,333 INFO L93 Difference]: Finished difference Result 316 states and 415 transitions. [2021-12-14 13:35:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 13:35:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 13:35:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:19,335 INFO L225 Difference]: With dead ends: 316 [2021-12-14 13:35:19,335 INFO L226 Difference]: Without dead ends: 275 [2021-12-14 13:35:19,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-14 13:35:19,336 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 715 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:19,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 744 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-14 13:35:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 156. [2021-12-14 13:35:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2021-12-14 13:35:19,347 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 39 [2021-12-14 13:35:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:19,347 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2021-12-14 13:35:19,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2021-12-14 13:35:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 13:35:19,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:19,348 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:19,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 13:35:19,348 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2021-12-14 13:35:19,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:19,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108301542] [2021-12-14 13:35:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:19,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:19,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108301542] [2021-12-14 13:35:19,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108301542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963352477] [2021-12-14 13:35:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:19,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:19,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:19,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:35:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:19,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 13:35:19,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:19,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:19,545 INFO L388 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 [2021-12-14 13:35:19,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:19,549 INFO L388 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 [2021-12-14 13:35:19,646 INFO L388 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 [2021-12-14 13:35:19,648 INFO L388 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 [2021-12-14 13:35:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:19,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:19,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963352477] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:19,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:19,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2021-12-14 13:35:19,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338884732] [2021-12-14 13:35:19,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:19,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 13:35:19,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 13:35:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:35:19,776 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:19,853 INFO L93 Difference]: Finished difference Result 249 states and 306 transitions. [2021-12-14 13:35:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:35:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-14 13:35:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:19,855 INFO L225 Difference]: With dead ends: 249 [2021-12-14 13:35:19,855 INFO L226 Difference]: Without dead ends: 188 [2021-12-14 13:35:19,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:35:19,856 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:19,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-14 13:35:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2021-12-14 13:35:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 167 states have internal predecessors, (187), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2021-12-14 13:35:19,865 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 42 [2021-12-14 13:35:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:19,865 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2021-12-14 13:35:19,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2021-12-14 13:35:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 13:35:19,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:19,866 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:19,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:20,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 13:35:20,080 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2021-12-14 13:35:20,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:20,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162477962] [2021-12-14 13:35:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:20,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:20,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162477962] [2021-12-14 13:35:20,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162477962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220073177] [2021-12-14 13:35:20,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:35:20,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:20,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:20,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:35:20,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:35:20,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:35:20,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-14 13:35:20,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:20,370 INFO L388 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 [2021-12-14 13:35:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:20,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:35:20,425 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:35:20,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:35:20,457 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:35:20,458 INFO L388 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 [2021-12-14 13:35:20,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 13:35:20,502 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 13:35:20,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-12-14 13:35:20,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:20,508 INFO L388 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 [2021-12-14 13:35:20,664 INFO L388 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 [2021-12-14 13:35:20,780 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-14 13:35:20,780 INFO L388 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 38 treesize of output 15 [2021-12-14 13:35:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:20,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:21,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (v_ArrVal_594 Int) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_594) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)))) is different from false [2021-12-14 13:35:21,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (v_ArrVal_594 Int) (|v_ULTIMATE.start_main_~node~1#1.base_11| Int) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11| v_ArrVal_587) |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_11| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_594) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2021-12-14 13:35:21,889 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-14 13:35:21,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2021-12-14 13:35:21,898 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:21,899 INFO L388 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 335 treesize of output 325 [2021-12-14 13:35:21,905 INFO L388 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 726 treesize of output 702 [2021-12-14 13:35:22,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2021-12-14 13:35:22,128 INFO L388 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 28 treesize of output 26 [2021-12-14 13:35:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 13:35:22,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220073177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:22,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:22,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2021-12-14 13:35:22,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358753184] [2021-12-14 13:35:22,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:22,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:35:22,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:35:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=490, Unknown=2, NotChecked=90, Total=650 [2021-12-14 13:35:22,138 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:23,068 INFO L93 Difference]: Finished difference Result 351 states and 437 transitions. [2021-12-14 13:35:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 13:35:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-14 13:35:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:23,070 INFO L225 Difference]: With dead ends: 351 [2021-12-14 13:35:23,070 INFO L226 Difference]: Without dead ends: 348 [2021-12-14 13:35:23,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=962, Unknown=4, NotChecked=134, Total=1332 [2021-12-14 13:35:23,071 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 920 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:23,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1435 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 623 Invalid, 0 Unknown, 824 Unchecked, 0.4s Time] [2021-12-14 13:35:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-14 13:35:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 181. [2021-12-14 13:35:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 178 states have internal predecessors, (199), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2021-12-14 13:35:23,087 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 44 [2021-12-14 13:35:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:23,087 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2021-12-14 13:35:23,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2021-12-14 13:35:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 13:35:23,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:23,088 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:23,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:23,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 13:35:23,304 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2021-12-14 13:35:23,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616467683] [2021-12-14 13:35:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:23,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:23,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616467683] [2021-12-14 13:35:23,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616467683] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977506405] [2021-12-14 13:35:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:23,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:23,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:23,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:35:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:23,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-14 13:35:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:23,636 INFO L388 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 [2021-12-14 13:35:23,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:23,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:35:23,676 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:35:23,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 13:35:23,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 13:35:23,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:23,734 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 13:35:23,734 INFO L388 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 1 case distinctions, treesize of input 25 treesize of output 32 [2021-12-14 13:35:23,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:23,747 INFO L388 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 [2021-12-14 13:35:23,970 INFO L388 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 [2021-12-14 13:35:24,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:24,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2021-12-14 13:35:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:24,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:25,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2021-12-14 13:35:25,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2021-12-14 13:35:25,290 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-14 13:35:25,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2021-12-14 13:35:25,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:25,297 INFO L388 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 319 treesize of output 309 [2021-12-14 13:35:25,305 INFO L388 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 670 treesize of output 646 [2021-12-14 13:35:25,408 INFO L388 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 159 treesize of output 155 [2021-12-14 13:35:25,444 INFO L388 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 65 treesize of output 59 [2021-12-14 13:35:25,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 13:35:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 13:35:25,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977506405] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:25,535 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:25,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2021-12-14 13:35:25,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248880014] [2021-12-14 13:35:25,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:25,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 13:35:25,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 13:35:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=440, Unknown=2, NotChecked=86, Total=600 [2021-12-14 13:35:25,537 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:25,592 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1)) is different from false [2021-12-14 13:35:25,598 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2021-12-14 13:35:26,616 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2021-12-14 13:35:26,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse3 (select .cse1 .cse4))) (and (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= (select .cse1 0) 0)) (not (= .cse2 0)) (not (= .cse3 .cse2)) (not (= (select (select |c_#memory_$Pointer$.base| .cse3) 0) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse4))))) is different from false [2021-12-14 13:35:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:27,130 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2021-12-14 13:35:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 13:35:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-14 13:35:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:27,136 INFO L225 Difference]: With dead ends: 221 [2021-12-14 13:35:27,136 INFO L226 Difference]: Without dead ends: 218 [2021-12-14 13:35:27,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=197, Invalid=877, Unknown=6, NotChecked=402, Total=1482 [2021-12-14 13:35:27,137 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 524 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:27,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 1193 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 499 Invalid, 0 Unknown, 361 Unchecked, 0.3s Time] [2021-12-14 13:35:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-14 13:35:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 188. [2021-12-14 13:35:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 185 states have internal predecessors, (206), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2021-12-14 13:35:27,148 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 44 [2021-12-14 13:35:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:27,148 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2021-12-14 13:35:27,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2021-12-14 13:35:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 13:35:27,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:27,149 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:27,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 13:35:27,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:27,360 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2021-12-14 13:35:27,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:27,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22553567] [2021-12-14 13:35:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:27,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:27,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22553567] [2021-12-14 13:35:27,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22553567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:27,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:27,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:35:27,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58633085] [2021-12-14 13:35:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:27,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:35:27,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:27,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:35:27,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:35:27,394 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:27,449 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2021-12-14 13:35:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:35:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-14 13:35:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:27,451 INFO L225 Difference]: With dead ends: 190 [2021-12-14 13:35:27,451 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 13:35:27,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:27,452 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:27,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 13:35:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-14 13:35:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 150 states have internal predecessors, (167), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2021-12-14 13:35:27,461 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2021-12-14 13:35:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:27,461 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2021-12-14 13:35:27,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2021-12-14 13:35:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 13:35:27,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:27,462 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:27,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 13:35:27,463 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2021-12-14 13:35:27,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:27,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933814984] [2021-12-14 13:35:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:27,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:27,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933814984] [2021-12-14 13:35:27,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933814984] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920989462] [2021-12-14 13:35:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:27,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:27,878 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:27,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:35:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:27,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-14 13:35:27,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:28,039 INFO L388 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 [2021-12-14 13:35:28,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:28,081 INFO L388 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 [2021-12-14 13:35:28,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:28,086 INFO L388 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 [2021-12-14 13:35:28,132 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:35:28,133 INFO L388 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 [2021-12-14 13:35:28,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 13:35:28,193 INFO L388 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 [2021-12-14 13:35:28,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:28,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:28,272 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 13:35:28,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2021-12-14 13:35:28,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:28,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:28,288 INFO L354 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2021-12-14 13:35:28,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 49 [2021-12-14 13:35:29,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:29,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:29,449 INFO L354 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2021-12-14 13:35:29,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 129 treesize of output 80 [2021-12-14 13:35:29,473 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-14 13:35:29,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2021-12-14 13:35:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:29,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:32,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_833 Int)) (let ((.cse11 (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse10 (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_833) .cse11 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse9 (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse11 |c_ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| .cse9)) (.cse0 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| .cse10))) (let ((.cse7 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse3 .cse4) .cse5) 0) (= (select (select .cse0 .cse4) .cse5) 0))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select .cse7 .cse8) 0) (= (select .cse6 .cse8) 0))) (not (= (select (select .cse3 .cse1) .cse2) 0)))))))) is different from false [2021-12-14 13:35:32,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_833 Int) (v_ArrVal_830 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_830)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_829))) (let ((.cse9 (store (store (select .cse11 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.offset|) 4 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse10 (store (store (select .cse12 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_833) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse5 (store .cse12 |ULTIMATE.start_main_~item~0#1.base| .cse10)) (.cse0 (store .cse11 |ULTIMATE.start_main_~item~0#1.base| .cse9))) (let ((.cse1 (select .cse10 0)) (.cse2 (select .cse9 0)) (.cse6 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse7 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse3) .cse4) 0) (= (select (select .cse5 .cse3) .cse4) 0))) (not (= 0 (select (select .cse5 .cse1) .cse2))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select .cse6 .cse8) 0) (= (select .cse7 .cse8) 0))))))))) is different from false [2021-12-14 13:35:33,782 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-14 13:35:33,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 601 treesize of output 463 [2021-12-14 13:35:33,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:33,792 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:33,793 INFO L388 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 445 treesize of output 307 [2021-12-14 13:35:33,976 INFO L354 Elim1Store]: treesize reduction 184, result has 47.6 percent of original size [2021-12-14 13:35:33,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 4657 treesize of output 4527 [2021-12-14 13:35:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:34,287 INFO L354 Elim1Store]: treesize reduction 92, result has 72.7 percent of original size [2021-12-14 13:35:34,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 64167 treesize of output 59661 [2021-12-14 13:35:34,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:34,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:34,804 INFO L354 Elim1Store]: treesize reduction 16, result has 92.4 percent of original size [2021-12-14 13:35:34,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 154304 treesize of output 144132 [2021-12-14 13:35:38,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:38,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:38,437 INFO L354 Elim1Store]: treesize reduction 16, result has 92.4 percent of original size [2021-12-14 13:35:38,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 100579 treesize of output 96461 [2021-12-14 13:35:39,853 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 13:35:39,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:35:39,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-14 13:35:39,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949192761] [2021-12-14 13:35:39,854 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:39,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:35:39,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:39,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:35:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1075, Unknown=2, NotChecked=134, Total=1332 [2021-12-14 13:35:39,855 INFO L87 Difference]: Start difference. First operand 153 states and 182 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:41,665 INFO L93 Difference]: Finished difference Result 221 states and 272 transitions. [2021-12-14 13:35:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:35:41,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-14 13:35:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:41,666 INFO L225 Difference]: With dead ends: 221 [2021-12-14 13:35:41,666 INFO L226 Difference]: Without dead ends: 218 [2021-12-14 13:35:41,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=267, Invalid=1631, Unknown=2, NotChecked=170, Total=2070 [2021-12-14 13:35:41,667 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 763 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:41,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 508 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 13:35:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-14 13:35:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 156. [2021-12-14 13:35:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 153 states have internal predecessors, (170), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2021-12-14 13:35:41,677 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 47 [2021-12-14 13:35:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:41,677 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2021-12-14 13:35:41,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2021-12-14 13:35:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 13:35:41,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:41,678 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:41,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:41,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:41,894 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1117057733, now seen corresponding path program 1 times [2021-12-14 13:35:41,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:41,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329353703] [2021-12-14 13:35:41,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:41,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:42,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329353703] [2021-12-14 13:35:42,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329353703] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772315198] [2021-12-14 13:35:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:42,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:42,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:42,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:42,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:35:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:42,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-14 13:35:42,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:42,514 INFO L388 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 [2021-12-14 13:35:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,551 INFO L388 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 [2021-12-14 13:35:42,566 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:35:42,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:35:42,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:35:42,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2021-12-14 13:35:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-12-14 13:35:42,728 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-14 13:35:42,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-14 13:35:42,822 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:35:42,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 54 [2021-12-14 13:35:42,836 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-14 13:35:42,837 INFO L388 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 [2021-12-14 13:35:42,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-12-14 13:35:42,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,928 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:35:42,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 52 [2021-12-14 13:35:42,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:42,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2021-12-14 13:35:43,950 INFO L354 Elim1Store]: treesize reduction 133, result has 14.7 percent of original size [2021-12-14 13:35:43,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 181 treesize of output 114 [2021-12-14 13:35:43,984 INFO L354 Elim1Store]: treesize reduction 102, result has 6.4 percent of original size [2021-12-14 13:35:43,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 37 [2021-12-14 13:35:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:43,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:45,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 Int)) (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse6 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse7 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_955) .cse8 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| .cse7)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| .cse6)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse3) .cse4) 0) (= (select (select .cse5 .cse3) .cse4) 0))) (not (= (select (select .cse5 .cse1) .cse2) 0))))))) is different from false [2021-12-14 13:35:47,653 INFO L354 Elim1Store]: treesize reduction 139, result has 31.5 percent of original size [2021-12-14 13:35:47,654 INFO L388 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 4 case distinctions, treesize of input 976 treesize of output 669 [2021-12-14 13:35:47,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,712 INFO L354 Elim1Store]: treesize reduction 110, result has 33.3 percent of original size [2021-12-14 13:35:47,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 606 treesize of output 290 [2021-12-14 13:35:47,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,776 INFO L354 Elim1Store]: treesize reduction 88, result has 42.5 percent of original size [2021-12-14 13:35:47,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 1209 treesize of output 1179 [2021-12-14 13:35:47,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:47,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:47,833 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:47,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 2240 treesize of output 2112 [2021-12-14 13:35:47,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:47,879 INFO L354 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2021-12-14 13:35:47,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2970 treesize of output 2844 [2021-12-14 13:35:47,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:47,941 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:47,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2534 treesize of output 2496 [2021-12-14 13:35:48,013 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 13:35:48,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:35:48,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-14 13:35:48,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068339783] [2021-12-14 13:35:48,014 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:48,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 13:35:48,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:48,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 13:35:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1048, Unknown=6, NotChecked=66, Total=1260 [2021-12-14 13:35:48,015 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:49,725 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2021-12-14 13:35:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 13:35:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-14 13:35:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:49,728 INFO L225 Difference]: With dead ends: 220 [2021-12-14 13:35:49,728 INFO L226 Difference]: Without dead ends: 217 [2021-12-14 13:35:49,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=375, Invalid=1693, Unknown=6, NotChecked=88, Total=2162 [2021-12-14 13:35:49,729 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 804 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:49,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 521 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:35:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-14 13:35:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 159. [2021-12-14 13:35:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 156 states have internal predecessors, (173), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2021-12-14 13:35:49,744 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 47 [2021-12-14 13:35:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:49,744 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2021-12-14 13:35:49,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2021-12-14 13:35:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 13:35:49,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:49,744 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:49,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:49,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 13:35:49,958 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 814579079, now seen corresponding path program 2 times [2021-12-14 13:35:49,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:49,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259994541] [2021-12-14 13:35:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:49,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:50,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259994541] [2021-12-14 13:35:50,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259994541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833409746] [2021-12-14 13:35:50,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:35:50,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:50,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:50,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:35:50,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 13:35:50,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:35:50,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 13:35:50,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:50,305 INFO L388 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 [2021-12-14 13:35:50,308 INFO L388 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 [2021-12-14 13:35:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 13:35:50,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:35:50,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833409746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:50,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:35:50,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2021-12-14 13:35:50,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605996919] [2021-12-14 13:35:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:50,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:50,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-14 13:35:50,325 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:50,439 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2021-12-14 13:35:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:35:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-14 13:35:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:50,440 INFO L225 Difference]: With dead ends: 161 [2021-12-14 13:35:50,440 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 13:35:50,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:35:50,441 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:50,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 319 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:35:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 13:35:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2021-12-14 13:35:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.1968503937007875) internal successors, (152), 136 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2021-12-14 13:35:50,449 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 48 [2021-12-14 13:35:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:50,449 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2021-12-14 13:35:50,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2021-12-14 13:35:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 13:35:50,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:50,450 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:50,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:50,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:50,660 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 568067714, now seen corresponding path program 1 times [2021-12-14 13:35:50,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152153097] [2021-12-14 13:35:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:50,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:50,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:50,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152153097] [2021-12-14 13:35:50,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152153097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:50,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86884228] [2021-12-14 13:35:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:50,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:50,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:50,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:50,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:35:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:50,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 13:35:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:50,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:50,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:35:50,980 INFO L388 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 16 treesize of output 8 [2021-12-14 13:35:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:51,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:35:51,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86884228] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:35:51,101 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:35:51,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 20 [2021-12-14 13:35:51,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473206864] [2021-12-14 13:35:51,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:51,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 13:35:51,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 13:35:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-12-14 13:35:51,102 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:51,685 INFO L93 Difference]: Finished difference Result 265 states and 338 transitions. [2021-12-14 13:35:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 13:35:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-14 13:35:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:51,687 INFO L225 Difference]: With dead ends: 265 [2021-12-14 13:35:51,687 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 13:35:51,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 13:35:51,688 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 804 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:51,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 685 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:35:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 13:35:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2021-12-14 13:35:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 140 states have internal predecessors, (156), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2021-12-14 13:35:51,698 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 51 [2021-12-14 13:35:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:51,698 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2021-12-14 13:35:51,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 20 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2021-12-14 13:35:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 13:35:51,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:51,698 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:51,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:51,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 13:35:51,899 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 950662001, now seen corresponding path program 3 times [2021-12-14 13:35:51,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:51,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625950341] [2021-12-14 13:35:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:51,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:35:52,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625950341] [2021-12-14 13:35:52,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625950341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959421832] [2021-12-14 13:35:52,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:35:52,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:52,111 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:52,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 13:35:52,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 13:35:52,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:35:52,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 13:35:52,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:52,264 INFO L388 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 [2021-12-14 13:35:52,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:52,315 INFO L388 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 [2021-12-14 13:35:52,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:52,319 INFO L388 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 [2021-12-14 13:35:52,347 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:35:52,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:35:52,373 INFO L388 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 [2021-12-14 13:35:52,375 INFO L388 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 [2021-12-14 13:35:52,383 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:35:52,383 INFO L388 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 [2021-12-14 13:35:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:52,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2021-12-14 13:35:52,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:52,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 13:35:52,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:35:52,687 INFO L354 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2021-12-14 13:35:52,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 39 [2021-12-14 13:35:52,692 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:35:52,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2021-12-14 13:35:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:35:52,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:53,838 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1282 Int) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1282) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0)) (forall ((v_ArrVal_1283 Int) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1283) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0))) is different from false [2021-12-14 13:36:01,150 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-14 13:36:01,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-14 13:36:01,151 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-14 13:36:01,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:36:01,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-12-14 13:36:01,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645831671] [2021-12-14 13:36:01,151 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:36:01,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:36:01,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:36:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:36:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=446, Unknown=1, NotChecked=42, Total=552 [2021-12-14 13:36:01,152 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:36:01,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=446, Unknown=1, NotChecked=42, Total=552 [2021-12-14 13:36:01,152 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 1 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 [2021-12-14 13:36:01,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:36:01,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:01,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 13:36:01,354 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@76b6f613 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 13:36:01,356 INFO L158 Benchmark]: Toolchain (without parser) took 48721.70ms. Allocated memory was 96.5MB in the beginning and 434.1MB in the end (delta: 337.6MB). Free memory was 65.1MB in the beginning and 266.1MB in the end (delta: -201.1MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,356 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:36:01,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.00ms. Allocated memory is still 96.5MB. Free memory was 65.1MB in the beginning and 65.3MB in the end (delta: -208.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.32ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 62.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,357 INFO L158 Benchmark]: Boogie Preprocessor took 50.83ms. Allocated memory is still 96.5MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,357 INFO L158 Benchmark]: RCFGBuilder took 473.99ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 37.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,357 INFO L158 Benchmark]: TraceAbstraction took 47833.60ms. Allocated memory was 96.5MB in the beginning and 434.1MB in the end (delta: 337.6MB). Free memory was 36.5MB in the beginning and 266.1MB in the end (delta: -229.7MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2021-12-14 13:36:01,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.00ms. Allocated memory is still 96.5MB. Free memory was 65.1MB in the beginning and 65.3MB in the end (delta: -208.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.32ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 62.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.83ms. Allocated memory is still 96.5MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.99ms. Allocated memory is still 96.5MB. Free memory was 60.1MB in the beginning and 37.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 47833.60ms. Allocated memory was 96.5MB in the beginning and 434.1MB in the end (delta: 337.6MB). Free memory was 36.5MB in the beginning and 266.1MB in the end (delta: -229.7MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@76b6f613 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@76b6f613: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:36:02,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:36:02,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:36:02,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:36:02,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:36:02,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:36:02,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:36:02,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:36:02,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:36:02,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:36:02,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:36:02,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:36:02,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:36:02,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:36:02,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:36:02,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:36:02,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:36:02,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:36:02,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:36:02,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:36:02,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:36:02,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:36:02,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:36:02,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:36:02,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:36:02,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:36:02,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:36:02,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:36:02,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:36:02,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:36:02,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:36:02,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:36:02,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:36:02,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:36:02,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:36:02,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:36:02,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:36:02,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:36:02,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:36:02,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:36:02,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:36:02,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 13:36:02,817 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:36:02,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:36:02,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:36:02,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:36:02,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:36:02,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:36:02,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:36:02,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:36:02,820 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:36:02,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:36:02,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:36:02,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:36:02,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:36:02,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:36:02,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:36:02,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:36:02,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:36:02,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:36:02,829 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:36:02,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 13:36:02,830 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2021-12-14 13:36:03,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:36:03,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:36:03,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:36:03,104 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:36:03,107 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:36:03,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-14 13:36:03,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449f733d6/73a39cb4b0954de193a34c372d822059/FLAG33ca9025e [2021-12-14 13:36:03,490 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:36:03,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-14 13:36:03,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449f733d6/73a39cb4b0954de193a34c372d822059/FLAG33ca9025e [2021-12-14 13:36:03,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449f733d6/73a39cb4b0954de193a34c372d822059 [2021-12-14 13:36:03,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:36:03,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:36:03,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:36:03,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:36:03,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:36:03,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:36:03" (1/1) ... [2021-12-14 13:36:03,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562b2c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:03, skipping insertion in model container [2021-12-14 13:36:03,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:36:03" (1/1) ... [2021-12-14 13:36:03,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:36:03,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:36:04,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2021-12-14 13:36:04,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:36:04,150 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:36:04,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2021-12-14 13:36:04,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:36:04,209 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:36:04,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04 WrapperNode [2021-12-14 13:36:04,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:36:04,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:36:04,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:36:04,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:36:04,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,258 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 284 [2021-12-14 13:36:04,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:36:04,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:36:04,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:36:04,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:36:04,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:36:04,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:36:04,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:36:04,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:36:04,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (1/1) ... [2021-12-14 13:36:04,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:36:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:36:04,315 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) [2021-12-14 13:36:04,319 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 [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-12-14 13:36:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-14 13:36:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:36:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 13:36:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:36:04,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:36:04,512 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:36:04,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:36:04,953 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:36:04,958 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:36:04,958 INFO L301 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-14 13:36:04,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:36:04 BoogieIcfgContainer [2021-12-14 13:36:04,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:36:04,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:36:04,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:36:04,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:36:04,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:36:03" (1/3) ... [2021-12-14 13:36:04,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee7c40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:36:04, skipping insertion in model container [2021-12-14 13:36:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:36:04" (2/3) ... [2021-12-14 13:36:04,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee7c40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:36:04, skipping insertion in model container [2021-12-14 13:36:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:36:04" (3/3) ... [2021-12-14 13:36:04,965 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2021-12-14 13:36:04,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:36:04,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:36:05,011 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:36:05,018 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 [2021-12-14 13:36:05,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:36:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 13:36:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 13:36:05,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:05,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:05,038 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2116504326, now seen corresponding path program 1 times [2021-12-14 13:36:05,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:05,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206258537] [2021-12-14 13:36:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:05,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:05,062 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) [2021-12-14 13:36:05,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 13:36:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:05,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 13:36:05,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:05,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:05,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206258537] [2021-12-14 13:36:05,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206258537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:05,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:05,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:36:05,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504444710] [2021-12-14 13:36:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:05,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:36:05,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:36:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:36:05,196 INFO L87 Difference]: Start difference. First operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:05,226 INFO L93 Difference]: Finished difference Result 186 states and 333 transitions. [2021-12-14 13:36:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:36:05,229 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 13:36:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:05,235 INFO L225 Difference]: With dead ends: 186 [2021-12-14 13:36:05,235 INFO L226 Difference]: Without dead ends: 86 [2021-12-14 13:36:05,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:36:05,240 INFO L933 BasicCegarLoop]: 118 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, 118 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 [2021-12-14 13:36:05,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:36:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-14 13:36:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-14 13:36:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2021-12-14 13:36:05,269 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 7 [2021-12-14 13:36:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:05,269 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2021-12-14 13:36:05,269 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2021-12-14 13:36:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 13:36:05,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:05,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:05,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:05,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:05,474 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2099880948, now seen corresponding path program 1 times [2021-12-14 13:36:05,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:05,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680150956] [2021-12-14 13:36:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:05,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:05,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:05,477 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) [2021-12-14 13:36:05,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 13:36:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:05,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:36:05,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:05,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:05,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:05,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680150956] [2021-12-14 13:36:05,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680150956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:05,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:05,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:36:05,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697558769] [2021-12-14 13:36:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:05,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:36:05,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:36:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:36:05,555 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:05,583 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2021-12-14 13:36:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:36:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 13:36:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:05,589 INFO L225 Difference]: With dead ends: 170 [2021-12-14 13:36:05,589 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 13:36:05,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:36:05,591 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:05,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:36:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 13:36:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2021-12-14 13:36:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2021-12-14 13:36:05,601 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2021-12-14 13:36:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:05,602 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2021-12-14 13:36:05,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2021-12-14 13:36:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 13:36:05,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:05,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:05,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:05,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:05,813 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -404579866, now seen corresponding path program 1 times [2021-12-14 13:36:05,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:05,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762100329] [2021-12-14 13:36:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:05,815 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:05,817 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) [2021-12-14 13:36:05,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 13:36:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:05,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:36:05,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:05,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:05,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762100329] [2021-12-14 13:36:05,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762100329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:05,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:05,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:36:05,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541381865] [2021-12-14 13:36:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:05,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:36:05,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:36:05,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:36:05,945 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:06,112 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2021-12-14 13:36:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:36:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 13:36:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:06,117 INFO L225 Difference]: With dead ends: 235 [2021-12-14 13:36:06,118 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 13:36:06,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:36:06,120 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:06,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:36:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 13:36:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 90. [2021-12-14 13:36:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2021-12-14 13:36:06,135 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 12 [2021-12-14 13:36:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:06,136 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-12-14 13:36:06,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2021-12-14 13:36:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:36:06,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:06,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:06,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:06,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:06,349 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1696064914, now seen corresponding path program 1 times [2021-12-14 13:36:06,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:06,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26013260] [2021-12-14 13:36:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:06,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:06,356 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) [2021-12-14 13:36:06,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 13:36:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:06,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 13:36:06,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:06,550 INFO L388 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 14 treesize of output 15 [2021-12-14 13:36:06,558 INFO L388 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 14 treesize of output 15 [2021-12-14 13:36:06,702 INFO L388 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 [2021-12-14 13:36:06,707 INFO L388 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 [2021-12-14 13:36:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:06,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:36:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:06,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26013260] [2021-12-14 13:36:06,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26013260] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:36:06,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:36:06,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-14 13:36:06,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220543732] [2021-12-14 13:36:06,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:36:06,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:36:06,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:36:06,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:36:06,893 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:08,068 INFO L93 Difference]: Finished difference Result 276 states and 357 transitions. [2021-12-14 13:36:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:36:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 13:36:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:08,070 INFO L225 Difference]: With dead ends: 276 [2021-12-14 13:36:08,070 INFO L226 Difference]: Without dead ends: 273 [2021-12-14 13:36:08,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:36:08,071 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 500 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:08,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 13:36:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-14 13:36:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 104. [2021-12-14 13:36:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2021-12-14 13:36:08,081 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 19 [2021-12-14 13:36:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:08,082 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2021-12-14 13:36:08,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2021-12-14 13:36:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:36:08,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:08,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:08,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:08,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:08,291 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2021480904, now seen corresponding path program 1 times [2021-12-14 13:36:08,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:08,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788875835] [2021-12-14 13:36:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:08,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:08,293 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) [2021-12-14 13:36:08,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 13:36:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:08,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 13:36:08,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:08,423 INFO L388 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 14 treesize of output 15 [2021-12-14 13:36:08,427 INFO L388 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 14 treesize of output 15 [2021-12-14 13:36:08,493 INFO L388 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 [2021-12-14 13:36:08,497 INFO L388 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 [2021-12-14 13:36:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:08,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:36:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:08,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:08,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788875835] [2021-12-14 13:36:08,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788875835] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:36:08,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:36:08,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-14 13:36:08,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269513339] [2021-12-14 13:36:08,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:36:08,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:36:08,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:36:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:36:08,623 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:09,812 INFO L93 Difference]: Finished difference Result 264 states and 340 transitions. [2021-12-14 13:36:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:36:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 13:36:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:09,815 INFO L225 Difference]: With dead ends: 264 [2021-12-14 13:36:09,815 INFO L226 Difference]: Without dead ends: 188 [2021-12-14 13:36:09,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:36:09,816 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 151 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:09,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 566 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 13:36:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-14 13:36:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 104. [2021-12-14 13:36:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2021-12-14 13:36:09,824 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 19 [2021-12-14 13:36:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:09,824 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2021-12-14 13:36:09,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2021-12-14 13:36:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:36:09,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:09,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:09,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:10,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:10,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1594907966, now seen corresponding path program 1 times [2021-12-14 13:36:10,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790897410] [2021-12-14 13:36:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:10,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:10,038 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) [2021-12-14 13:36:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 13:36:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 13:36:10,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:10,168 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 13:36:10,169 INFO L388 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 1 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:36:10,206 INFO L388 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 16 treesize of output 8 [2021-12-14 13:36:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:10,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:10,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:10,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790897410] [2021-12-14 13:36:10,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790897410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:10,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:10,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:36:10,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262276930] [2021-12-14 13:36:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:10,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:36:10,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:10,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:36:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:36:10,248 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:10,842 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2021-12-14 13:36:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:36:10,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 13:36:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:10,843 INFO L225 Difference]: With dead ends: 209 [2021-12-14 13:36:10,843 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 13:36:10,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:36:10,844 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 357 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:10,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 287 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:36:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 13:36:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 110. [2021-12-14 13:36:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-12-14 13:36:10,857 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 22 [2021-12-14 13:36:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:10,858 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-12-14 13:36:10,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-12-14 13:36:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:36:10,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:10,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:10,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:11,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:11,071 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1900694176, now seen corresponding path program 2 times [2021-12-14 13:36:11,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:11,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120236066] [2021-12-14 13:36:11,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:36:11,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:11,078 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) [2021-12-14 13:36:11,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 13:36:11,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 13:36:11,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:36:11,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 13:36:11,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:11,193 INFO L388 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 [2021-12-14 13:36:11,197 INFO L388 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 [2021-12-14 13:36:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:36:11,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:11,212 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120236066] [2021-12-14 13:36:11,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120236066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:11,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:11,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:36:11,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389698946] [2021-12-14 13:36:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:11,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:36:11,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:36:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:36:11,213 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:11,818 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-12-14 13:36:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:36:11,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:36:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:11,819 INFO L225 Difference]: With dead ends: 137 [2021-12-14 13:36:11,820 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 13:36:11,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:36:11,820 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:11,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 288 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 13:36:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 13:36:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2021-12-14 13:36:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2021-12-14 13:36:11,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 24 [2021-12-14 13:36:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:11,827 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2021-12-14 13:36:11,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2021-12-14 13:36:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:36:11,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:11,832 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:11,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:12,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:12,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2068857130, now seen corresponding path program 2 times [2021-12-14 13:36:12,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:12,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817622029] [2021-12-14 13:36:12,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:36:12,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:12,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:12,047 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) [2021-12-14 13:36:12,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 13:36:12,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 13:36:12,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:36:12,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 13:36:12,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:12,177 INFO L388 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 31 treesize of output 19 [2021-12-14 13:36:12,180 INFO L388 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 25 treesize of output 13 [2021-12-14 13:36:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:36:12,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:12,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:12,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817622029] [2021-12-14 13:36:12,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817622029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:12,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:12,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:36:12,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891142130] [2021-12-14 13:36:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:12,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:36:12,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:36:12,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:36:12,197 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:12,698 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2021-12-14 13:36:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:36:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:36:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:12,699 INFO L225 Difference]: With dead ends: 107 [2021-12-14 13:36:12,699 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 13:36:12,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:36:12,700 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:12,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:36:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 13:36:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-14 13:36:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2021-12-14 13:36:12,705 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 24 [2021-12-14 13:36:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:12,706 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2021-12-14 13:36:12,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2021-12-14 13:36:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:36:12,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:12,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:12,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 13:36:12,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:12,913 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031067, now seen corresponding path program 1 times [2021-12-14 13:36:12,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:12,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649895105] [2021-12-14 13:36:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:12,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:12,915 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) [2021-12-14 13:36:12,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 13:36:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:12,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 13:36:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:13,013 INFO L388 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 [2021-12-14 13:36:13,047 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:36:13,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-14 13:36:13,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:36:13,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:36:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:36:13,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:36:13,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-14 13:36:13,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-14 13:36:13,336 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-14 13:36:13,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2021-12-14 13:36:13,344 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:36:13,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-14 13:36:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:36:13,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:13,364 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:13,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649895105] [2021-12-14 13:36:13,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649895105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:13,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:13,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:36:13,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875677503] [2021-12-14 13:36:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:13,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:36:13,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:36:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:36:13,365 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:36:14,970 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2021-12-14 13:36:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:36:14,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:36:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:36:14,971 INFO L225 Difference]: With dead ends: 271 [2021-12-14 13:36:14,971 INFO L226 Difference]: Without dead ends: 268 [2021-12-14 13:36:14,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:36:14,972 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 529 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:36:14,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 322 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-14 13:36:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-14 13:36:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 107. [2021-12-14 13:36:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 104 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:36:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2021-12-14 13:36:14,981 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 25 [2021-12-14 13:36:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:36:14,981 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2021-12-14 13:36:14,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:36:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2021-12-14 13:36:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:36:14,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:36:14,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:36:14,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:36:15,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:36:15,182 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:36:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:36:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 361371631, now seen corresponding path program 1 times [2021-12-14 13:36:15,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:36:15,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398479777] [2021-12-14 13:36:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:36:15,183 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:36:15,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:36:15,184 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) [2021-12-14 13:36:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 13:36:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:36:15,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 13:36:15,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:36:15,341 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 13:36:15,341 INFO L388 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 1 case distinctions, treesize of input 16 treesize of output 17 [2021-12-14 13:36:15,383 INFO L388 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 16 treesize of output 8 [2021-12-14 13:36:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:36:15,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:36:15,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:36:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398479777] [2021-12-14 13:36:15,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398479777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:36:15,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:36:15,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:36:15,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812018824] [2021-12-14 13:36:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:36:15,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:36:15,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:36:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:36:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:36:15,394 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)