./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash b868f3157e52446230c4a3fdb5dc76d19b0550422b9d67863cf2cd5c28b471dd --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 01:56:43,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 01:56:43,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 01:56:43,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 01:56:43,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 01:56:43,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 01:56:43,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 01:56:43,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 01:56:43,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 01:56:43,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 01:56:43,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 01:56:43,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 01:56:43,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 01:56:43,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 01:56:43,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 01:56:43,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 01:56:43,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 01:56:43,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 01:56:43,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 01:56:43,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 01:56:43,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 01:56:43,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 01:56:43,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 01:56:43,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 01:56:43,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 01:56:43,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 01:56:43,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 01:56:43,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 01:56:43,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 01:56:43,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 01:56:43,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 01:56:43,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 01:56:43,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 01:56:43,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 01:56:43,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 01:56:43,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 01:56:43,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 01:56:43,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 01:56:43,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 01:56:43,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 01:56:43,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 01:56:43,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 01:56:43,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 01:56:43,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 01:56:43,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 01:56:43,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 01:56:43,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 01:56:43,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 01:56:43,823 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 01:56:43,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 01:56:43,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 01:56:43,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 01:56:43,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 01:56:43,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 01:56:43,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 01:56:43,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 01:56:43,824 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 01:56:43,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 01:56:43,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 01:56:43,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 01:56:43,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 01:56:43,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 01:56:43,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 01:56:43,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 01:56:43,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 01:56:43,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 01:56:43,827 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b868f3157e52446230c4a3fdb5dc76d19b0550422b9d67863cf2cd5c28b471dd [2021-11-04 01:56:44,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 01:56:44,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 01:56:44,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 01:56:44,028 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 01:56:44,028 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 01:56:44,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2021-11-04 01:56:44,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9c7307a/b53e17f797fb49c3b422f1ef74d4635e/FLAG0d5702164 [2021-11-04 01:56:44,674 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 01:56:44,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2021-11-04 01:56:44,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9c7307a/b53e17f797fb49c3b422f1ef74d4635e/FLAG0d5702164 [2021-11-04 01:56:45,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9c7307a/b53e17f797fb49c3b422f1ef74d4635e [2021-11-04 01:56:45,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 01:56:45,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 01:56:45,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 01:56:45,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 01:56:45,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 01:56:45,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:56:45" (1/1) ... [2021-11-04 01:56:45,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be3ff0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:45, skipping insertion in model container [2021-11-04 01:56:45,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:56:45" (1/1) ... [2021-11-04 01:56:45,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 01:56:45,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 01:56:47,124 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i[340889,340902] [2021-11-04 01:56:47,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 01:56:47,338 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 01:56:47,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i[340889,340902] [2021-11-04 01:56:47,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 01:56:47,944 INFO L208 MainTranslator]: Completed translation [2021-11-04 01:56:47,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47 WrapperNode [2021-11-04 01:56:47,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 01:56:47,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 01:56:47,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 01:56:47,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 01:56:47,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 01:56:48,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 01:56:48,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 01:56:48,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 01:56:48,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 01:56:48,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 01:56:48,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 01:56:48,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 01:56:48,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (1/1) ... [2021-11-04 01:56:48,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 01:56:48,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 01:56:48,414 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-11-04 01:56:48,432 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-11-04 01:56:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-04 01:56:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 01:56:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 01:56:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 01:56:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 01:56:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 01:56:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-04 01:56:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 01:56:48,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 01:56:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 01:59:28,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 01:59:28,249 INFO L299 CfgBuilder]: Removed 344 assume(true) statements. [2021-11-04 01:59:28,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:59:28 BoogieIcfgContainer [2021-11-04 01:59:28,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 01:59:28,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 01:59:28,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 01:59:28,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 01:59:28,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 01:56:45" (1/3) ... [2021-11-04 01:59:28,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad102f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:59:28, skipping insertion in model container [2021-11-04 01:59:28,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:56:47" (2/3) ... [2021-11-04 01:59:28,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad102f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:59:28, skipping insertion in model container [2021-11-04 01:59:28,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:59:28" (3/3) ... [2021-11-04 01:59:28,257 INFO L111 eAbstractionObserver]: Analyzing ICFG main2_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2021-11-04 01:59:28,260 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 01:59:28,260 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2021-11-04 01:59:28,309 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 01:59:28,315 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-11-04 01:59:28,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-11-04 01:59:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 428 states have (on average 1.5093457943925233) internal successors, (646), 447 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 01:59:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-04 01:59:28,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 01:59:28,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-04 01:59:28,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 01:59:28,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 01:59:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 936147530, now seen corresponding path program 1 times [2021-11-04 01:59:28,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 01:59:28,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815585739] [2021-11-04 01:59:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 01:59:28,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 01:59:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 01:59:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 01:59:29,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 01:59:29,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815585739] [2021-11-04 01:59:29,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815585739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 01:59:29,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 01:59:29,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 01:59:29,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272015357] [2021-11-04 01:59:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 01:59:29,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 01:59:29,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 01:59:29,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 01:59:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 01:59:29,132 INFO L87 Difference]: Start difference. First operand has 448 states, 428 states have (on average 1.5093457943925233) internal successors, (646), 447 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 01:59:31,270 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:33,931 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:36,219 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:38,562 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:40,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:43,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:45,967 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:48,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:55,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:58,106 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 01:59:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 01:59:59,169 INFO L93 Difference]: Finished difference Result 878 states and 1274 transitions. [2021-11-04 01:59:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 01:59:59,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-04 01:59:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 01:59:59,201 INFO L225 Difference]: With dead ends: 878 [2021-11-04 01:59:59,205 INFO L226 Difference]: Without dead ends: 428 [2021-11-04 01:59:59,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.32ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 01:59:59,224 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28307.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.59ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29853.66ms IncrementalHoareTripleChecker+Time [2021-11-04 01:59:59,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1094 Unknown, 0 Unchecked, 25.59ms Time], IncrementalHoareTripleChecker [14 Valid, 1070 Invalid, 10 Unknown, 0 Unchecked, 29853.66ms Time] [2021-11-04 01:59:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-04 01:59:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-11-04 01:59:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 417 states have (on average 1.4556354916067147) internal successors, (607), 427 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 01:59:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 607 transitions. [2021-11-04 01:59:59,269 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 607 transitions. Word has length 6 [2021-11-04 01:59:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 01:59:59,269 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 607 transitions. [2021-11-04 01:59:59,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 01:59:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 607 transitions. [2021-11-04 01:59:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-04 01:59:59,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 01:59:59,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-04 01:59:59,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 01:59:59,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 01:59:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 01:59:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1044197774, now seen corresponding path program 1 times [2021-11-04 01:59:59,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 01:59:59,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838701846] [2021-11-04 01:59:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 01:59:59,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 01:59:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 01:59:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 01:59:59,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 01:59:59,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838701846] [2021-11-04 01:59:59,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838701846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 01:59:59,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 01:59:59,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 01:59:59,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141212364] [2021-11-04 01:59:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 01:59:59,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 01:59:59,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 01:59:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 01:59:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 01:59:59,561 INFO L87 Difference]: Start difference. First operand 428 states and 607 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:00:01,655 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:04,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:06,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:09,100 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:11,179 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:13,811 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:16,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:18,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:26,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:28,716 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:00:30,761 INFO L93 Difference]: Finished difference Result 619 states and 867 transitions. [2021-11-04 02:00:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:00:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-04 02:00:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:00:30,764 INFO L225 Difference]: With dead ends: 619 [2021-11-04 02:00:30,764 INFO L226 Difference]: Without dead ends: 617 [2021-11-04 02:00:30,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:00:30,767 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29494.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.96ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31059.43ms IncrementalHoareTripleChecker+Time [2021-11-04 02:00:30,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 1195 Unknown, 0 Unchecked, 14.96ms Time], IncrementalHoareTripleChecker [1 Valid, 1184 Invalid, 10 Unknown, 0 Unchecked, 31059.43ms Time] [2021-11-04 02:00:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-11-04 02:00:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 590. [2021-11-04 02:00:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 579 states have (on average 1.450777202072539) internal successors, (840), 589 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:00:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 840 transitions. [2021-11-04 02:00:30,803 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 840 transitions. Word has length 7 [2021-11-04 02:00:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:00:30,804 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 840 transitions. [2021-11-04 02:00:30,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:00:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 840 transitions. [2021-11-04 02:00:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-04 02:00:30,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:00:30,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:00:30,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 02:00:30,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:00:30,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:00:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1989607252, now seen corresponding path program 1 times [2021-11-04 02:00:30,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:00:30,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114398177] [2021-11-04 02:00:30,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:00:30,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:00:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:00:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:00:31,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:00:31,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114398177] [2021-11-04 02:00:31,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114398177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:00:31,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:00:31,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:00:31,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921059637] [2021-11-04 02:00:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:00:31,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:00:31,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:00:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:00:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:00:31,129 INFO L87 Difference]: Start difference. First operand 590 states and 840 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:00:33,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:36,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:38,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:40,769 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:42,846 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:45,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:48,073 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:50,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:00:58,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:00,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:01:02,429 INFO L93 Difference]: Finished difference Result 620 states and 868 transitions. [2021-11-04 02:01:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:01:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-04 02:01:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:01:02,433 INFO L225 Difference]: With dead ends: 620 [2021-11-04 02:01:02,433 INFO L226 Difference]: Without dead ends: 618 [2021-11-04 02:01:02,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.94ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:01:02,434 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29556.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.04ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31170.87ms IncrementalHoareTripleChecker+Time [2021-11-04 02:01:02,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 1198 Unknown, 0 Unchecked, 13.04ms Time], IncrementalHoareTripleChecker [1 Valid, 1187 Invalid, 10 Unknown, 0 Unchecked, 31170.87ms Time] [2021-11-04 02:01:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-11-04 02:01:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 591. [2021-11-04 02:01:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 580 states have (on average 1.45) internal successors, (841), 590 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 841 transitions. [2021-11-04 02:01:02,453 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 841 transitions. Word has length 8 [2021-11-04 02:01:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:01:02,454 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 841 transitions. [2021-11-04 02:01:02,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 841 transitions. [2021-11-04 02:01:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-04 02:01:02,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:01:02,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:01:02,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 02:01:02,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:01:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:01:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1548282556, now seen corresponding path program 1 times [2021-11-04 02:01:02,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:01:02,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642734095] [2021-11-04 02:01:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:01:02,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:01:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:01:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:01:02,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:01:02,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642734095] [2021-11-04 02:01:02,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642734095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:01:02,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:01:02,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:01:02,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637396609] [2021-11-04 02:01:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:01:02,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:01:02,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:01:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:01:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:01:02,763 INFO L87 Difference]: Start difference. First operand 591 states and 841 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:04,885 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:07,884 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:10,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:12,485 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:14,565 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:17,189 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:19,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:22,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:30,508 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:32,769 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:01:35,014 INFO L93 Difference]: Finished difference Result 621 states and 869 transitions. [2021-11-04 02:01:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:01:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-04 02:01:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:01:35,017 INFO L225 Difference]: With dead ends: 621 [2021-11-04 02:01:35,017 INFO L226 Difference]: Without dead ends: 619 [2021-11-04 02:01:35,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.99ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:01:35,018 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30495.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.65ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32125.71ms IncrementalHoareTripleChecker+Time [2021-11-04 02:01:35,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 1201 Unknown, 0 Unchecked, 11.65ms Time], IncrementalHoareTripleChecker [1 Valid, 1190 Invalid, 10 Unknown, 0 Unchecked, 32125.71ms Time] [2021-11-04 02:01:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-11-04 02:01:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 592. [2021-11-04 02:01:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 581 states have (on average 1.4492254733218588) internal successors, (842), 591 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 842 transitions. [2021-11-04 02:01:35,039 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 842 transitions. Word has length 9 [2021-11-04 02:01:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:01:35,039 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 842 transitions. [2021-11-04 02:01:35,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 842 transitions. [2021-11-04 02:01:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-04 02:01:35,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:01:35,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:01:35,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 02:01:35,043 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:01:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:01:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 752118878, now seen corresponding path program 1 times [2021-11-04 02:01:35,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:01:35,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845923650] [2021-11-04 02:01:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:01:35,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:01:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:01:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:01:35,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:01:35,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845923650] [2021-11-04 02:01:35,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845923650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:01:35,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:01:35,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:01:35,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528534479] [2021-11-04 02:01:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:01:35,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:01:35,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:01:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:01:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:01:35,353 INFO L87 Difference]: Start difference. First operand 592 states and 842 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:01:37,454 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:40,463 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:42,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:45,090 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:47,160 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:49,769 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:52,433 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:01:54,801 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:02,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:05,164 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:02:07,308 INFO L93 Difference]: Finished difference Result 622 states and 869 transitions. [2021-11-04 02:02:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:02:07,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-04 02:02:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:02:07,311 INFO L225 Difference]: With dead ends: 622 [2021-11-04 02:02:07,311 INFO L226 Difference]: Without dead ends: 615 [2021-11-04 02:02:07,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:02:07,312 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30161.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.95ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31837.06ms IncrementalHoareTripleChecker+Time [2021-11-04 02:02:07,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 1203 Unknown, 0 Unchecked, 8.95ms Time], IncrementalHoareTripleChecker [0 Valid, 1193 Invalid, 10 Unknown, 0 Unchecked, 31837.06ms Time] [2021-11-04 02:02:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-04 02:02:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 588. [2021-11-04 02:02:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 577 states have (on average 1.4506065857885615) internal successors, (837), 587 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 837 transitions. [2021-11-04 02:02:07,331 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 837 transitions. Word has length 10 [2021-11-04 02:02:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:02:07,332 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 837 transitions. [2021-11-04 02:02:07,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 837 transitions. [2021-11-04 02:02:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-04 02:02:07,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:02:07,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:02:07,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 02:02:07,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:02:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:02:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1686685008, now seen corresponding path program 1 times [2021-11-04 02:02:07,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:02:07,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443447058] [2021-11-04 02:02:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:02:07,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:02:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:02:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:02:07,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:02:07,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443447058] [2021-11-04 02:02:07,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443447058] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:02:07,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:02:07,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:02:07,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33714160] [2021-11-04 02:02:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:02:07,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 02:02:07,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:02:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 02:02:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 02:02:07,871 INFO L87 Difference]: Start difference. First operand 588 states and 837 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:09,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:13,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:15,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:18,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:21,200 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:24,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:26,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:29,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:38,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:41,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:02:44,382 INFO L93 Difference]: Finished difference Result 1205 states and 1703 transitions. [2021-11-04 02:02:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 02:02:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-04 02:02:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:02:44,385 INFO L225 Difference]: With dead ends: 1205 [2021-11-04 02:02:44,385 INFO L226 Difference]: Without dead ends: 619 [2021-11-04 02:02:44,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.41ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 02:02:44,387 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34358.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.66ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36358.71ms IncrementalHoareTripleChecker+Time [2021-11-04 02:02:44,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 1801 Unknown, 0 Unchecked, 16.66ms Time], IncrementalHoareTripleChecker [1 Valid, 1790 Invalid, 10 Unknown, 0 Unchecked, 36358.71ms Time] [2021-11-04 02:02:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-11-04 02:02:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 589. [2021-11-04 02:02:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 578 states have (on average 1.4498269896193772) internal successors, (838), 588 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 838 transitions. [2021-11-04 02:02:44,398 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 838 transitions. Word has length 22 [2021-11-04 02:02:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:02:44,398 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 838 transitions. [2021-11-04 02:02:44,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 838 transitions. [2021-11-04 02:02:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-04 02:02:44,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:02:44,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:02:44,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 02:02:44,400 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:02:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:02:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1019148295, now seen corresponding path program 1 times [2021-11-04 02:02:44,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:02:44,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457206540] [2021-11-04 02:02:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:02:44,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:02:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:02:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:02:44,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:02:44,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457206540] [2021-11-04 02:02:44,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457206540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:02:44,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:02:44,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:02:44,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899800303] [2021-11-04 02:02:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:02:44,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:02:44,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:02:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:02:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:02:44,842 INFO L87 Difference]: Start difference. First operand 589 states and 838 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:02:46,960 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:50,415 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:52,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:55,073 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:02:57,742 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:00,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:02,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:05,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:11,480 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:13,980 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:03:15,220 INFO L93 Difference]: Finished difference Result 608 states and 859 transitions. [2021-11-04 02:03:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:03:15,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-04 02:03:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:03:15,222 INFO L225 Difference]: With dead ends: 608 [2021-11-04 02:03:15,222 INFO L226 Difference]: Without dead ends: 598 [2021-11-04 02:03:15,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.45ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:03:15,223 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 15 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28678.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.66ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30298.96ms IncrementalHoareTripleChecker+Time [2021-11-04 02:03:15,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 1031 Unknown, 0 Unchecked, 6.66ms Time], IncrementalHoareTripleChecker [15 Valid, 1006 Invalid, 10 Unknown, 0 Unchecked, 30298.96ms Time] [2021-11-04 02:03:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-11-04 02:03:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2021-11-04 02:03:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 589 states have (on average 1.434634974533107) internal successors, (845), 597 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2021-11-04 02:03:15,234 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 24 [2021-11-04 02:03:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:03:15,235 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2021-11-04 02:03:15,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2021-11-04 02:03:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-04 02:03:15,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:03:15,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:03:15,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 02:03:15,236 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:03:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:03:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1516732346, now seen corresponding path program 1 times [2021-11-04 02:03:15,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:03:15,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012089658] [2021-11-04 02:03:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:03:15,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:03:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:03:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:03:15,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:03:15,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012089658] [2021-11-04 02:03:15,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012089658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:03:15,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:03:15,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:03:15,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990808293] [2021-11-04 02:03:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:03:15,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:03:15,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:03:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:03:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:03:15,586 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:17,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:21,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:23,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:25,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:28,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:31,022 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:33,179 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:36,198 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:42,442 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:45,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:03:46,619 INFO L93 Difference]: Finished difference Result 598 states and 845 transitions. [2021-11-04 02:03:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:03:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-04 02:03:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:03:46,622 INFO L225 Difference]: With dead ends: 598 [2021-11-04 02:03:46,622 INFO L226 Difference]: Without dead ends: 596 [2021-11-04 02:03:46,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.89ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:03:46,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 11 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29310.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.46ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30954.45ms IncrementalHoareTripleChecker+Time [2021-11-04 02:03:46,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 1039 Unknown, 0 Unchecked, 7.46ms Time], IncrementalHoareTripleChecker [11 Valid, 1018 Invalid, 10 Unknown, 0 Unchecked, 30954.45ms Time] [2021-11-04 02:03:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-04 02:03:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-04 02:03:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.433673469387755) internal successors, (843), 595 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 843 transitions. [2021-11-04 02:03:46,654 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 843 transitions. Word has length 24 [2021-11-04 02:03:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:03:46,654 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 843 transitions. [2021-11-04 02:03:46,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 843 transitions. [2021-11-04 02:03:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-04 02:03:46,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:03:46,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:03:46,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 02:03:46,656 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:03:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:03:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1372297908, now seen corresponding path program 1 times [2021-11-04 02:03:46,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:03:46,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646213749] [2021-11-04 02:03:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:03:46,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:03:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:03:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:03:47,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:03:47,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646213749] [2021-11-04 02:03:47,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646213749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:03:47,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:03:47,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:03:47,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431777362] [2021-11-04 02:03:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:03:47,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:03:47,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:03:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:03:47,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:03:47,015 INFO L87 Difference]: Start difference. First operand 596 states and 843 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:03:49,136 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:52,504 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:54,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:57,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:03:59,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:02,366 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:04,514 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:07,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:13,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:16,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:04:17,419 INFO L93 Difference]: Finished difference Result 596 states and 843 transitions. [2021-11-04 02:04:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:04:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-04 02:04:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:04:17,422 INFO L225 Difference]: With dead ends: 596 [2021-11-04 02:04:17,422 INFO L226 Difference]: Without dead ends: 594 [2021-11-04 02:04:17,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:04:17,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 11 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28874.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.73ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30327.18ms IncrementalHoareTripleChecker+Time [2021-11-04 02:04:17,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 1028 Unknown, 0 Unchecked, 7.73ms Time], IncrementalHoareTripleChecker [11 Valid, 1007 Invalid, 10 Unknown, 0 Unchecked, 30327.18ms Time] [2021-11-04 02:04:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-04 02:04:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-11-04 02:04:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 587 states have (on average 1.432708688245315) internal successors, (841), 593 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 841 transitions. [2021-11-04 02:04:17,433 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 841 transitions. Word has length 25 [2021-11-04 02:04:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:04:17,433 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 841 transitions. [2021-11-04 02:04:17,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 841 transitions. [2021-11-04 02:04:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-04 02:04:17,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:04:17,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:04:17,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 02:04:17,434 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:04:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:04:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash 785800736, now seen corresponding path program 1 times [2021-11-04 02:04:17,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:04:17,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380063846] [2021-11-04 02:04:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:04:17,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:04:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:04:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 02:04:17,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:04:17,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380063846] [2021-11-04 02:04:17,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380063846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:04:17,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:04:17,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:04:17,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507942383] [2021-11-04 02:04:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:04:17,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:04:17,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:04:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:04:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:04:17,744 INFO L87 Difference]: Start difference. First operand 594 states and 841 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:19,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:23,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:25,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:28,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:30,841 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:33,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:35,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:38,504 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:44,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:47,175 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:04:48,477 INFO L93 Difference]: Finished difference Result 598 states and 845 transitions. [2021-11-04 02:04:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:04:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-04 02:04:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:04:48,480 INFO L225 Difference]: With dead ends: 598 [2021-11-04 02:04:48,480 INFO L226 Difference]: Without dead ends: 596 [2021-11-04 02:04:48,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.96ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:04:48,480 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29004.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.33ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30657.74ms IncrementalHoareTripleChecker+Time [2021-11-04 02:04:48,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 1043 Unknown, 0 Unchecked, 6.33ms Time], IncrementalHoareTripleChecker [12 Valid, 1021 Invalid, 10 Unknown, 0 Unchecked, 30657.74ms Time] [2021-11-04 02:04:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-04 02:04:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2021-11-04 02:04:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 587 states have (on average 1.432708688245315) internal successors, (841), 593 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 841 transitions. [2021-11-04 02:04:48,490 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 841 transitions. Word has length 29 [2021-11-04 02:04:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:04:48,491 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 841 transitions. [2021-11-04 02:04:48,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 841 transitions. [2021-11-04 02:04:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 02:04:48,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:04:48,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:04:48,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 02:04:48,494 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:04:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:04:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1333436880, now seen corresponding path program 1 times [2021-11-04 02:04:48,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:04:48,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063554398] [2021-11-04 02:04:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:04:48,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:04:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:04:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 02:04:48,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:04:48,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063554398] [2021-11-04 02:04:48,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063554398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:04:48,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:04:48,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:04:48,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304293011] [2021-11-04 02:04:48,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:04:48,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:04:48,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:04:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:04:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:04:48,854 INFO L87 Difference]: Start difference. First operand 594 states and 841 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:04:50,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:54,433 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:56,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:04:59,103 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:01,860 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:04,326 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:06,488 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:09,527 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:15,173 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:17,693 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:05:19,049 INFO L93 Difference]: Finished difference Result 598 states and 845 transitions. [2021-11-04 02:05:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:05:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 02:05:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:05:19,052 INFO L225 Difference]: With dead ends: 598 [2021-11-04 02:05:19,052 INFO L226 Difference]: Without dead ends: 596 [2021-11-04 02:05:19,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.66ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:05:19,052 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28549.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.15ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30120.04ms IncrementalHoareTripleChecker+Time [2021-11-04 02:05:19,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 6.15ms Time], IncrementalHoareTripleChecker [12 Valid, 993 Invalid, 10 Unknown, 0 Unchecked, 30120.04ms Time] [2021-11-04 02:05:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-04 02:05:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2021-11-04 02:05:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 587 states have (on average 1.432708688245315) internal successors, (841), 593 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 841 transitions. [2021-11-04 02:05:19,062 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 841 transitions. Word has length 32 [2021-11-04 02:05:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:05:19,063 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 841 transitions. [2021-11-04 02:05:19,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 841 transitions. [2021-11-04 02:05:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 02:05:19,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:05:19,064 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:05:19,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 02:05:19,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:05:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:05:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash 713769163, now seen corresponding path program 1 times [2021-11-04 02:05:19,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:05:19,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641598754] [2021-11-04 02:05:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:05:19,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:05:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:05:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:05:19,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:05:19,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641598754] [2021-11-04 02:05:19,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641598754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:05:19,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:05:19,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:05:19,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254780272] [2021-11-04 02:05:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:05:19,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:05:19,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:05:19,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:05:19,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:05:19,384 INFO L87 Difference]: Start difference. First operand 594 states and 841 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:21,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:24,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:26,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:29,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:31,692 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:34,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:36,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:39,164 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:45,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:48,156 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:05:50,956 INFO L93 Difference]: Finished difference Result 814 states and 1148 transitions. [2021-11-04 02:05:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:05:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 02:05:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:05:50,959 INFO L225 Difference]: With dead ends: 814 [2021-11-04 02:05:50,960 INFO L226 Difference]: Without dead ends: 812 [2021-11-04 02:05:50,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.27ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:05:50,960 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29761.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.30ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31471.15ms IncrementalHoareTripleChecker+Time [2021-11-04 02:05:50,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 1179 Unknown, 0 Unchecked, 7.30ms Time], IncrementalHoareTripleChecker [1 Valid, 1168 Invalid, 10 Unknown, 0 Unchecked, 31471.15ms Time] [2021-11-04 02:05:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-11-04 02:05:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 797. [2021-11-04 02:05:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 790 states have (on average 1.429113924050633) internal successors, (1129), 796 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1129 transitions. [2021-11-04 02:05:50,973 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1129 transitions. Word has length 32 [2021-11-04 02:05:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:05:50,974 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1129 transitions. [2021-11-04 02:05:50,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1129 transitions. [2021-11-04 02:05:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 02:05:50,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:05:50,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:05:50,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 02:05:50,975 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:05:50,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:05:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1552875374, now seen corresponding path program 1 times [2021-11-04 02:05:50,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:05:50,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513427738] [2021-11-04 02:05:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:05:50,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:05:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:05:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 02:05:51,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:05:51,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513427738] [2021-11-04 02:05:51,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513427738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:05:51,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:05:51,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:05:51,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446505588] [2021-11-04 02:05:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:05:51,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:05:51,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:05:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:05:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:05:51,246 INFO L87 Difference]: Start difference. First operand 797 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:05:53,370 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:56,897 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:05:59,247 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:01,584 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:04,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:06,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:10,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:12,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:18,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:21,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:06:22,528 INFO L93 Difference]: Finished difference Result 1233 states and 1748 transitions. [2021-11-04 02:06:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:06:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 02:06:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:06:22,531 INFO L225 Difference]: With dead ends: 1233 [2021-11-04 02:06:22,531 INFO L226 Difference]: Without dead ends: 802 [2021-11-04 02:06:22,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.66ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:06:22,532 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29524.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31203.54ms IncrementalHoareTripleChecker+Time [2021-11-04 02:06:22,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 1187 Unknown, 0 Unchecked, 6.33ms Time], IncrementalHoareTripleChecker [0 Valid, 1177 Invalid, 10 Unknown, 0 Unchecked, 31203.54ms Time] [2021-11-04 02:06:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-11-04 02:06:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 798. [2021-11-04 02:06:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 791 states have (on average 1.4285714285714286) internal successors, (1130), 797 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1130 transitions. [2021-11-04 02:06:22,543 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1130 transitions. Word has length 32 [2021-11-04 02:06:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:06:22,544 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1130 transitions. [2021-11-04 02:06:22,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1130 transitions. [2021-11-04 02:06:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 02:06:22,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:06:22,545 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:06:22,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 02:06:22,545 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:06:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:06:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1308313738, now seen corresponding path program 1 times [2021-11-04 02:06:22,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:06:22,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522274191] [2021-11-04 02:06:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:06:22,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:06:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:06:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:06:22,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:06:22,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522274191] [2021-11-04 02:06:22,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522274191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:06:22,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:06:22,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:06:22,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221001682] [2021-11-04 02:06:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:06:22,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:06:22,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:06:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:06:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:06:22,876 INFO L87 Difference]: Start difference. First operand 798 states and 1130 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:24,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:27,844 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:30,176 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:32,487 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:35,146 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:37,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:40,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:43,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:48,502 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:51,473 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:06:54,040 INFO L93 Difference]: Finished difference Result 1014 states and 1427 transitions. [2021-11-04 02:06:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:06:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 02:06:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:06:54,044 INFO L225 Difference]: With dead ends: 1014 [2021-11-04 02:06:54,044 INFO L226 Difference]: Without dead ends: 1012 [2021-11-04 02:06:54,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.72ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:06:54,045 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29443.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.60ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31058.38ms IncrementalHoareTripleChecker+Time [2021-11-04 02:06:54,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1182 Unknown, 0 Unchecked, 7.60ms Time], IncrementalHoareTripleChecker [1 Valid, 1171 Invalid, 10 Unknown, 0 Unchecked, 31058.38ms Time] [2021-11-04 02:06:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-11-04 02:06:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 991. [2021-11-04 02:06:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 984 states have (on average 1.4247967479674797) internal successors, (1402), 990 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1402 transitions. [2021-11-04 02:06:54,079 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1402 transitions. Word has length 32 [2021-11-04 02:06:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:06:54,080 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 1402 transitions. [2021-11-04 02:06:54,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1402 transitions. [2021-11-04 02:06:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-04 02:06:54,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:06:54,095 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:06:54,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 02:06:54,096 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:06:54,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:06:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 652007451, now seen corresponding path program 1 times [2021-11-04 02:06:54,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:06:54,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418483647] [2021-11-04 02:06:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:06:54,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:06:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:06:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:06:54,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:06:54,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418483647] [2021-11-04 02:06:54,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418483647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:06:54,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:06:54,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:06:54,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806213707] [2021-11-04 02:06:54,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:06:54,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:06:54,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:06:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:06:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:06:54,463 INFO L87 Difference]: Start difference. First operand 991 states and 1402 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:06:56,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:06:59,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:01,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:04,148 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:06,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:09,229 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:12,225 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:14,898 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:19,927 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:23,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:07:25,968 INFO L93 Difference]: Finished difference Result 1017 states and 1430 transitions. [2021-11-04 02:07:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:07:25,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-04 02:07:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:07:25,971 INFO L225 Difference]: With dead ends: 1017 [2021-11-04 02:07:25,971 INFO L226 Difference]: Without dead ends: 1015 [2021-11-04 02:07:25,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:07:25,972 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 277 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29713.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31401.27ms IncrementalHoareTripleChecker+Time [2021-11-04 02:07:25,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 0 Invalid, 1182 Unknown, 0 Unchecked, 7.44ms Time], IncrementalHoareTripleChecker [1 Valid, 1171 Invalid, 10 Unknown, 0 Unchecked, 31401.27ms Time] [2021-11-04 02:07:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-04 02:07:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 994. [2021-11-04 02:07:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 987 states have (on average 1.4235055724417427) internal successors, (1405), 993 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:07:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1405 transitions. [2021-11-04 02:07:25,988 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1405 transitions. Word has length 33 [2021-11-04 02:07:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:07:25,988 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1405 transitions. [2021-11-04 02:07:25,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:07:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1405 transitions. [2021-11-04 02:07:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-04 02:07:25,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:07:25,990 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:07:25,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 02:07:25,990 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:07:25,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:07:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2079320712, now seen corresponding path program 1 times [2021-11-04 02:07:25,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:07:25,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574622059] [2021-11-04 02:07:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:07:25,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:07:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:07:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:07:26,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:07:26,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574622059] [2021-11-04 02:07:26,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574622059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:07:26,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:07:26,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:07:26,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428586507] [2021-11-04 02:07:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:07:26,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:07:26,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:07:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:07:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:07:26,297 INFO L87 Difference]: Start difference. First operand 994 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:07:28,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:31,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:33,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:36,105 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:38,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:41,226 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:44,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:46,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:51,999 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:54,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:07:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:07:57,746 INFO L93 Difference]: Finished difference Result 1219 states and 1714 transitions. [2021-11-04 02:07:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:07:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-04 02:07:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:07:57,750 INFO L225 Difference]: With dead ends: 1219 [2021-11-04 02:07:57,750 INFO L226 Difference]: Without dead ends: 1217 [2021-11-04 02:07:57,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.26ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:07:57,751 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29631.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.65ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31341.74ms IncrementalHoareTripleChecker+Time [2021-11-04 02:07:57,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 1182 Unknown, 0 Unchecked, 7.65ms Time], IncrementalHoareTripleChecker [1 Valid, 1171 Invalid, 10 Unknown, 0 Unchecked, 31341.74ms Time] [2021-11-04 02:07:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-11-04 02:07:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1191. [2021-11-04 02:07:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1184 states have (on average 1.4222972972972974) internal successors, (1684), 1190 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:07:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1684 transitions. [2021-11-04 02:07:57,794 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1684 transitions. Word has length 33 [2021-11-04 02:07:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:07:57,794 INFO L470 AbstractCegarLoop]: Abstraction has 1191 states and 1684 transitions. [2021-11-04 02:07:57,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:07:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1684 transitions. [2021-11-04 02:07:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-04 02:07:57,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:07:57,812 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:07:57,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 02:07:57,812 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:07:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:07:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1903020092, now seen corresponding path program 1 times [2021-11-04 02:07:57,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:07:57,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396106991] [2021-11-04 02:07:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:07:57,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:07:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:07:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:07:58,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:07:58,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396106991] [2021-11-04 02:07:58,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396106991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:07:58,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:07:58,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:07:58,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051323031] [2021-11-04 02:07:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:07:58,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:07:58,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:07:58,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:07:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:07:58,243 INFO L87 Difference]: Start difference. First operand 1191 states and 1684 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:08:00,430 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:03,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:05,679 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:08,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:10,687 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:13,136 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:16,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:18,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:24,044 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:27,062 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:08:29,696 INFO L93 Difference]: Finished difference Result 1220 states and 1715 transitions. [2021-11-04 02:08:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:08:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-04 02:08:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:08:29,699 INFO L225 Difference]: With dead ends: 1220 [2021-11-04 02:08:29,699 INFO L226 Difference]: Without dead ends: 1218 [2021-11-04 02:08:29,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:08:29,700 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29648.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.31ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31348.63ms IncrementalHoareTripleChecker+Time [2021-11-04 02:08:29,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 0 Invalid, 1186 Unknown, 0 Unchecked, 7.31ms Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 10 Unknown, 0 Unchecked, 31348.63ms Time] [2021-11-04 02:08:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-11-04 02:08:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1191. [2021-11-04 02:08:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1184 states have (on average 1.4222972972972974) internal successors, (1684), 1190 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:08:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1684 transitions. [2021-11-04 02:08:29,716 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1684 transitions. Word has length 33 [2021-11-04 02:08:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:08:29,716 INFO L470 AbstractCegarLoop]: Abstraction has 1191 states and 1684 transitions. [2021-11-04 02:08:29,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:08:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1684 transitions. [2021-11-04 02:08:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 02:08:29,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:08:29,718 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:08:29,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 02:08:29,718 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:08:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:08:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1262605611, now seen corresponding path program 1 times [2021-11-04 02:08:29,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:08:29,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953101337] [2021-11-04 02:08:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:08:29,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:08:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:08:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:08:30,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:08:30,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953101337] [2021-11-04 02:08:30,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953101337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:08:30,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:08:30,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:08:30,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486330209] [2021-11-04 02:08:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:08:30,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:08:30,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:08:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:08:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:08:30,048 INFO L87 Difference]: Start difference. First operand 1191 states and 1684 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:08:32,177 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:35,161 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:37,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:39,828 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:42,538 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:44,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:47,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:50,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:55,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:08:58,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:09:01,671 INFO L93 Difference]: Finished difference Result 1223 states and 1718 transitions. [2021-11-04 02:09:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:09:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-04 02:09:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:09:01,675 INFO L225 Difference]: With dead ends: 1223 [2021-11-04 02:09:01,675 INFO L226 Difference]: Without dead ends: 1221 [2021-11-04 02:09:01,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.11ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:09:01,677 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 274 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29855.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.37ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31517.61ms IncrementalHoareTripleChecker+Time [2021-11-04 02:09:01,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 0 Invalid, 1185 Unknown, 0 Unchecked, 7.37ms Time], IncrementalHoareTripleChecker [1 Valid, 1174 Invalid, 10 Unknown, 0 Unchecked, 31517.61ms Time] [2021-11-04 02:09:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2021-11-04 02:09:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1195. [2021-11-04 02:09:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1188 states have (on average 1.4208754208754208) internal successors, (1688), 1194 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1688 transitions. [2021-11-04 02:09:01,696 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1688 transitions. Word has length 34 [2021-11-04 02:09:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:09:01,696 INFO L470 AbstractCegarLoop]: Abstraction has 1195 states and 1688 transitions. [2021-11-04 02:09:01,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1688 transitions. [2021-11-04 02:09:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 02:09:01,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:09:01,697 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:09:01,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 02:09:01,697 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:09:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:09:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash 34432510, now seen corresponding path program 1 times [2021-11-04 02:09:01,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:09:01,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816749697] [2021-11-04 02:09:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:09:01,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:09:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:09:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:09:02,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:09:02,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816749697] [2021-11-04 02:09:02,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816749697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:09:02,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:09:02,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:09:02,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329265951] [2021-11-04 02:09:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:09:02,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:09:02,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:09:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:09:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:09:02,002 INFO L87 Difference]: Start difference. First operand 1195 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:04,125 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:07,022 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:09,370 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:11,664 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:14,387 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:16,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:19,981 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:22,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:27,892 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:30,792 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:09:33,518 INFO L93 Difference]: Finished difference Result 1222 states and 1717 transitions. [2021-11-04 02:09:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:09:33,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-04 02:09:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:09:33,522 INFO L225 Difference]: With dead ends: 1222 [2021-11-04 02:09:33,522 INFO L226 Difference]: Without dead ends: 1220 [2021-11-04 02:09:33,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.02ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:09:33,526 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29734.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.37ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31408.29ms IncrementalHoareTripleChecker+Time [2021-11-04 02:09:33,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 1186 Unknown, 0 Unchecked, 7.37ms Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 10 Unknown, 0 Unchecked, 31408.29ms Time] [2021-11-04 02:09:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-11-04 02:09:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1193. [2021-11-04 02:09:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1186 states have (on average 1.4215851602023608) internal successors, (1686), 1192 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1686 transitions. [2021-11-04 02:09:33,549 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1686 transitions. Word has length 34 [2021-11-04 02:09:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:09:33,549 INFO L470 AbstractCegarLoop]: Abstraction has 1193 states and 1686 transitions. [2021-11-04 02:09:33,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1686 transitions. [2021-11-04 02:09:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 02:09:33,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:09:33,550 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:09:33,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 02:09:33,551 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:09:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:09:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1135919404, now seen corresponding path program 1 times [2021-11-04 02:09:33,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:09:33,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094717414] [2021-11-04 02:09:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:09:33,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:09:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:09:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:09:33,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:09:33,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094717414] [2021-11-04 02:09:33,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094717414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:09:33,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:09:33,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:09:33,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188242966] [2021-11-04 02:09:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:09:33,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:09:33,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:09:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:09:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:09:33,922 INFO L87 Difference]: Start difference. First operand 1193 states and 1686 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:09:36,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:39,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:41,413 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:43,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:46,432 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:48,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:52,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:09:54,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:00,875 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:04,135 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:10:07,547 INFO L93 Difference]: Finished difference Result 1223 states and 1718 transitions. [2021-11-04 02:10:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:10:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-04 02:10:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:10:07,550 INFO L225 Difference]: With dead ends: 1223 [2021-11-04 02:10:07,551 INFO L226 Difference]: Without dead ends: 1221 [2021-11-04 02:10:07,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:10:07,552 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31725.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.75ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33513.27ms IncrementalHoareTripleChecker+Time [2021-11-04 02:10:07,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 1190 Unknown, 0 Unchecked, 7.75ms Time], IncrementalHoareTripleChecker [1 Valid, 1179 Invalid, 10 Unknown, 0 Unchecked, 33513.27ms Time] [2021-11-04 02:10:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2021-11-04 02:10:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1193. [2021-11-04 02:10:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1186 states have (on average 1.4215851602023608) internal successors, (1686), 1192 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1686 transitions. [2021-11-04 02:10:07,572 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1686 transitions. Word has length 34 [2021-11-04 02:10:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:10:07,572 INFO L470 AbstractCegarLoop]: Abstraction has 1193 states and 1686 transitions. [2021-11-04 02:10:07,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1686 transitions. [2021-11-04 02:10:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 02:10:07,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:10:07,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:10:07,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 02:10:07,574 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:10:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:10:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1657451433, now seen corresponding path program 1 times [2021-11-04 02:10:07,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:10:07,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902619415] [2021-11-04 02:10:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:10:07,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:10:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:10:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 02:10:07,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:10:07,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902619415] [2021-11-04 02:10:07,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902619415] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:10:07,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:10:07,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:10:07,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001578325] [2021-11-04 02:10:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:10:07,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:10:07,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:10:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:10:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:10:07,942 INFO L87 Difference]: Start difference. First operand 1193 states and 1686 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:10,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:13,682 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:16,033 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:18,377 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:21,185 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:23,684 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:26,932 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:29,677 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:34,168 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:36,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:10:38,453 INFO L93 Difference]: Finished difference Result 1193 states and 1686 transitions. [2021-11-04 02:10:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:10:38,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-04 02:10:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:10:38,457 INFO L225 Difference]: With dead ends: 1193 [2021-11-04 02:10:38,457 INFO L226 Difference]: Without dead ends: 1191 [2021-11-04 02:10:38,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:10:38,458 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 11 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28795.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.14ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30429.21ms IncrementalHoareTripleChecker+Time [2021-11-04 02:10:38,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 967 Unknown, 0 Unchecked, 6.14ms Time], IncrementalHoareTripleChecker [11 Valid, 946 Invalid, 10 Unknown, 0 Unchecked, 30429.21ms Time] [2021-11-04 02:10:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2021-11-04 02:10:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1189. [2021-11-04 02:10:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1183 states have (on average 1.4218089602704986) internal successors, (1682), 1188 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1682 transitions. [2021-11-04 02:10:38,478 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1682 transitions. Word has length 35 [2021-11-04 02:10:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:10:38,478 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 1682 transitions. [2021-11-04 02:10:38,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1682 transitions. [2021-11-04 02:10:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 02:10:38,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:10:38,479 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:10:38,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 02:10:38,479 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:10:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:10:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -486068379, now seen corresponding path program 1 times [2021-11-04 02:10:38,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:10:38,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043488165] [2021-11-04 02:10:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:10:38,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:10:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:10:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:10:38,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:10:38,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043488165] [2021-11-04 02:10:38,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043488165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:10:38,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:10:38,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:10:38,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803406653] [2021-11-04 02:10:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:10:38,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:10:38,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:10:38,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:10:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:10:38,860 INFO L87 Difference]: Start difference. First operand 1189 states and 1682 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:10:40,989 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:44,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:46,354 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:48,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:51,380 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:53,828 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:56,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:10:59,511 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:11:04,741 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:11:07,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 02:11:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 02:11:10,978 INFO L93 Difference]: Finished difference Result 1222 states and 1716 transitions. [2021-11-04 02:11:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 02:11:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-04 02:11:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 02:11:10,982 INFO L225 Difference]: With dead ends: 1222 [2021-11-04 02:11:10,982 INFO L226 Difference]: Without dead ends: 1215 [2021-11-04 02:11:10,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.88ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:11:10,983 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30208.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32010.87ms IncrementalHoareTripleChecker+Time [2021-11-04 02:11:10,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 1183 Unknown, 0 Unchecked, 7.15ms Time], IncrementalHoareTripleChecker [0 Valid, 1173 Invalid, 10 Unknown, 0 Unchecked, 32010.87ms Time] [2021-11-04 02:11:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-11-04 02:11:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1189. [2021-11-04 02:11:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1183 states have (on average 1.4209636517328825) internal successors, (1681), 1188 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:11:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1681 transitions. [2021-11-04 02:11:11,002 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1681 transitions. Word has length 35 [2021-11-04 02:11:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 02:11:11,002 INFO L470 AbstractCegarLoop]: Abstraction has 1189 states and 1681 transitions. [2021-11-04 02:11:11,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:11:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1681 transitions. [2021-11-04 02:11:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 02:11:11,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 02:11:11,003 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 02:11:11,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 02:11:11,004 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2021-11-04 02:11:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 02:11:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1067407698, now seen corresponding path program 1 times [2021-11-04 02:11:11,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 02:11:11,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944834432] [2021-11-04 02:11:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 02:11:11,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 02:11:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 02:11:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 02:11:11,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 02:11:11,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944834432] [2021-11-04 02:11:11,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944834432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 02:11:11,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 02:11:11,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 02:11:11,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750088636] [2021-11-04 02:11:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 02:11:11,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 02:11:11,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 02:11:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 02:11:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 02:11:11,354 INFO L87 Difference]: Start difference. First operand 1189 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 02:11:13,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15