./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/array-crafted/bor5.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 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 23:31:05,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 23:31:05,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 23:31:05,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 23:31:05,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 23:31:05,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 23:31:05,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 23:31:05,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 23:31:05,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 23:31:05,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 23:31:05,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 23:31:05,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 23:31:05,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 23:31:05,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 23:31:05,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 23:31:05,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 23:31:05,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 23:31:05,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 23:31:05,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 23:31:05,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 23:31:05,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 23:31:05,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 23:31:05,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 23:31:05,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 23:31:05,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 23:31:05,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 23:31:05,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 23:31:05,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 23:31:05,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 23:31:05,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 23:31:05,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 23:31:05,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 23:31:05,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 23:31:05,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 23:31:05,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 23:31:05,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 23:31:05,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 23:31:05,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 23:31:05,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 23:31:05,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 23:31:05,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 23:31:05,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 23:31:05,866 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 23:31:05,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 23:31:05,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 23:31:05,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 23:31:05,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 23:31:05,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 23:31:05,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 23:31:05,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 23:31:05,869 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 23:31:05,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 23:31:05,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 23:31:05,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 23:31:05,871 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 23:31:05,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 23:31:05,871 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 23:31:05,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 23:31:05,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 23:31:05,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 23:31:05,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 23:31:05,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:31:05,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 23:31:05,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 23:31:05,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 23:31:05,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 23:31:05,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 23:31:05,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 23:31:05,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 23:31:05,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 23:31:05,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 23:31:05,875 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 -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2021-12-16 23:31:06,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 23:31:06,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 23:31:06,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 23:31:06,080 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 23:31:06,081 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 23:31:06,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2021-12-16 23:31:06,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a5d2f9f/e8589f7d70a84392b941ca8ef7b41ec4/FLAG1907e469c [2021-12-16 23:31:06,496 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 23:31:06,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2021-12-16 23:31:06,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a5d2f9f/e8589f7d70a84392b941ca8ef7b41ec4/FLAG1907e469c [2021-12-16 23:31:06,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a5d2f9f/e8589f7d70a84392b941ca8ef7b41ec4 [2021-12-16 23:31:06,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 23:31:06,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 23:31:06,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 23:31:06,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 23:31:06,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 23:31:06,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:31:06" (1/1) ... [2021-12-16 23:31:06,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d8df21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:06, skipping insertion in model container [2021-12-16 23:31:06,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:31:06" (1/1) ... [2021-12-16 23:31:06,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 23:31:06,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 23:31:07,130 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/array-crafted/bor5.i[1364,1377] [2021-12-16 23:31:07,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:31:07,145 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 23:31:07,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/array-crafted/bor5.i[1364,1377] [2021-12-16 23:31:07,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:31:07,181 INFO L208 MainTranslator]: Completed translation [2021-12-16 23:31:07,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07 WrapperNode [2021-12-16 23:31:07,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 23:31:07,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 23:31:07,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 23:31:07,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 23:31:07,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,206 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-16 23:31:07,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 23:31:07,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 23:31:07,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 23:31:07,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 23:31:07,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 23:31:07,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 23:31:07,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 23:31:07,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 23:31:07,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (1/1) ... [2021-12-16 23:31:07,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:31:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:31:07,271 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-16 23:31:07,290 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-16 23:31:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 23:31:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2021-12-16 23:31:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2021-12-16 23:31:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 23:31:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 23:31:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 23:31:07,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 23:31:07,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 23:31:07,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 23:31:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 23:31:07,406 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 23:31:07,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 23:31:07,499 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 23:31:07,507 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 23:31:07,519 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 23:31:07,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:31:07 BoogieIcfgContainer [2021-12-16 23:31:07,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 23:31:07,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 23:31:07,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 23:31:07,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 23:31:07,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:31:06" (1/3) ... [2021-12-16 23:31:07,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6508ec1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:31:07, skipping insertion in model container [2021-12-16 23:31:07,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:07" (2/3) ... [2021-12-16 23:31:07,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6508ec1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:31:07, skipping insertion in model container [2021-12-16 23:31:07,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:31:07" (3/3) ... [2021-12-16 23:31:07,526 INFO L111 eAbstractionObserver]: Analyzing ICFG bor5.i [2021-12-16 23:31:07,529 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 23:31:07,529 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 23:31:07,583 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 23:31:07,588 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-16 23:31:07,588 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 23:31:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:31:07,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:07,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:07,600 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:07,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-16 23:31:07,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:31:07,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747582275] [2021-12-16 23:31:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:07,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:31:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 23:31:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 23:31:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-16 23:31:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:07,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:31:07,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747582275] [2021-12-16 23:31:07,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747582275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:07,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:31:07,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 23:31:07,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233274869] [2021-12-16 23:31:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:07,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 23:31:07,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:31:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 23:31:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:31:07,827 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:07,840 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-16 23:31:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 23:31:07,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:31:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:07,846 INFO L225 Difference]: With dead ends: 51 [2021-12-16 23:31:07,847 INFO L226 Difference]: Without dead ends: 23 [2021-12-16 23:31:07,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-16 23:31:07,852 INFO L933 BasicCegarLoop]: 33 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, 33 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-16 23:31:07,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-16 23:31:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-16 23:31:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-16 23:31:07,878 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-16 23:31:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:07,878 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-16 23:31:07,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-16 23:31:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:31:07,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:07,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:07,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 23:31:07,881 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-16 23:31:07,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:31:07,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401721458] [2021-12-16 23:31:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:07,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:31:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 23:31:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 23:31:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-16 23:31:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:07,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:31:07,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401721458] [2021-12-16 23:31:07,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401721458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:07,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:31:07,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 23:31:07,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933747859] [2021-12-16 23:31:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:07,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 23:31:07,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:31:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 23:31:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:31:07,959 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:07,984 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-16 23:31:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 23:31:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:31:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:07,986 INFO L225 Difference]: With dead ends: 43 [2021-12-16 23:31:07,986 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 23:31:07,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-16 23:31:07,987 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:07,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 23:31:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 23:31:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-16 23:31:07,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-16 23:31:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:07,992 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-16 23:31:07,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-16 23:31:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 23:31:07,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:07,994 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:07,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 23:31:07,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:07,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-16 23:31:07,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:31:07,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56380223] [2021-12-16 23:31:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:07,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:31:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 23:31:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 23:31:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 23:31:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 23:31:08,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:31:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56380223] [2021-12-16 23:31:08,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56380223] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 23:31:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481156684] [2021-12-16 23:31:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:08,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:31:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:31:08,069 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-16 23:31:08,070 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-16 23:31:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 23:31:08,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:08,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:08,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481156684] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:08,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 23:31:08,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-16 23:31:08,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286409647] [2021-12-16 23:31:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:08,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 23:31:08,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:31:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 23:31:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 23:31:08,292 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 23:31:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:08,353 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2021-12-16 23:31:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 23:31:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2021-12-16 23:31:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:08,355 INFO L225 Difference]: With dead ends: 47 [2021-12-16 23:31:08,355 INFO L226 Difference]: Without dead ends: 29 [2021-12-16 23:31:08,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-16 23:31:08,356 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:08,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-16 23:31:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-16 23:31:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 23:31:08,361 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2021-12-16 23:31:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:08,361 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 23:31:08,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 23:31:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-16 23:31:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 23:31:08,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:08,363 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:08,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 23:31:08,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:31:08,597 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-16 23:31:08,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:31:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011199843] [2021-12-16 23:31:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:08,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:31:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 23:31:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 23:31:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-16 23:31:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:08,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:31:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011199843] [2021-12-16 23:31:08,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011199843] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 23:31:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693097151] [2021-12-16 23:31:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:08,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:31:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:31:08,713 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-16 23:31:08,716 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-16 23:31:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:08,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:31:08,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 23:31:08,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:31:08,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693097151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:08,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 23:31:08,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-16 23:31:08,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757148667] [2021-12-16 23:31:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:08,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 23:31:08,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:31:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 23:31:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:31:08,880 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:31:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:08,917 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-16 23:31:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 23:31:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2021-12-16 23:31:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:08,920 INFO L225 Difference]: With dead ends: 42 [2021-12-16 23:31:08,922 INFO L226 Difference]: Without dead ends: 29 [2021-12-16 23:31:08,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:31:08,925 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:08,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-16 23:31:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-16 23:31:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-16 23:31:08,932 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-16 23:31:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:08,934 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-16 23:31:08,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:31:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-16 23:31:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 23:31:08,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:08,935 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:08,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-16 23:31:09,171 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,SelfDestructingSolverStorable3 [2021-12-16 23:31:09,172 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-16 23:31:09,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:31:09,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136806186] [2021-12-16 23:31:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:09,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:31:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 23:31:09,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 23:31:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 23:31:09,261 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 23:31:09,262 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 23:31:09,262 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 23:31:09,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 23:31:09,265 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-16 23:31:09,267 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 23:31:09,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 11:31:09 BoogieIcfgContainer [2021-12-16 23:31:09,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 23:31:09,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 23:31:09,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 23:31:09,289 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 23:31:09,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:31:07" (3/4) ... [2021-12-16 23:31:09,291 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 23:31:09,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 23:31:09,292 INFO L158 Benchmark]: Toolchain (without parser) took 2334.97ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 66.1MB in the beginning and 89.2MB in the end (delta: -23.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:31:09,292 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:31:09,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.04ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 72.5MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 23:31:09,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.78ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 70.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 23:31:09,293 INFO L158 Benchmark]: Boogie Preprocessor took 18.82ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 23:31:09,293 INFO L158 Benchmark]: RCFGBuilder took 294.32ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 58.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 23:31:09,293 INFO L158 Benchmark]: TraceAbstraction took 1766.91ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.2MB in the beginning and 89.2MB in the end (delta: -31.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2021-12-16 23:31:09,294 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 117.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:31:09,295 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.17ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.04ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 72.5MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.78ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 70.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.82ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.32ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 58.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1766.91ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.2MB in the beginning and 89.2MB in the end (delta: -31.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 117.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR bor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res | x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=-4, i=2, N=2, res=4294967292, x={9:0}, x={9:0}] [L45] RET, EXPR bor(x) VAL [bor(x)=-4, i=2, N=2, x={9:0}] [L45] ret = bor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=-4, temp=-3, x={9:0}] [L48] CALL, EXPR bor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res | x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=-5, i=2, N=2, res=4294967291, x={9:0}, x={9:0}] [L48] RET, EXPR bor(x) VAL [bor(x)=-5, i=2, N=2, ret=-4, temp=-3, x={9:0}] [L48] ret2 = bor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=2, i=0, N=2, ret=-4, ret2=-5, temp=-3, x={9:0}] [L50] COND TRUE i 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 -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2021-12-16 23:31:11,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 23:31:11,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 23:31:11,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 23:31:11,494 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 23:31:11,494 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 23:31:11,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2021-12-16 23:31:11,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d03712e5/831970301c4c4a5cb308f943f897f16d/FLAGa1bc8d89b [2021-12-16 23:31:11,932 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 23:31:11,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2021-12-16 23:31:11,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d03712e5/831970301c4c4a5cb308f943f897f16d/FLAGa1bc8d89b [2021-12-16 23:31:11,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d03712e5/831970301c4c4a5cb308f943f897f16d [2021-12-16 23:31:11,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 23:31:11,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 23:31:11,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 23:31:11,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 23:31:11,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 23:31:11,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:31:11" (1/1) ... [2021-12-16 23:31:11,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141ca890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:11, skipping insertion in model container [2021-12-16 23:31:11,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:31:11" (1/1) ... [2021-12-16 23:31:11,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 23:31:11,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 23:31:12,113 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/array-crafted/bor5.i[1364,1377] [2021-12-16 23:31:12,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:31:12,131 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 23:31:12,166 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/array-crafted/bor5.i[1364,1377] [2021-12-16 23:31:12,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:31:12,180 INFO L208 MainTranslator]: Completed translation [2021-12-16 23:31:12,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12 WrapperNode [2021-12-16 23:31:12,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 23:31:12,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 23:31:12,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 23:31:12,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 23:31:12,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,221 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2021-12-16 23:31:12,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 23:31:12,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 23:31:12,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 23:31:12,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 23:31:12,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 23:31:12,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 23:31:12,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 23:31:12,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 23:31:12,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (1/1) ... [2021-12-16 23:31:12,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:31:12,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:31:12,318 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-16 23:31:12,375 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-16 23:31:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 23:31:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2021-12-16 23:31:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2021-12-16 23:31:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 23:31:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 23:31:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 23:31:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 23:31:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 23:31:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 23:31:12,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 23:31:12,462 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 23:31:12,463 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 23:31:12,638 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 23:31:12,649 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 23:31:12,650 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 23:31:12,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:31:12 BoogieIcfgContainer [2021-12-16 23:31:12,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 23:31:12,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 23:31:12,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 23:31:12,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 23:31:12,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:31:11" (1/3) ... [2021-12-16 23:31:12,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc931a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:31:12, skipping insertion in model container [2021-12-16 23:31:12,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:31:12" (2/3) ... [2021-12-16 23:31:12,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc931a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:31:12, skipping insertion in model container [2021-12-16 23:31:12,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:31:12" (3/3) ... [2021-12-16 23:31:12,657 INFO L111 eAbstractionObserver]: Analyzing ICFG bor5.i [2021-12-16 23:31:12,660 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 23:31:12,660 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 23:31:12,694 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 23:31:12,702 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-16 23:31:12,703 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 23:31:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:31:12,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:12,717 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:12,718 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-16 23:31:12,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548772667] [2021-12-16 23:31:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:12,752 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:12,779 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-16 23:31:12,819 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-16 23:31:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:12,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-16 23:31:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 23:31:13,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:31:13,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:13,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548772667] [2021-12-16 23:31:13,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548772667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:13,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:31:13,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 23:31:13,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947515305] [2021-12-16 23:31:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:13,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 23:31:13,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 23:31:13,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:31:13,027 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:31:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:13,038 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-16 23:31:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 23:31:13,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-16 23:31:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:13,043 INFO L225 Difference]: With dead ends: 51 [2021-12-16 23:31:13,043 INFO L226 Difference]: Without dead ends: 23 [2021-12-16 23:31:13,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-16 23:31:13,047 INFO L933 BasicCegarLoop]: 33 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, 33 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-16 23:31:13,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-16 23:31:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-16 23:31:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-16 23:31:13,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-16 23:31:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:13,070 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-16 23:31:13,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:31:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-16 23:31:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:31:13,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:13,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:13,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-16 23:31:13,278 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-16 23:31:13,279 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:13,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-16 23:31:13,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:13,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924329028] [2021-12-16 23:31:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:13,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:13,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:13,282 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-16 23:31:13,283 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-16 23:31:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:13,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:31:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:13,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:31:13,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:13,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924329028] [2021-12-16 23:31:13,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924329028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:13,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:31:13,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 23:31:13,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313569126] [2021-12-16 23:31:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:13,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 23:31:13,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 23:31:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:31:13,470 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:13,530 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-16 23:31:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 23:31:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:31:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:13,531 INFO L225 Difference]: With dead ends: 43 [2021-12-16 23:31:13,531 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 23:31:13,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-16 23:31:13,533 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:13,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 23:31:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 23:31:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 23:31:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-16 23:31:13,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-16 23:31:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:13,549 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-16 23:31:13,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-16 23:31:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 23:31:13,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:13,550 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:13,559 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-16 23:31:13,766 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-16 23:31:13,766 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-16 23:31:13,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:13,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389603724] [2021-12-16 23:31:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:13,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:13,770 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-16 23:31:13,772 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-16 23:31:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:13,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 23:31:13,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:13,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:31:13,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:13,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389603724] [2021-12-16 23:31:13,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389603724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:13,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:13,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-16 23:31:13,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075534771] [2021-12-16 23:31:13,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:13,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 23:31:13,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 23:31:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:31:13,987 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:31:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:14,050 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-16 23:31:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 23:31:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2021-12-16 23:31:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:14,052 INFO L225 Difference]: With dead ends: 45 [2021-12-16 23:31:14,052 INFO L226 Difference]: Without dead ends: 27 [2021-12-16 23:31:14,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:31:14,054 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:14,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 23:31:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-16 23:31:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-16 23:31:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-16 23:31:14,059 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2021-12-16 23:31:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:14,059 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-16 23:31:14,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:31:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-16 23:31:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 23:31:14,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:14,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:14,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-16 23:31:14,271 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-16 23:31:14,272 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 64401422, now seen corresponding path program 2 times [2021-12-16 23:31:14,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759270487] [2021-12-16 23:31:14,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:31:14,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:14,274 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-16 23:31:14,275 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-16 23:31:14,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 23:31:14,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:14,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:31:14,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 23:31:14,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:31:14,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:14,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759270487] [2021-12-16 23:31:14,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759270487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:31:14,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:31:14,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 23:31:14,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971110216] [2021-12-16 23:31:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:31:14,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 23:31:14,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 23:31:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 23:31:14,419 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:14,491 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-16 23:31:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 23:31:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-16 23:31:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:14,495 INFO L225 Difference]: With dead ends: 45 [2021-12-16 23:31:14,496 INFO L226 Difference]: Without dead ends: 28 [2021-12-16 23:31:14,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 23:31:14,503 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:14,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:31:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-16 23:31:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-16 23:31:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 23:31:14,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2021-12-16 23:31:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:14,515 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 23:31:14,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:31:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-16 23:31:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 23:31:14,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:14,519 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:14,544 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-16 23:31:14,728 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-16 23:31:14,729 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-16 23:31:14,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494508565] [2021-12-16 23:31:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:14,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:14,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:14,731 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-16 23:31:14,733 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-16 23:31:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:14,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 23:31:14,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 23:31:15,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-16 23:31:15,212 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:15,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494508565] [2021-12-16 23:31:15,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494508565] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:15,212 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:15,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-16 23:31:15,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068215864] [2021-12-16 23:31:15,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:15,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 23:31:15,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 23:31:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-16 23:31:15,214 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:15,491 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-16 23:31:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 23:31:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2021-12-16 23:31:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:15,493 INFO L225 Difference]: With dead ends: 65 [2021-12-16 23:31:15,493 INFO L226 Difference]: Without dead ends: 52 [2021-12-16 23:31:15,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-12-16 23:31:15,494 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:15,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:31:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-16 23:31:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2021-12-16 23:31:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-16 23:31:15,497 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-16 23:31:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:15,498 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-16 23:31:15,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-16 23:31:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 23:31:15,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:15,501 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:15,515 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-16 23:31:15,702 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-16 23:31:15,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-16 23:31:15,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:15,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227871603] [2021-12-16 23:31:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:31:15,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:15,705 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-16 23:31:15,706 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-16 23:31:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:31:15,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-16 23:31:15,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:16,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:16,226 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:16,227 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-12-16 23:31:16,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:16,499 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:16,500 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2021-12-16 23:31:16,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:16,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:31:16,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:16,622 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2021-12-16 23:31:16,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:16,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2021-12-16 23:31:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 23:31:17,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:18,475 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 49 treesize of output 37 [2021-12-16 23:31:18,491 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:31:18,492 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 62 treesize of output 1 [2021-12-16 23:31:18,496 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 143 treesize of output 111 [2021-12-16 23:31:18,502 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:31:18,503 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 249 treesize of output 183 [2021-12-16 23:31:19,101 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 143 treesize of output 111 [2021-12-16 23:31:19,105 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:31:19,106 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 249 treesize of output 1 [2021-12-16 23:31:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 23:31:19,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:19,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227871603] [2021-12-16 23:31:19,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227871603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:19,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:19,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-16 23:31:19,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994722499] [2021-12-16 23:31:19,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:19,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-16 23:31:19,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-16 23:31:19,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2021-12-16 23:31:19,362 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:31:21,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:23,661 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2021-12-16 23:31:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 23:31:23,662 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-16 23:31:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:23,664 INFO L225 Difference]: With dead ends: 87 [2021-12-16 23:31:23,664 INFO L226 Difference]: Without dead ends: 83 [2021-12-16 23:31:23,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=397, Invalid=2683, Unknown=0, NotChecked=0, Total=3080 [2021-12-16 23:31:23,665 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 97 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:23,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 233 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 678 Invalid, 1 Unknown, 66 Unchecked, 3.3s Time] [2021-12-16 23:31:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-16 23:31:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2021-12-16 23:31:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-16 23:31:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-16 23:31:23,676 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2021-12-16 23:31:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:23,676 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-16 23:31:23,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:31:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2021-12-16 23:31:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 23:31:23,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:23,677 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:23,685 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-16 23:31:23,885 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-16 23:31:23,885 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 380877448, now seen corresponding path program 2 times [2021-12-16 23:31:23,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250715345] [2021-12-16 23:31:23,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:31:23,886 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:23,888 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-16 23:31:23,889 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-16 23:31:23,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:31:23,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:23,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 23:31:23,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:24,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:24,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250715345] [2021-12-16 23:31:24,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250715345] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:24,437 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:24,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-16 23:31:24,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767361441] [2021-12-16 23:31:24,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:24,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 23:31:24,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 23:31:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-16 23:31:24,438 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:31:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:24,776 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2021-12-16 23:31:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 23:31:24,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2021-12-16 23:31:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:24,777 INFO L225 Difference]: With dead ends: 104 [2021-12-16 23:31:24,777 INFO L226 Difference]: Without dead ends: 78 [2021-12-16 23:31:24,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:31:24,778 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:24,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 172 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:31:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-16 23:31:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2021-12-16 23:31:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:31:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-16 23:31:24,787 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2021-12-16 23:31:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:24,787 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-16 23:31:24,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:31:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-16 23:31:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 23:31:24,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:24,788 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:24,796 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-16 23:31:24,990 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-16 23:31:24,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1155110252, now seen corresponding path program 3 times [2021-12-16 23:31:24,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:24,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354613068] [2021-12-16 23:31:24,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 23:31:24,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:24,993 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-16 23:31:24,995 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-16 23:31:25,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-16 23:31:25,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:25,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 23:31:25,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:25,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:25,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354613068] [2021-12-16 23:31:25,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354613068] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:25,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:25,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-16 23:31:25,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271455910] [2021-12-16 23:31:25,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:25,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 23:31:25,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 23:31:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-16 23:31:25,338 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:31:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:25,555 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-12-16 23:31:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 23:31:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2021-12-16 23:31:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:25,557 INFO L225 Difference]: With dead ends: 77 [2021-12-16 23:31:25,557 INFO L226 Difference]: Without dead ends: 58 [2021-12-16 23:31:25,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-16 23:31:25,559 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:25,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 125 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:31:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-16 23:31:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-16 23:31:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:31:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-16 23:31:25,565 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2021-12-16 23:31:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:25,565 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-16 23:31:25,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:31:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-12-16 23:31:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 23:31:25,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:25,566 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:25,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-16 23:31:25,773 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-16 23:31:25,773 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -83406906, now seen corresponding path program 4 times [2021-12-16 23:31:25,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:25,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615189199] [2021-12-16 23:31:25,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 23:31:25,775 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:25,776 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-16 23:31:25,777 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-16 23:31:25,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 23:31:25,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:25,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 23:31:25,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:31:26,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-16 23:31:26,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615189199] [2021-12-16 23:31:26,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615189199] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:26,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:26,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-16 23:31:26,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534973007] [2021-12-16 23:31:26,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:26,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 23:31:26,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 23:31:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-16 23:31:26,297 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:26,500 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-16 23:31:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 23:31:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2021-12-16 23:31:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:26,502 INFO L225 Difference]: With dead ends: 64 [2021-12-16 23:31:26,502 INFO L226 Difference]: Without dead ends: 33 [2021-12-16 23:31:26,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-16 23:31:26,503 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:26,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:31:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-16 23:31:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-16 23:31:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:31:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-16 23:31:26,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2021-12-16 23:31:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:26,508 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-16 23:31:26,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-16 23:31:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 23:31:26,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:26,509 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:26,527 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-16 23:31:26,718 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-16 23:31:26,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1254464106, now seen corresponding path program 5 times [2021-12-16 23:31:26,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530794465] [2021-12-16 23:31:26,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 23:31:26,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:26,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:26,721 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-16 23:31:26,739 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-16 23:31:26,820 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-16 23:31:26,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:26,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:31:26,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 23:31:27,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-16 23:31:27,334 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530794465] [2021-12-16 23:31:27,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530794465] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:27,334 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:27,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-12-16 23:31:27,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893081373] [2021-12-16 23:31:27,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:27,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 23:31:27,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 23:31:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-16 23:31:27,335 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:31:27,839 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-16 23:31:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 23:31:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2021-12-16 23:31:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:31:27,840 INFO L225 Difference]: With dead ends: 101 [2021-12-16 23:31:27,841 INFO L226 Difference]: Without dead ends: 82 [2021-12-16 23:31:27,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2021-12-16 23:31:27,841 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:31:27,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 152 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:31:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-16 23:31:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2021-12-16 23:31:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:31:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-12-16 23:31:27,847 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2021-12-16 23:31:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:31:27,848 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-12-16 23:31:27,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:31:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-12-16 23:31:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-16 23:31:27,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:31:27,848 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:31:27,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 23:31:28,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:31:28,051 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:31:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:31:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 715974184, now seen corresponding path program 6 times [2021-12-16 23:31:28,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:31:28,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830115728] [2021-12-16 23:31:28,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 23:31:28,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:31:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:31:28,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:31:28,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 23:31:28,274 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-16 23:31:28,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:31:28,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-16 23:31:28,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:31:28,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:28,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2021-12-16 23:31:28,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:31:28,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:28,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:31:28,869 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:31:28,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2021-12-16 23:31:29,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,097 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:29,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2021-12-16 23:31:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:29,247 INFO L354 Elim1Store]: treesize reduction 72, result has 37.9 percent of original size [2021-12-16 23:31:29,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 81 [2021-12-16 23:31:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:31:30,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:31:30,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:31:30,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 85 [2021-12-16 23:31:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 23:31:30,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:50,326 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 324 treesize of output 252 [2021-12-16 23:31:50,356 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 23:31:50,356 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 579870 treesize of output 1 [2021-12-16 23:31:50,589 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 174 treesize of output 138 [2021-12-16 23:31:50,599 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 23:31:50,599 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 70834 treesize of output 1 [2021-12-16 23:31:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-16 23:31:50,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:50,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830115728] [2021-12-16 23:31:50,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830115728] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:50,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:50,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 48 [2021-12-16 23:31:50,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878522496] [2021-12-16 23:31:50,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:50,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-16 23:31:50,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-16 23:31:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2058, Unknown=8, NotChecked=0, Total=2256 [2021-12-16 23:31:50,612 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:32:12,453 WARN L227 SmtUtils]: Spent 21.67s on a formula simplification. DAG size of input: 184 DAG size of output: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:32:14,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:16,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:19,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:29,636 WARN L227 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 91 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:32:32,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:34,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:36,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:32:57,178 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-16 23:32:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-16 23:32:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2021-12-16 23:32:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:32:57,180 INFO L225 Difference]: With dead ends: 91 [2021-12-16 23:32:57,180 INFO L226 Difference]: Without dead ends: 66 [2021-12-16 23:32:57,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=456, Invalid=4498, Unknown=16, NotChecked=0, Total=4970 [2021-12-16 23:32:57,182 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 84 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2021-12-16 23:32:57,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 121 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 652 Invalid, 6 Unknown, 238 Unchecked, 14.4s Time] [2021-12-16 23:32:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-16 23:32:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-12-16 23:32:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:32:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-16 23:32:57,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2021-12-16 23:32:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:32:57,188 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-16 23:32:57,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:32:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-16 23:32:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-16 23:32:57,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:32:57,189 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:32:57,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 23:32:57,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:32:57,398 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:32:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:32:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash 598486502, now seen corresponding path program 7 times [2021-12-16 23:32:57,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:32:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641889744] [2021-12-16 23:32:57,399 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 23:32:57,399 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:32:57,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:32:57,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:32:57,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 23:32:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:32:57,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:32:57,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:32:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-16 23:32:57,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:32:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 23:32:58,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:32:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641889744] [2021-12-16 23:32:58,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641889744] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:32:58,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:32:58,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2021-12-16 23:32:58,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203881919] [2021-12-16 23:32:58,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:32:58,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 23:32:58,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:32:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 23:32:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-12-16 23:32:58,187 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:32:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:32:58,881 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2021-12-16 23:32:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 23:32:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2021-12-16 23:32:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:32:58,883 INFO L225 Difference]: With dead ends: 148 [2021-12-16 23:32:58,883 INFO L226 Difference]: Without dead ends: 103 [2021-12-16 23:32:58,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2021-12-16 23:32:58,884 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 23:32:58,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 194 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 23:32:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-16 23:32:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2021-12-16 23:32:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-16 23:32:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-12-16 23:32:58,892 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 53 [2021-12-16 23:32:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:32:58,893 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-12-16 23:32:58,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:32:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2021-12-16 23:32:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-16 23:32:58,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:32:58,894 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:32:58,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-16 23:32:59,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:32:59,102 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:32:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:32:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1840215844, now seen corresponding path program 8 times [2021-12-16 23:32:59,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:32:59,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755849563] [2021-12-16 23:32:59,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:32:59,103 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:32:59,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:32:59,104 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:32:59,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 23:32:59,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:32:59,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:32:59,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:32:59,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:32:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 23:32:59,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:32:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-16 23:32:59,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:32:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755849563] [2021-12-16 23:32:59,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755849563] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:32:59,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:32:59,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-16 23:32:59,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043943012] [2021-12-16 23:32:59,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:32:59,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 23:32:59,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:32:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 23:32:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:32:59,931 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:00,533 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-12-16 23:33:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 23:33:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2021-12-16 23:33:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:00,535 INFO L225 Difference]: With dead ends: 112 [2021-12-16 23:33:00,535 INFO L226 Difference]: Without dead ends: 66 [2021-12-16 23:33:00,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-12-16 23:33:00,536 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:00,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 114 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:33:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-16 23:33:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-12-16 23:33:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:33:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2021-12-16 23:33:00,541 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 55 [2021-12-16 23:33:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:00,541 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2021-12-16 23:33:00,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2021-12-16 23:33:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-16 23:33:00,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:00,542 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:00,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:00,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:00,750 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -740392824, now seen corresponding path program 9 times [2021-12-16 23:33:00,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:00,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285860334] [2021-12-16 23:33:00,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 23:33:00,751 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:00,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:00,752 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:00,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 23:33:00,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-16 23:33:00,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:33:00,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-16 23:33:01,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:33:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-16 23:33:01,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:33:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285860334] [2021-12-16 23:33:01,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285860334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:33:01,549 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:33:01,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-12-16 23:33:01,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255835002] [2021-12-16 23:33:01,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:33:01,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 23:33:01,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:33:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 23:33:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:33:01,550 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:33:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:01,913 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-12-16 23:33:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 23:33:01,914 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2021-12-16 23:33:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:01,914 INFO L225 Difference]: With dead ends: 71 [2021-12-16 23:33:01,914 INFO L226 Difference]: Without dead ends: 40 [2021-12-16 23:33:01,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-16 23:33:01,915 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:01,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 93 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:33:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-16 23:33:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-16 23:33:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:33:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-16 23:33:01,918 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 55 [2021-12-16 23:33:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:01,918 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-16 23:33:01,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:33:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-16 23:33:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-16 23:33:01,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:01,918 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:01,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-16 23:33:02,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:02,119 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2073903416, now seen corresponding path program 10 times [2021-12-16 23:33:02,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:02,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929988132] [2021-12-16 23:33:02,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 23:33:02,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:02,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:02,121 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:02,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 23:33:02,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 23:33:02,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 23:33:02,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 58 proven. 20 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 23:33:02,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:33:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-16 23:33:03,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:33:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929988132] [2021-12-16 23:33:03,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929988132] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:33:03,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:33:03,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-16 23:33:03,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800515794] [2021-12-16 23:33:03,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:33:03,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 23:33:03,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:33:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 23:33:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2021-12-16 23:33:03,165 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:04,113 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2021-12-16 23:33:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 23:33:04,114 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2021-12-16 23:33:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:04,114 INFO L225 Difference]: With dead ends: 94 [2021-12-16 23:33:04,114 INFO L226 Difference]: Without dead ends: 77 [2021-12-16 23:33:04,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=998, Unknown=0, NotChecked=0, Total=1332 [2021-12-16 23:33:04,115 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 187 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:04,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 23:33:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-16 23:33:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2021-12-16 23:33:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 64 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:33:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-12-16 23:33:04,121 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 59 [2021-12-16 23:33:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:04,121 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-12-16 23:33:04,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-12-16 23:33:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 23:33:04,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:04,121 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:04,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:04,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:04,331 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2140154630, now seen corresponding path program 11 times [2021-12-16 23:33:04,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325244382] [2021-12-16 23:33:04,332 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 23:33:04,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:04,334 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:04,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 23:33:04,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-16 23:33:04,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:04,773 WARN L261 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-16 23:33:04,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:04,822 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 23:33:05,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:05,438 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:05,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 49 [2021-12-16 23:33:08,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:08,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:08,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,495 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:33:08,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 89 [2021-12-16 23:33:08,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:08,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:08,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:08,817 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 23:33:08,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 97 [2021-12-16 23:33:09,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,172 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:09,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 66 [2021-12-16 23:33:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:09,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:09,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 78 [2021-12-16 23:33:09,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:09,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 43 [2021-12-16 23:33:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 118 refuted. 1 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 23:33:10,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:34:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 105 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 23:34:15,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:34:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325244382] [2021-12-16 23:34:15,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325244382] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:34:15,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:34:15,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 71 [2021-12-16 23:34:15,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141001608] [2021-12-16 23:34:15,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:34:15,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-12-16 23:34:15,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:34:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-16 23:34:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=4555, Unknown=28, NotChecked=0, Total=4970 [2021-12-16 23:34:15,729 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 71 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 64 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:34:18,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:20,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:25,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:27,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:29,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:32,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:34,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:36,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:38,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:55,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:34:57,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:04,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:06,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:08,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:10,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:12,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:25,255 WARN L227 SmtUtils]: Spent 10.84s on a formula simplification. DAG size of input: 130 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:35:27,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:35,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:37,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:39,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:41,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:46,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:35:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:35:48,830 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2021-12-16 23:35:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-16 23:35:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 64 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2021-12-16 23:35:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:35:48,835 INFO L225 Difference]: With dead ends: 254 [2021-12-16 23:35:48,835 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 23:35:48,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 108.8s TimeCoverageRelationStatistics Valid=782, Invalid=9490, Unknown=30, NotChecked=0, Total=10302 [2021-12-16 23:35:48,837 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 112 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 199 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 52.8s IncrementalHoareTripleChecker+Time [2021-12-16 23:35:48,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 256 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1899 Invalid, 22 Unknown, 103 Unchecked, 52.8s Time] [2021-12-16 23:35:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 23:35:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2021-12-16 23:35:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 146 states have (on average 1.1232876712328768) internal successors, (164), 147 states have internal predecessors, (164), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) [2021-12-16 23:35:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2021-12-16 23:35:48,859 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 61 [2021-12-16 23:35:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:35:48,859 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2021-12-16 23:35:48,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 64 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:35:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2021-12-16 23:35:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 23:35:48,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:35:48,860 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:35:48,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 23:35:49,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:35:49,070 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:35:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:35:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash 968099526, now seen corresponding path program 12 times [2021-12-16 23:35:49,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:35:49,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054616935] [2021-12-16 23:35:49,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 23:35:49,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:35:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:35:49,073 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:35:49,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 23:35:49,361 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-12-16 23:35:49,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:35:49,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 23:35:49,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:35:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 116 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-16 23:35:49,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:35:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 86 proven. 62 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-16 23:35:50,385 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:35:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054616935] [2021-12-16 23:35:50,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054616935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:35:50,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:35:50,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2021-12-16 23:35:50,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142535734] [2021-12-16 23:35:50,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:35:50,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-16 23:35:50,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:35:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-16 23:35:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-12-16 23:35:50,387 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:35:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:35:51,403 INFO L93 Difference]: Finished difference Result 294 states and 348 transitions. [2021-12-16 23:35:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-16 23:35:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 65 [2021-12-16 23:35:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:35:51,405 INFO L225 Difference]: With dead ends: 294 [2021-12-16 23:35:51,405 INFO L226 Difference]: Without dead ends: 179 [2021-12-16 23:35:51,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2021-12-16 23:35:51,406 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 163 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 23:35:51,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 183 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 23:35:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-16 23:35:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2021-12-16 23:35:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 137 states have (on average 1.072992700729927) internal successors, (147), 136 states have internal predecessors, (147), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-16 23:35:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2021-12-16 23:35:51,427 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 65 [2021-12-16 23:35:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:35:51,427 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2021-12-16 23:35:51,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:35:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2021-12-16 23:35:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 23:35:51,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:35:51,433 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:35:51,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 23:35:51,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:35:51,642 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:35:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:35:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 222520000, now seen corresponding path program 13 times [2021-12-16 23:35:51,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:35:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454391966] [2021-12-16 23:35:51,643 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 23:35:51,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:35:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:35:51,644 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:35:51,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 23:35:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:35:51,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 23:35:51,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:35:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-16 23:35:52,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:35:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 19 proven. 31 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-16 23:35:52,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:35:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454391966] [2021-12-16 23:35:52,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454391966] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:35:52,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:35:52,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2021-12-16 23:35:52,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572305382] [2021-12-16 23:35:52,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:35:52,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-16 23:35:52,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:35:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 23:35:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2021-12-16 23:35:52,724 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:35:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:35:53,909 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2021-12-16 23:35:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 23:35:53,910 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2021-12-16 23:35:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:35:53,911 INFO L225 Difference]: With dead ends: 279 [2021-12-16 23:35:53,911 INFO L226 Difference]: Without dead ends: 125 [2021-12-16 23:35:53,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=1028, Unknown=0, NotChecked=0, Total=1406 [2021-12-16 23:35:53,912 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 185 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 23:35:53,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 235 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 23:35:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-16 23:35:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2021-12-16 23:35:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 101 states have internal predecessors, (108), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 23:35:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2021-12-16 23:35:53,921 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 67 [2021-12-16 23:35:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:35:53,921 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2021-12-16 23:35:53,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:35:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2021-12-16 23:35:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 23:35:53,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:35:53,922 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:35:53,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-16 23:35:54,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:35:54,130 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:35:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:35:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 961678948, now seen corresponding path program 14 times [2021-12-16 23:35:54,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:35:54,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345397368] [2021-12-16 23:35:54,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:35:54,132 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:35:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:35:54,133 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:35:54,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 23:35:54,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:35:54,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:35:54,563 WARN L261 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-16 23:35:54,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:35:54,636 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 23:35:55,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:55,725 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:35:55,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 61 [2021-12-16 23:35:56,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:56,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:56,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:56,999 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:35:56,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 104 [2021-12-16 23:35:57,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:57,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:57,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,384 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:35:57,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 104 [2021-12-16 23:35:57,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:57,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:57,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:57,813 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 23:35:57,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 123 treesize of output 110 [2021-12-16 23:35:58,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:35:58,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 81 [2021-12-16 23:35:58,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:35:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:35:58,468 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:35:58,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 93 [2021-12-16 23:36:01,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:36:01,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 52 [2021-12-16 23:36:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 19 proven. 187 refuted. 1 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-16 23:36:01,680 INFO L328 TraceCheckSpWp]: Computing backward predicates...