./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.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-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 00:09:28,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 00:09:28,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 00:09:28,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 00:09:28,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 00:09:28,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 00:09:28,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 00:09:28,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 00:09:28,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 00:09:28,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 00:09:28,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 00:09:28,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 00:09:28,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 00:09:28,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 00:09:28,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 00:09:28,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 00:09:28,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 00:09:28,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 00:09:28,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 00:09:28,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 00:09:28,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 00:09:28,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 00:09:28,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 00:09:28,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 00:09:28,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 00:09:28,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 00:09:28,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 00:09:28,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 00:09:28,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 00:09:28,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 00:09:28,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 00:09:28,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 00:09:28,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 00:09:28,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 00:09:28,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 00:09:28,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 00:09:28,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 00:09:28,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 00:09:28,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 00:09:28,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 00:09:28,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 00:09:28,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 00:09:28,561 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 00:09:28,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 00:09:28,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 00:09:28,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 00:09:28,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 00:09:28,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 00:09:28,565 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 00:09:28,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 00:09:28,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 00:09:28,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 00:09:28,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 00:09:28,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 00:09:28,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 00:09:28,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 00:09:28,568 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 00:09:28,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 00:09:28,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 00:09:28,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 00:09:28,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 00:09:28,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:09:28,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 00:09:28,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 00:09:28,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 00:09:28,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 00:09:28,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 00:09:28,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 00:09:28,570 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 00:09:28,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 00:09:28,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 00:09:28,571 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-04 00:09:28,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 00:09:28,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 00:09:28,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 00:09:28,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 00:09:28,884 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 00:09:28,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:09:28,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fa15d4f/9635702eac4f454d8115a3aeb326ef76/FLAGa5d235e17 [2021-11-04 00:09:29,691 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 00:09:29,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:09:29,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fa15d4f/9635702eac4f454d8115a3aeb326ef76/FLAGa5d235e17 [2021-11-04 00:09:29,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fa15d4f/9635702eac4f454d8115a3aeb326ef76 [2021-11-04 00:09:29,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 00:09:29,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 00:09:29,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 00:09:29,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 00:09:29,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 00:09:29,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:09:29" (1/1) ... [2021-11-04 00:09:29,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdf77c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:29, skipping insertion in model container [2021-11-04 00:09:29,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:09:29" (1/1) ... [2021-11-04 00:09:29,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 00:09:29,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 00:09:31,038 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-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-04 00:09:31,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:09:31,111 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 00:09:31,383 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-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-04 00:09:31,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:09:31,550 INFO L208 MainTranslator]: Completed translation [2021-11-04 00:09:31,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31 WrapperNode [2021-11-04 00:09:31,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 00:09:31,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 00:09:31,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 00:09:31,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 00:09:31,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 00:09:31,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 00:09:31,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 00:09:31,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 00:09:31,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 00:09:31,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 00:09:31,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 00:09:31,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 00:09:31,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (1/1) ... [2021-11-04 00:09:31,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:09:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:09:31,925 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 00:09:31,938 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 00:09:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 00:09:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 00:09:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 00:09:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 00:09:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 00:09:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 00:09:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 00:09:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 00:09:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 00:09:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 00:09:32,396 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:09:33,577 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-04 00:09:33,578 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-04 00:09:33,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 00:09:33,598 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-04 00:09:33,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:33 BoogieIcfgContainer [2021-11-04 00:09:33,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 00:09:33,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 00:09:33,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 00:09:33,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 00:09:33,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:09:29" (1/3) ... [2021-11-04 00:09:33,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e83af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:09:33, skipping insertion in model container [2021-11-04 00:09:33,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:31" (2/3) ... [2021-11-04 00:09:33,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e83af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:09:33, skipping insertion in model container [2021-11-04 00:09:33,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:33" (3/3) ... [2021-11-04 00:09:33,612 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:09:33,617 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 00:09:33,618 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-04 00:09:33,672 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 00:09:33,680 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 00:09:33,680 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-04 00:09:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 00:09:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-04 00:09:33,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:33,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:33,718 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:09:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-04 00:09:33,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:33,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699663350] [2021-11-04 00:09:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:33,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:34,190 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 00:09:34,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:34,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699663350] [2021-11-04 00:09:34,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699663350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:34,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:34,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:09:34,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939704828] [2021-11-04 00:09:34,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:34,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:34,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:34,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:34,235 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 3.3333333333333335) internal successors, (10), 2 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 00:09:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:38,810 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2021-11-04 00:09:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 00:09:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:38,828 INFO L225 Difference]: With dead ends: 1189 [2021-11-04 00:09:38,828 INFO L226 Difference]: Without dead ends: 765 [2021-11-04 00:09:38,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:38,835 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 503 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4052.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.61ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4429.47ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:38,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 18 Invalid, 1028 Unknown, 0 Unchecked, 11.61ms Time], IncrementalHoareTripleChecker [7 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 4429.47ms Time] [2021-11-04 00:09:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-04 00:09:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2021-11-04 00:09:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 736 states have (on average 1.327445652173913) internal successors, (977), 746 states have internal predecessors, (977), 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 00:09:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2021-11-04 00:09:38,910 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2021-11-04 00:09:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:38,910 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2021-11-04 00:09:38,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 00:09:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2021-11-04 00:09:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-04 00:09:38,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:38,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:38,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 00:09:38,912 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:09:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-04 00:09:38,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:38,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373903889] [2021-11-04 00:09:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:38,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:38,994 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 00:09:38,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:38,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373903889] [2021-11-04 00:09:38,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373903889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:38,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:38,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:09:38,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637205093] [2021-11-04 00:09:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:38,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:38,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:38,998 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 00:09:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:43,300 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2021-11-04 00:09:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-04 00:09:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:43,307 INFO L225 Difference]: With dead ends: 2217 [2021-11-04 00:09:43,308 INFO L226 Difference]: Without dead ends: 1475 [2021-11-04 00:09:43,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.78ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:43,312 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 487 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3919.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4206.36ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:43,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 0 Invalid, 1005 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [3 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 4206.36ms Time] [2021-11-04 00:09:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-04 00:09:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2021-11-04 00:09:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1435 states have (on average 1.3261324041811846) internal successors, (1903), 1445 states have internal predecessors, (1903), 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 00:09:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2021-11-04 00:09:43,363 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2021-11-04 00:09:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:43,364 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2021-11-04 00:09:43,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 00:09:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2021-11-04 00:09:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 00:09:43,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:43,367 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, 1, 1, 1] [2021-11-04 00:09:43,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 00:09:43,367 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:09:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-04 00:09:43,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:43,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368069756] [2021-11-04 00:09:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:43,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:43,503 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 00:09:43,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:43,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368069756] [2021-11-04 00:09:43,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368069756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:43,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:43,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:09:43,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335418427] [2021-11-04 00:09:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:43,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:43,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:43,508 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 00:09:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:46,474 INFO L93 Difference]: Finished difference Result 3924 states and 5208 transitions. [2021-11-04 00:09:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-11-04 00:09:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:46,486 INFO L225 Difference]: With dead ends: 3924 [2021-11-04 00:09:46,487 INFO L226 Difference]: Without dead ends: 2485 [2021-11-04 00:09:46,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:46,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 453 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2597.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2843.30ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:46,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [5 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 2843.30ms Time] [2021-11-04 00:09:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2021-11-04 00:09:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2453. [2021-11-04 00:09:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2442 states have (on average 1.341932841932842) internal successors, (3277), 2452 states have internal predecessors, (3277), 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 00:09:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3277 transitions. [2021-11-04 00:09:46,614 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3277 transitions. Word has length 38 [2021-11-04 00:09:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:46,615 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 3277 transitions. [2021-11-04 00:09:46,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 00:09:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3277 transitions. [2021-11-04 00:09:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 00:09:46,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:46,622 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:46,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 00:09:46,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:09:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389857, now seen corresponding path program 1 times [2021-11-04 00:09:46,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:46,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075783570] [2021-11-04 00:09:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:46,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:09:46,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:46,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075783570] [2021-11-04 00:09:46,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075783570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:46,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:46,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:09:46,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196354031] [2021-11-04 00:09:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:46,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:09:46,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:09:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:09:46,771 INFO L87 Difference]: Start difference. First operand 2453 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 00:09:48,711 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:09:51,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:09:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:54,476 INFO L93 Difference]: Finished difference Result 7327 states and 9781 transitions. [2021-11-04 00:09:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:09:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2021-11-04 00:09:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:54,498 INFO L225 Difference]: With dead ends: 7327 [2021-11-04 00:09:54,498 INFO L226 Difference]: Without dead ends: 4882 [2021-11-04 00:09:54,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:09:54,506 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 979 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7070.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7529.48ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:54,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 0 Invalid, 1875 Unknown, 0 Unchecked, 10.44ms Time], IncrementalHoareTripleChecker [1 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 7529.48ms Time] [2021-11-04 00:09:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2021-11-04 00:09:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 2469. [2021-11-04 00:09:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2458 states have (on average 1.339707078925956) internal successors, (3293), 2468 states have internal predecessors, (3293), 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 00:09:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3293 transitions. [2021-11-04 00:09:54,616 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3293 transitions. Word has length 41 [2021-11-04 00:09:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:54,616 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 3293 transitions. [2021-11-04 00:09:54,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 00:09:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3293 transitions. [2021-11-04 00:09:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 00:09:54,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:54,620 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:54,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 00:09:54,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:09:54,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1996940455, now seen corresponding path program 1 times [2021-11-04 00:09:54,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:54,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704635408] [2021-11-04 00:09:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:54,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:09:54,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:54,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704635408] [2021-11-04 00:09:54,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704635408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:54,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:54,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:09:54,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97165740] [2021-11-04 00:09:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:54,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:09:54,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:09:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:09:54,742 INFO L87 Difference]: Start difference. First operand 2469 states and 3293 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:09:57,179 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:02,652 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 00:10:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:03,065 INFO L93 Difference]: Finished difference Result 6436 states and 8613 transitions. [2021-11-04 00:10:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:10:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-04 00:10:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:03,082 INFO L225 Difference]: With dead ends: 6436 [2021-11-04 00:10:03,082 INFO L226 Difference]: Without dead ends: 3975 [2021-11-04 00:10:03,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:03,089 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 572 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7730.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.01ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8155.93ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:03,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 0 Invalid, 1800 Unknown, 0 Unchecked, 7.01ms Time], IncrementalHoareTripleChecker [0 Valid, 1798 Invalid, 2 Unknown, 0 Unchecked, 8155.93ms Time] [2021-11-04 00:10:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2021-11-04 00:10:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2485. [2021-11-04 00:10:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2474 states have (on average 1.3375101050929668) internal successors, (3309), 2484 states have internal predecessors, (3309), 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 00:10:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3309 transitions. [2021-11-04 00:10:03,206 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3309 transitions. Word has length 42 [2021-11-04 00:10:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:03,207 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 3309 transitions. [2021-11-04 00:10:03,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:10:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3309 transitions. [2021-11-04 00:10:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 00:10:03,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:03,215 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:10:03,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 00:10:03,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:10:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -942849768, now seen corresponding path program 1 times [2021-11-04 00:10:03,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:03,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296924301] [2021-11-04 00:10:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:03,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:03,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:03,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296924301] [2021-11-04 00:10:03,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296924301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:03,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:03,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:03,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534365715] [2021-11-04 00:10:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:03,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:03,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:03,350 INFO L87 Difference]: Start difference. First operand 2485 states and 3309 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:10:06,411 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:08,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 00:10:12,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:13,208 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:15,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:17,227 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:24,969 INFO L93 Difference]: Finished difference Result 13586 states and 18045 transitions. [2021-11-04 00:10:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 00:10:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-04 00:10:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:25,019 INFO L225 Difference]: With dead ends: 13586 [2021-11-04 00:10:25,019 INFO L226 Difference]: Without dead ends: 12316 [2021-11-04 00:10:25,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 47.17ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:10:25,028 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3034 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20022.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.45ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21086.10ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:25,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3034 Valid, 0 Invalid, 4358 Unknown, 0 Unchecked, 16.45ms Time], IncrementalHoareTripleChecker [25 Valid, 4331 Invalid, 2 Unknown, 0 Unchecked, 21086.10ms Time] [2021-11-04 00:10:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2021-11-04 00:10:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 2545. [2021-11-04 00:10:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2534 states have (on average 1.329518547750592) internal successors, (3369), 2544 states have internal predecessors, (3369), 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 00:10:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3369 transitions. [2021-11-04 00:10:25,237 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3369 transitions. Word has length 42 [2021-11-04 00:10:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:25,239 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 3369 transitions. [2021-11-04 00:10:25,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:10:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3369 transitions. [2021-11-04 00:10:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 00:10:25,240 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:25,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:10:25,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 00:10:25,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:10:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1763769626, now seen corresponding path program 1 times [2021-11-04 00:10:25,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:25,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925144541] [2021-11-04 00:10:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:25,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:25,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:25,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925144541] [2021-11-04 00:10:25,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925144541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:25,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:25,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 00:10:25,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747020260] [2021-11-04 00:10:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:25,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:10:25,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:10:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:10:25,411 INFO L87 Difference]: Start difference. First operand 2545 states and 3369 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:10:28,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:10:36,729 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 00:10:40,771 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 00:10:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:48,991 INFO L93 Difference]: Finished difference Result 18627 states and 25013 transitions. [2021-11-04 00:10:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-04 00:10:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-04 00:10:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:49,025 INFO L225 Difference]: With dead ends: 18627 [2021-11-04 00:10:49,026 INFO L226 Difference]: Without dead ends: 16090 [2021-11-04 00:10:49,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 130.81ms TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-04 00:10:49,036 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3892 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 10166 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21058.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3892 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.77ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 10166 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22661.14ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:49,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3892 Valid, 0 Invalid, 10190 Unknown, 0 Unchecked, 24.77ms Time], IncrementalHoareTripleChecker [21 Valid, 10166 Invalid, 3 Unknown, 0 Unchecked, 22661.14ms Time] [2021-11-04 00:10:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16090 states. [2021-11-04 00:10:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16090 to 2523. [2021-11-04 00:10:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2512 states have (on average 1.3244426751592357) internal successors, (3327), 2522 states have internal predecessors, (3327), 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 00:10:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3327 transitions. [2021-11-04 00:10:49,310 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3327 transitions. Word has length 42 [2021-11-04 00:10:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:49,311 INFO L470 AbstractCegarLoop]: Abstraction has 2523 states and 3327 transitions. [2021-11-04 00:10:49,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:10:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3327 transitions. [2021-11-04 00:10:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-04 00:10:49,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:49,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:10:49,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 00:10:49,314 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:10:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1882537444, now seen corresponding path program 1 times [2021-11-04 00:10:49,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:49,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044724476] [2021-11-04 00:10:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:49,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:49,417 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 00:10:49,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:49,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044724476] [2021-11-04 00:10:49,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044724476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:49,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:49,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:10:49,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754388421] [2021-11-04 00:10:49,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:49,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:10:49,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:10:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:10:49,422 INFO L87 Difference]: Start difference. First operand 2523 states and 3327 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 00:10:58,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:01,356 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:01,940 INFO L93 Difference]: Finished difference Result 8648 states and 11424 transitions. [2021-11-04 00:11:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:11:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2021-11-04 00:11:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:01,955 INFO L225 Difference]: With dead ends: 8648 [2021-11-04 00:11:01,956 INFO L226 Difference]: Without dead ends: 6133 [2021-11-04 00:11:01,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:01,965 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1250 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11587.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.24ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12167.15ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:01,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 0 Invalid, 2725 Unknown, 0 Unchecked, 4.24ms Time], IncrementalHoareTripleChecker [2 Valid, 2722 Invalid, 1 Unknown, 0 Unchecked, 12167.15ms Time] [2021-11-04 00:11:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-11-04 00:11:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2261. [2021-11-04 00:11:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2250 states have (on average 1.3177777777777777) internal successors, (2965), 2260 states have internal predecessors, (2965), 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 00:11:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2965 transitions. [2021-11-04 00:11:02,194 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2965 transitions. Word has length 44 [2021-11-04 00:11:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:02,195 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 2965 transitions. [2021-11-04 00:11:02,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 00:11:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2965 transitions. [2021-11-04 00:11:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-04 00:11:02,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:02,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:02,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 00:11:02,197 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:11:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -297582244, now seen corresponding path program 1 times [2021-11-04 00:11:02,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:02,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946274349] [2021-11-04 00:11:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:02,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:02,317 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 00:11:02,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:02,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946274349] [2021-11-04 00:11:02,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946274349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:02,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:02,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:02,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163407559] [2021-11-04 00:11:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:02,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:11:02,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:11:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:02,320 INFO L87 Difference]: Start difference. First operand 2261 states and 2965 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 00:11:06,829 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:09,330 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:10,347 INFO L93 Difference]: Finished difference Result 3590 states and 4695 transitions. [2021-11-04 00:11:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:11:10,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-11-04 00:11:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:10,354 INFO L225 Difference]: With dead ends: 3590 [2021-11-04 00:11:10,354 INFO L226 Difference]: Without dead ends: 3575 [2021-11-04 00:11:10,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.09ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:10,358 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 820 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7372.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.23ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7795.16ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:10,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 0 Invalid, 1897 Unknown, 0 Unchecked, 5.23ms Time], IncrementalHoareTripleChecker [18 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 7795.16ms Time] [2021-11-04 00:11:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2021-11-04 00:11:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3517. [2021-11-04 00:11:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3506 states have (on average 1.3168853394181403) internal successors, (4617), 3516 states have internal predecessors, (4617), 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 00:11:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 4617 transitions. [2021-11-04 00:11:10,786 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 4617 transitions. Word has length 44 [2021-11-04 00:11:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:10,786 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 4617 transitions. [2021-11-04 00:11:10,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 00:11:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 4617 transitions. [2021-11-04 00:11:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-04 00:11:10,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:10,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:10,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 00:11:10,788 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:11:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1289306960, now seen corresponding path program 1 times [2021-11-04 00:11:10,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:10,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012022789] [2021-11-04 00:11:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:10,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:10,869 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 00:11:10,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:10,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012022789] [2021-11-04 00:11:10,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012022789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:10,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:10,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:10,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540884331] [2021-11-04 00:11:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:10,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:11:10,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:10,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:11:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:10,871 INFO L87 Difference]: Start difference. First operand 3517 states and 4617 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:11:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:13,479 INFO L93 Difference]: Finished difference Result 7104 states and 9381 transitions. [2021-11-04 00:11:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:11:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2021-11-04 00:11:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:13,483 INFO L225 Difference]: With dead ends: 7104 [2021-11-04 00:11:13,483 INFO L226 Difference]: Without dead ends: 3595 [2021-11-04 00:11:13,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:13,487 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2198.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.13ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2388.85ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:13,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 2.13ms Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 2388.85ms Time] [2021-11-04 00:11:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2021-11-04 00:11:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3595. [2021-11-04 00:11:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3584 states have (on average 1.3099888392857142) internal successors, (4695), 3594 states have internal predecessors, (4695), 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 00:11:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4695 transitions. [2021-11-04 00:11:13,759 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4695 transitions. Word has length 47 [2021-11-04 00:11:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:13,759 INFO L470 AbstractCegarLoop]: Abstraction has 3595 states and 4695 transitions. [2021-11-04 00:11:13,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:11:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4695 transitions. [2021-11-04 00:11:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 00:11:13,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:13,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:13,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 00:11:13,760 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:11:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1848487698, now seen corresponding path program 1 times [2021-11-04 00:11:13,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:13,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728087110] [2021-11-04 00:11:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:13,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:13,860 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 00:11:13,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:13,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728087110] [2021-11-04 00:11:13,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728087110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:13,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:13,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 00:11:13,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728305012] [2021-11-04 00:11:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:13,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:11:13,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:13,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:11:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:13,863 INFO L87 Difference]: Start difference. First operand 3595 states and 4695 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 00:11:17,687 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:18,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:20,842 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 00:11:24,899 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:28,457 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:29,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:36,922 INFO L93 Difference]: Finished difference Result 11814 states and 15487 transitions. [2021-11-04 00:11:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-04 00:11:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 48 [2021-11-04 00:11:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:36,937 INFO L225 Difference]: With dead ends: 11814 [2021-11-04 00:11:36,937 INFO L226 Difference]: Without dead ends: 9198 [2021-11-04 00:11:36,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 117.03ms TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-11-04 00:11:36,943 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2894 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 5066 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21097.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.49ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5066 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22186.08ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:36,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 0 Invalid, 5096 Unknown, 0 Unchecked, 19.49ms Time], IncrementalHoareTripleChecker [29 Valid, 5066 Invalid, 1 Unknown, 0 Unchecked, 22186.08ms Time] [2021-11-04 00:11:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9198 states. [2021-11-04 00:11:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9198 to 3611. [2021-11-04 00:11:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3600 states have (on average 1.3086111111111112) internal successors, (4711), 3610 states have internal predecessors, (4711), 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 00:11:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 4711 transitions. [2021-11-04 00:11:37,244 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 4711 transitions. Word has length 48 [2021-11-04 00:11:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:37,244 INFO L470 AbstractCegarLoop]: Abstraction has 3611 states and 4711 transitions. [2021-11-04 00:11:37,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 00:11:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 4711 transitions. [2021-11-04 00:11:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 00:11:37,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:37,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:37,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 00:11:37,247 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:11:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash -6937233, now seen corresponding path program 1 times [2021-11-04 00:11:37,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:37,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318921878] [2021-11-04 00:11:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:37,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:37,386 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 00:11:37,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:37,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318921878] [2021-11-04 00:11:37,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318921878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:37,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:37,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:11:37,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335961115] [2021-11-04 00:11:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:37,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:11:37,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:11:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:37,389 INFO L87 Difference]: Start difference. First operand 3611 states and 4711 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:11:38,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:11:40,821 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 00:11:42,850 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 00:11:46,950 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 00:11:51,228 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 00:11:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:55,300 INFO L93 Difference]: Finished difference Result 11601 states and 15156 transitions. [2021-11-04 00:11:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:11:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-04 00:11:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:55,315 INFO L225 Difference]: With dead ends: 11601 [2021-11-04 00:11:55,316 INFO L226 Difference]: Without dead ends: 7998 [2021-11-04 00:11:55,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:55,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 867 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 2847 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16515.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.79ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2847 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17204.46ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:55,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 0 Invalid, 2855 Unknown, 0 Unchecked, 6.79ms Time], IncrementalHoareTripleChecker [4 Valid, 2847 Invalid, 4 Unknown, 0 Unchecked, 17204.46ms Time] [2021-11-04 00:11:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2021-11-04 00:11:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 3064. [2021-11-04 00:11:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 3053 states have (on average 1.30527350147396) internal successors, (3985), 3063 states have internal predecessors, (3985), 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 00:11:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3985 transitions. [2021-11-04 00:11:55,613 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3985 transitions. Word has length 52 [2021-11-04 00:11:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:55,613 INFO L470 AbstractCegarLoop]: Abstraction has 3064 states and 3985 transitions. [2021-11-04 00:11:55,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:11:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3985 transitions. [2021-11-04 00:11:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 00:11:55,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:55,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:11:55,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 00:11:55,616 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:11:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash 291347065, now seen corresponding path program 1 times [2021-11-04 00:11:55,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:55,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349732647] [2021-11-04 00:11:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:55,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:55,722 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 00:11:55,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:55,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349732647] [2021-11-04 00:11:55,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349732647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:55,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:55,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:11:55,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464188943] [2021-11-04 00:11:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:55,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:11:55,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:11:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:11:55,725 INFO L87 Difference]: Start difference. First operand 3064 states and 3985 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:11:58,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:02,297 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:05,713 INFO L93 Difference]: Finished difference Result 9519 states and 12439 transitions. [2021-11-04 00:12:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:12:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-04 00:12:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:05,724 INFO L225 Difference]: With dead ends: 9519 [2021-11-04 00:12:05,724 INFO L226 Difference]: Without dead ends: 6887 [2021-11-04 00:12:05,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.57ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:05,729 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1014 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8843.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9384.51ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:05,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1014 Valid, 0 Invalid, 2467 Unknown, 0 Unchecked, 5.43ms Time], IncrementalHoareTripleChecker [2 Valid, 2464 Invalid, 1 Unknown, 0 Unchecked, 9384.51ms Time] [2021-11-04 00:12:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2021-11-04 00:12:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 2856. [2021-11-04 00:12:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2845 states have (on average 1.3001757469244288) internal successors, (3699), 2855 states have internal predecessors, (3699), 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 00:12:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3699 transitions. [2021-11-04 00:12:06,000 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3699 transitions. Word has length 52 [2021-11-04 00:12:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:06,000 INFO L470 AbstractCegarLoop]: Abstraction has 2856 states and 3699 transitions. [2021-11-04 00:12:06,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3699 transitions. [2021-11-04 00:12:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 00:12:06,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:06,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:06,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 00:12:06,002 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:12:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash -729721289, now seen corresponding path program 1 times [2021-11-04 00:12:06,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:06,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522878218] [2021-11-04 00:12:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:06,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:06,145 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 00:12:06,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:06,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522878218] [2021-11-04 00:12:06,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522878218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:06,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:06,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:12:06,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472637582] [2021-11-04 00:12:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:06,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:12:06,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:12:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:06,147 INFO L87 Difference]: Start difference. First operand 2856 states and 3699 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:07,996 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:09,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:11,193 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 00:12:18,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:20,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 00:12:22,200 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:27,749 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:34,798 INFO L93 Difference]: Finished difference Result 17011 states and 22235 transitions. [2021-11-04 00:12:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 00:12:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-04 00:12:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:34,818 INFO L225 Difference]: With dead ends: 17011 [2021-11-04 00:12:34,819 INFO L226 Difference]: Without dead ends: 15662 [2021-11-04 00:12:34,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 39.67ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:12:34,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1931 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25831.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.87ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27080.53ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:34,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1931 Valid, 0 Invalid, 5211 Unknown, 0 Unchecked, 13.87ms Time], IncrementalHoareTripleChecker [16 Valid, 5192 Invalid, 3 Unknown, 0 Unchecked, 27080.53ms Time] [2021-11-04 00:12:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2021-11-04 00:12:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 2904. [2021-11-04 00:12:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2893 states have (on average 1.2951952989975803) internal successors, (3747), 2903 states have internal predecessors, (3747), 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 00:12:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3747 transitions. [2021-11-04 00:12:35,153 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3747 transitions. Word has length 52 [2021-11-04 00:12:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:35,153 INFO L470 AbstractCegarLoop]: Abstraction has 2904 states and 3747 transitions. [2021-11-04 00:12:35,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3747 transitions. [2021-11-04 00:12:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 00:12:35,154 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:35,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:35,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 00:12:35,155 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:12:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1876302265, now seen corresponding path program 1 times [2021-11-04 00:12:35,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:35,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420278976] [2021-11-04 00:12:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:35,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:35,238 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 00:12:35,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:35,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420278976] [2021-11-04 00:12:35,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420278976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:35,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:35,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:12:35,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244390839] [2021-11-04 00:12:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:35,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:12:35,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:12:35,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:12:35,240 INFO L87 Difference]: Start difference. First operand 2904 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:39,938 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:41,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:42,819 INFO L93 Difference]: Finished difference Result 5420 states and 7000 transitions. [2021-11-04 00:12:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:12:42,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-04 00:12:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:42,825 INFO L225 Difference]: With dead ends: 5420 [2021-11-04 00:12:42,825 INFO L226 Difference]: Without dead ends: 4047 [2021-11-04 00:12:42,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:12:42,829 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6830.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.98ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7168.84ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:42,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 0 Invalid, 1360 Unknown, 0 Unchecked, 1.98ms Time], IncrementalHoareTripleChecker [1 Valid, 1358 Invalid, 1 Unknown, 0 Unchecked, 7168.84ms Time] [2021-11-04 00:12:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2021-11-04 00:12:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 2912. [2021-11-04 00:12:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2901 states have (on average 1.2943812478455705) internal successors, (3755), 2911 states have internal predecessors, (3755), 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 00:12:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3755 transitions. [2021-11-04 00:12:43,111 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3755 transitions. Word has length 52 [2021-11-04 00:12:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:43,111 INFO L470 AbstractCegarLoop]: Abstraction has 2912 states and 3755 transitions. [2021-11-04 00:12:43,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3755 transitions. [2021-11-04 00:12:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 00:12:43,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:43,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:43,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 00:12:43,113 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:12:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -873150611, now seen corresponding path program 1 times [2021-11-04 00:12:43,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:43,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292172980] [2021-11-04 00:12:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:43,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:43,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:43,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292172980] [2021-11-04 00:12:43,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292172980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:43,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:43,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-04 00:12:43,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62342855] [2021-11-04 00:12:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:43,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-04 00:12:43,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-04 00:12:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:12:43,282 INFO L87 Difference]: Start difference. First operand 2912 states and 3755 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:12:45,783 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:49,066 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:50,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:55,822 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 00:13:03,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:05,409 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 00:13:08,682 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:11,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:16,461 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:19,626 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:21,731 INFO L93 Difference]: Finished difference Result 15352 states and 19899 transitions. [2021-11-04 00:13:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-04 00:13:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-04 00:13:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:21,752 INFO L225 Difference]: With dead ends: 15352 [2021-11-04 00:13:21,752 INFO L226 Difference]: Without dead ends: 12872 [2021-11-04 00:13:21,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 486.69ms TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-04 00:13:21,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5010 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 7582 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34488.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.63ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7582 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36264.50ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:21,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5010 Valid, 0 Invalid, 7620 Unknown, 0 Unchecked, 28.63ms Time], IncrementalHoareTripleChecker [35 Valid, 7582 Invalid, 3 Unknown, 0 Unchecked, 36264.50ms Time] [2021-11-04 00:13:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2021-11-04 00:13:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 2910. [2021-11-04 00:13:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2899 states have (on average 1.2904449810279406) internal successors, (3741), 2909 states have internal predecessors, (3741), 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 00:13:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3741 transitions. [2021-11-04 00:13:22,301 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3741 transitions. Word has length 53 [2021-11-04 00:13:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:22,302 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3741 transitions. [2021-11-04 00:13:22,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3741 transitions. [2021-11-04 00:13:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 00:13:22,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:22,314 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:22,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 00:13:22,315 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:13:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 24644017, now seen corresponding path program 1 times [2021-11-04 00:13:22,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:22,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907927761] [2021-11-04 00:13:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:22,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:22,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:22,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907927761] [2021-11-04 00:13:22,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907927761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:22,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:22,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:13:22,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818188570] [2021-11-04 00:13:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:22,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:22,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:22,427 INFO L87 Difference]: Start difference. First operand 2910 states and 3741 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:25,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 00:13:26,657 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:29,854 INFO L93 Difference]: Finished difference Result 5831 states and 7495 transitions. [2021-11-04 00:13:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:29,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-04 00:13:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:29,858 INFO L225 Difference]: With dead ends: 5831 [2021-11-04 00:13:29,858 INFO L226 Difference]: Without dead ends: 2927 [2021-11-04 00:13:29,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:13:29,861 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6726.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7054.47ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:29,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 1515 Unknown, 0 Unchecked, 2.16ms Time], IncrementalHoareTripleChecker [0 Valid, 1514 Invalid, 1 Unknown, 0 Unchecked, 7054.47ms Time] [2021-11-04 00:13:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2021-11-04 00:13:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2914. [2021-11-04 00:13:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2903 states have (on average 1.289700310024113) internal successors, (3744), 2913 states have internal predecessors, (3744), 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 00:13:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3744 transitions. [2021-11-04 00:13:30,168 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3744 transitions. Word has length 53 [2021-11-04 00:13:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:30,169 INFO L470 AbstractCegarLoop]: Abstraction has 2914 states and 3744 transitions. [2021-11-04 00:13:30,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3744 transitions. [2021-11-04 00:13:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 00:13:30,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:30,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:30,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 00:13:30,171 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:13:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 446058872, now seen corresponding path program 1 times [2021-11-04 00:13:30,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:30,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126419438] [2021-11-04 00:13:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:30,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:30,251 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 00:13:30,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:30,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126419438] [2021-11-04 00:13:30,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126419438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:30,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:30,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:30,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189326166] [2021-11-04 00:13:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:30,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:30,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:30,254 INFO L87 Difference]: Start difference. First operand 2914 states and 3744 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:32,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:39,480 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:42,127 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:42,469 INFO L93 Difference]: Finished difference Result 4926 states and 6331 transitions. [2021-11-04 00:13:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-04 00:13:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:42,478 INFO L225 Difference]: With dead ends: 4926 [2021-11-04 00:13:42,478 INFO L226 Difference]: Without dead ends: 4920 [2021-11-04 00:13:42,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.74ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:42,480 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 727 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11091.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.07ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11602.11ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:42,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 0 Invalid, 2036 Unknown, 0 Unchecked, 4.07ms Time], IncrementalHoareTripleChecker [8 Valid, 2026 Invalid, 2 Unknown, 0 Unchecked, 11602.11ms Time] [2021-11-04 00:13:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2021-11-04 00:13:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4856. [2021-11-04 00:13:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4856 states, 4845 states have (on average 1.2918472652218782) internal successors, (6259), 4855 states have internal predecessors, (6259), 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 00:13:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4856 states to 4856 states and 6259 transitions. [2021-11-04 00:13:43,052 INFO L78 Accepts]: Start accepts. Automaton has 4856 states and 6259 transitions. Word has length 54 [2021-11-04 00:13:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:43,052 INFO L470 AbstractCegarLoop]: Abstraction has 4856 states and 6259 transitions. [2021-11-04 00:13:43,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4856 states and 6259 transitions. [2021-11-04 00:13:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-04 00:13:43,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:43,054 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:43,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 00:13:43,054 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:13:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1584391570, now seen corresponding path program 1 times [2021-11-04 00:13:43,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:43,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273541026] [2021-11-04 00:13:43,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:43,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:13:43,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:43,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273541026] [2021-11-04 00:13:43,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273541026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:43,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:43,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:13:43,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545654680] [2021-11-04 00:13:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:43,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:43,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:43,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:43,260 INFO L87 Difference]: Start difference. First operand 4856 states and 6259 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:46,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:50,019 INFO L93 Difference]: Finished difference Result 9706 states and 12511 transitions. [2021-11-04 00:13:50,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-04 00:13:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:50,027 INFO L225 Difference]: With dead ends: 9706 [2021-11-04 00:13:50,027 INFO L226 Difference]: Without dead ends: 4856 [2021-11-04 00:13:50,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:13:50,034 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5784.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6154.90ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:50,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [0 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 6154.90ms Time] [2021-11-04 00:13:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2021-11-04 00:13:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 4856. [2021-11-04 00:13:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4856 states, 4845 states have (on average 1.291640866873065) internal successors, (6258), 4855 states have internal predecessors, (6258), 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 00:13:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4856 states to 4856 states and 6258 transitions. [2021-11-04 00:13:50,600 INFO L78 Accepts]: Start accepts. Automaton has 4856 states and 6258 transitions. Word has length 55 [2021-11-04 00:13:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:50,600 INFO L470 AbstractCegarLoop]: Abstraction has 4856 states and 6258 transitions. [2021-11-04 00:13:50,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4856 states and 6258 transitions. [2021-11-04 00:13:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-04 00:13:50,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:50,602 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:50,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 00:13:50,602 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:13:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1103311312, now seen corresponding path program 1 times [2021-11-04 00:13:50,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:50,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624607916] [2021-11-04 00:13:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:50,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:13:50,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:13:50,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624607916] [2021-11-04 00:13:50,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624607916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:50,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:50,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:13:50,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028711061] [2021-11-04 00:13:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:50,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:13:50,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:13:50,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:13:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:50,846 INFO L87 Difference]: Start difference. First operand 4856 states and 6258 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:58,683 INFO L93 Difference]: Finished difference Result 12396 states and 16004 transitions. [2021-11-04 00:13:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:13:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-04 00:13:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:58,696 INFO L225 Difference]: With dead ends: 12396 [2021-11-04 00:13:58,696 INFO L226 Difference]: Without dead ends: 10448 [2021-11-04 00:13:58,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.21ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:13:58,700 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 766 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6116.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.13ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6524.13ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:58,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 0 Invalid, 1856 Unknown, 0 Unchecked, 4.13ms Time], IncrementalHoareTripleChecker [17 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 6524.13ms Time] [2021-11-04 00:13:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2021-11-04 00:13:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 10162. [2021-11-04 00:13:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10151 states have (on average 1.2946507733228254) internal successors, (13142), 10161 states have internal predecessors, (13142), 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 00:13:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 13142 transitions. [2021-11-04 00:13:59,950 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 13142 transitions. Word has length 55 [2021-11-04 00:13:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:59,951 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 13142 transitions. [2021-11-04 00:13:59,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:13:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 13142 transitions. [2021-11-04 00:13:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-04 00:13:59,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:59,952 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:59,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 00:13:59,952 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:13:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1514792705, now seen corresponding path program 1 times [2021-11-04 00:13:59,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:13:59,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923281189] [2021-11-04 00:13:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:59,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:13:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:00,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:00,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923281189] [2021-11-04 00:14:00,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923281189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:00,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:00,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 00:14:00,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497741581] [2021-11-04 00:14:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:00,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:14:00,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:14:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:14:00,049 INFO L87 Difference]: Start difference. First operand 10162 states and 13142 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:14:03,795 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:05,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:07,343 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 00:14:08,457 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:11,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:13,031 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:14,039 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:18,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:19,929 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:21,343 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:25,231 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:29,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:36,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:36,739 INFO L93 Difference]: Finished difference Result 27908 states and 36194 transitions. [2021-11-04 00:14:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-04 00:14:36,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-04 00:14:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:36,779 INFO L225 Difference]: With dead ends: 27908 [2021-11-04 00:14:36,779 INFO L226 Difference]: Without dead ends: 24288 [2021-11-04 00:14:36,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 130.69ms TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2021-11-04 00:14:36,791 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2894 mSDsluCounter, 3629 mSDsCounter, 0 mSdLazyCounter, 5431 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31885.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.13ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5431 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33230.89ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:36,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 0 Invalid, 5456 Unknown, 0 Unchecked, 19.13ms Time], IncrementalHoareTripleChecker [23 Valid, 5431 Invalid, 2 Unknown, 0 Unchecked, 33230.89ms Time] [2021-11-04 00:14:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24288 states. [2021-11-04 00:14:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24288 to 10162. [2021-11-04 00:14:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10151 states have (on average 1.293173086395429) internal successors, (13127), 10161 states have internal predecessors, (13127), 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 00:14:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 13127 transitions. [2021-11-04 00:14:38,138 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 13127 transitions. Word has length 56 [2021-11-04 00:14:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:38,138 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 13127 transitions. [2021-11-04 00:14:38,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:14:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 13127 transitions. [2021-11-04 00:14:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-04 00:14:38,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:38,140 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, 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 00:14:38,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 00:14:38,140 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:14:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash 850396480, now seen corresponding path program 1 times [2021-11-04 00:14:38,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:38,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902864882] [2021-11-04 00:14:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:38,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:38,231 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 00:14:38,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:38,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902864882] [2021-11-04 00:14:38,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902864882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:38,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:38,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:14:38,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075436799] [2021-11-04 00:14:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:38,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:14:38,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:14:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:14:38,234 INFO L87 Difference]: Start difference. First operand 10162 states and 13127 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 00:14:40,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:41,987 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:49,992 INFO L93 Difference]: Finished difference Result 26622 states and 34597 transitions. [2021-11-04 00:14:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:14:49,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2021-11-04 00:14:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:50,026 INFO L225 Difference]: With dead ends: 26622 [2021-11-04 00:14:50,026 INFO L226 Difference]: Without dead ends: 17711 [2021-11-04 00:14:50,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.63ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:14:50,040 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8657.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.92ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9274.54ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:50,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 2748 Unknown, 0 Unchecked, 5.92ms Time], IncrementalHoareTripleChecker [9 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 9274.54ms Time] [2021-11-04 00:14:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17711 states. [2021-11-04 00:14:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17711 to 10171. [2021-11-04 00:14:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 10160 states have (on average 1.292716535433071) internal successors, (13134), 10170 states have internal predecessors, (13134), 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 00:14:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 13134 transitions. [2021-11-04 00:14:51,504 INFO L78 Accepts]: Start accepts. Automaton has 10171 states and 13134 transitions. Word has length 58 [2021-11-04 00:14:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:51,504 INFO L470 AbstractCegarLoop]: Abstraction has 10171 states and 13134 transitions. [2021-11-04 00:14:51,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 00:14:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 10171 states and 13134 transitions. [2021-11-04 00:14:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-04 00:14:51,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:51,506 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, 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 00:14:51,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 00:14:51,507 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:14:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1274043202, now seen corresponding path program 1 times [2021-11-04 00:14:51,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:51,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264912286] [2021-11-04 00:14:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:51,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:51,581 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 00:14:51,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:51,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264912286] [2021-11-04 00:14:51,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264912286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:51,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:51,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:14:51,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671109996] [2021-11-04 00:14:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:51,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:14:51,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:14:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:14:51,584 INFO L87 Difference]: Start difference. First operand 10171 states and 13134 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 00:14:52,884 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:54,903 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 00:14:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:58,248 INFO L93 Difference]: Finished difference Result 19133 states and 24694 transitions. [2021-11-04 00:14:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:14:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-04 00:14:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:58,263 INFO L225 Difference]: With dead ends: 19133 [2021-11-04 00:14:58,263 INFO L226 Difference]: Without dead ends: 10219 [2021-11-04 00:14:58,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:14:58,276 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4997.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.75ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5246.76ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:58,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 1.75ms Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 1 Unknown, 0 Unchecked, 5246.76ms Time] [2021-11-04 00:14:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2021-11-04 00:14:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 10203. [2021-11-04 00:14:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10192 states have (on average 1.2917974882260597) internal successors, (13166), 10202 states have internal predecessors, (13166), 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 00:14:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 13166 transitions. [2021-11-04 00:14:59,535 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 13166 transitions. Word has length 58 [2021-11-04 00:14:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:59,535 INFO L470 AbstractCegarLoop]: Abstraction has 10203 states and 13166 transitions. [2021-11-04 00:14:59,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 00:14:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 13166 transitions. [2021-11-04 00:14:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-04 00:14:59,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:59,537 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, 1, 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 00:14:59,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 00:14:59,538 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:14:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -361538827, now seen corresponding path program 1 times [2021-11-04 00:14:59,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:14:59,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603860089] [2021-11-04 00:14:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:59,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:14:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:59,616 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 00:14:59,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:14:59,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603860089] [2021-11-04 00:14:59,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603860089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:59,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:59,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:14:59,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386931423] [2021-11-04 00:14:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:59,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:14:59,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:14:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:14:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:14:59,619 INFO L87 Difference]: Start difference. First operand 10203 states and 13166 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 00:15:03,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 00:15:06,435 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:09,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:15,226 INFO L93 Difference]: Finished difference Result 35636 states and 45934 transitions. [2021-11-04 00:15:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:15:15,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-11-04 00:15:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:15,273 INFO L225 Difference]: With dead ends: 35636 [2021-11-04 00:15:15,273 INFO L226 Difference]: Without dead ends: 25441 [2021-11-04 00:15:15,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:15:15,287 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 843 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11667.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.51ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12267.00ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:15,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 0 Invalid, 2643 Unknown, 0 Unchecked, 6.51ms Time], IncrementalHoareTripleChecker [2 Valid, 2639 Invalid, 2 Unknown, 0 Unchecked, 12267.00ms Time] [2021-11-04 00:15:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25441 states. [2021-11-04 00:15:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25441 to 10279. [2021-11-04 00:15:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10279 states, 10268 states have (on average 1.289637709388391) internal successors, (13242), 10278 states have internal predecessors, (13242), 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 00:15:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10279 states to 10279 states and 13242 transitions. [2021-11-04 00:15:16,715 INFO L78 Accepts]: Start accepts. Automaton has 10279 states and 13242 transitions. Word has length 60 [2021-11-04 00:15:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:16,716 INFO L470 AbstractCegarLoop]: Abstraction has 10279 states and 13242 transitions. [2021-11-04 00:15:16,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 00:15:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10279 states and 13242 transitions. [2021-11-04 00:15:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-04 00:15:16,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:16,717 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, 1, 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 00:15:16,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-04 00:15:16,718 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:15:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 772416922, now seen corresponding path program 1 times [2021-11-04 00:15:16,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:16,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646614163] [2021-11-04 00:15:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:16,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:16,800 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 00:15:16,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:16,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646614163] [2021-11-04 00:15:16,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646614163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:15:16,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:15:16,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:15:16,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493170484] [2021-11-04 00:15:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:15:16,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:15:16,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:15:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:15:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:15:16,802 INFO L87 Difference]: Start difference. First operand 10279 states and 13242 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 00:15:19,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:22,123 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:27,436 INFO L93 Difference]: Finished difference Result 31462 states and 40784 transitions. [2021-11-04 00:15:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:15:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-11-04 00:15:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:27,476 INFO L225 Difference]: With dead ends: 31462 [2021-11-04 00:15:27,476 INFO L226 Difference]: Without dead ends: 22888 [2021-11-04 00:15:27,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.97ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:15:27,488 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 613 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6640.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.80ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7126.75ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:27,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 0 Invalid, 2605 Unknown, 0 Unchecked, 5.80ms Time], IncrementalHoareTripleChecker [4 Valid, 2600 Invalid, 1 Unknown, 0 Unchecked, 7126.75ms Time] [2021-11-04 00:15:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22888 states. [2021-11-04 00:15:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22888 to 10080. [2021-11-04 00:15:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10080 states, 10069 states have (on average 1.2891051742973483) internal successors, (12980), 10079 states have internal predecessors, (12980), 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 00:15:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10080 states to 10080 states and 12980 transitions. [2021-11-04 00:15:28,976 INFO L78 Accepts]: Start accepts. Automaton has 10080 states and 12980 transitions. Word has length 60 [2021-11-04 00:15:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:28,976 INFO L470 AbstractCegarLoop]: Abstraction has 10080 states and 12980 transitions. [2021-11-04 00:15:28,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 00:15:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10080 states and 12980 transitions. [2021-11-04 00:15:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-04 00:15:28,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:28,978 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, 1, 1, 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 00:15:28,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-04 00:15:28,978 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:15:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2037876465, now seen corresponding path program 1 times [2021-11-04 00:15:28,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:28,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864040593] [2021-11-04 00:15:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:28,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:15:29,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:29,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864040593] [2021-11-04 00:15:29,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864040593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:15:29,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269263377] [2021-11-04 00:15:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:29,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:15:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:15:29,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 00:15:29,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 00:15:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:29,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:15:29,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:15:29,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-11-04 00:15:29,677 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 00:15:29,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 00:15:29,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269263377] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:15:29,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 00:15:29,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-04 00:15:29,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033471536] [2021-11-04 00:15:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:15:29,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:15:29,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:15:29,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:15:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:15:29,681 INFO L87 Difference]: Start difference. First operand 10080 states and 12980 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:32,034 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:35,615 INFO L93 Difference]: Finished difference Result 20396 states and 26440 transitions. [2021-11-04 00:15:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:15:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-04 00:15:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:35,634 INFO L225 Difference]: With dead ends: 20396 [2021-11-04 00:15:35,634 INFO L226 Difference]: Without dead ends: 10324 [2021-11-04 00:15:35,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.27ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:15:35,648 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4051.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4320.54ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:35,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1008 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [12 Valid, 995 Invalid, 1 Unknown, 0 Unchecked, 4320.54ms Time] [2021-11-04 00:15:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10324 states. [2021-11-04 00:15:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10324 to 10324. [2021-11-04 00:15:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10324 states, 10313 states have (on average 1.2822651022980704) internal successors, (13224), 10323 states have internal predecessors, (13224), 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 00:15:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10324 states to 10324 states and 13224 transitions. [2021-11-04 00:15:37,133 INFO L78 Accepts]: Start accepts. Automaton has 10324 states and 13224 transitions. Word has length 61 [2021-11-04 00:15:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:37,133 INFO L470 AbstractCegarLoop]: Abstraction has 10324 states and 13224 transitions. [2021-11-04 00:15:37,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10324 states and 13224 transitions. [2021-11-04 00:15:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-04 00:15:37,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:37,136 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:15:37,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-04 00:15:37,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-04 00:15:37,340 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:15:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 306863343, now seen corresponding path program 1 times [2021-11-04 00:15:37,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:37,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112514498] [2021-11-04 00:15:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:37,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:15:37,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:37,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112514498] [2021-11-04 00:15:37,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112514498] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:15:37,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831213127] [2021-11-04 00:15:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:37,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:15:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:15:37,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 00:15:37,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 00:15:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:37,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:15:37,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:15:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:15:37,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:15:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:15:38,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831213127] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:15:38,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 00:15:38,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-04 00:15:38,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279637454] [2021-11-04 00:15:38,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 00:15:38,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 00:15:38,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:15:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 00:15:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:15:38,068 INFO L87 Difference]: Start difference. First operand 10324 states and 13224 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:40,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:42,919 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 00:15:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:47,367 INFO L93 Difference]: Finished difference Result 19561 states and 25049 transitions. [2021-11-04 00:15:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:15:47,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-04 00:15:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:47,380 INFO L225 Difference]: With dead ends: 19561 [2021-11-04 00:15:47,381 INFO L226 Difference]: Without dead ends: 10468 [2021-11-04 00:15:47,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 20.31ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:15:47,388 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7312.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.84ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7711.67ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:47,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 1514 Unknown, 0 Unchecked, 2.84ms Time], IncrementalHoareTripleChecker [5 Valid, 1508 Invalid, 1 Unknown, 0 Unchecked, 7711.67ms Time] [2021-11-04 00:15:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10468 states. [2021-11-04 00:15:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 10468. [2021-11-04 00:15:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10468 states, 10457 states have (on average 1.278378119919671) internal successors, (13368), 10467 states have internal predecessors, (13368), 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 00:15:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10468 states to 10468 states and 13368 transitions. [2021-11-04 00:15:48,802 INFO L78 Accepts]: Start accepts. Automaton has 10468 states and 13368 transitions. Word has length 61 [2021-11-04 00:15:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:48,802 INFO L470 AbstractCegarLoop]: Abstraction has 10468 states and 13368 transitions. [2021-11-04 00:15:48,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 10468 states and 13368 transitions. [2021-11-04 00:15:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-04 00:15:48,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:48,804 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, 1, 1, 1, 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 00:15:48,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-04 00:15:49,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-04 00:15:49,006 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:15:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1955072921, now seen corresponding path program 1 times [2021-11-04 00:15:49,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:15:49,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519536428] [2021-11-04 00:15:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:49,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:15:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 00:15:49,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:15:49,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519536428] [2021-11-04 00:15:49,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519536428] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:15:49,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306206520] [2021-11-04 00:15:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:49,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:15:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:15:49,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 00:15:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-04 00:15:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:49,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-04 00:15:49,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:15:49,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-11-04 00:15:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 00:15:49,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:15:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 00:15:49,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306206520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:15:49,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 00:15:49,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 00:15:49,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122416321] [2021-11-04 00:15:49,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 00:15:49,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 00:15:49,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:15:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 00:15:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:15:49,718 INFO L87 Difference]: Start difference. First operand 10468 states and 13368 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:52,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:55,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:59,583 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:16:03,298 INFO L93 Difference]: Finished difference Result 21904 states and 28680 transitions. [2021-11-04 00:16:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 00:16:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-04 00:16:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:16:03,317 INFO L225 Difference]: With dead ends: 21904 [2021-11-04 00:16:03,317 INFO L226 Difference]: Without dead ends: 11444 [2021-11-04 00:16:03,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.01ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:16:03,335 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10981.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.19ms SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11591.80ms IncrementalHoareTripleChecker+Time [2021-11-04 00:16:03,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 3054 Unknown, 0 Unchecked, 6.19ms Time], IncrementalHoareTripleChecker [70 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 11591.80ms Time] [2021-11-04 00:16:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11444 states. [2021-11-04 00:16:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11444 to 11444. [2021-11-04 00:16:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11444 states, 11433 states have (on average 1.254613837138109) internal successors, (14344), 11443 states have internal predecessors, (14344), 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 00:16:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11444 states to 11444 states and 14344 transitions. [2021-11-04 00:16:05,015 INFO L78 Accepts]: Start accepts. Automaton has 11444 states and 14344 transitions. Word has length 62 [2021-11-04 00:16:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:16:05,015 INFO L470 AbstractCegarLoop]: Abstraction has 11444 states and 14344 transitions. [2021-11-04 00:16:05,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:16:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11444 states and 14344 transitions. [2021-11-04 00:16:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-04 00:16:05,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:16:05,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:16:05,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-04 00:16:05,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:16:05,244 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:16:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:16:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1699998706, now seen corresponding path program 1 times [2021-11-04 00:16:05,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:16:05,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415453928] [2021-11-04 00:16:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:16:05,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:16:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:16:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:16:05,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:16:05,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415453928] [2021-11-04 00:16:05,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415453928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:16:05,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:16:05,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-04 00:16:05,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747266950] [2021-11-04 00:16:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:16:05,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-04 00:16:05,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:16:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-04 00:16:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-04 00:16:05,402 INFO L87 Difference]: Start difference. First operand 11444 states and 14344 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 00:16:07,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:09,044 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:13,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 00:16:15,063 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 00:16:19,771 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 00:16:21,805 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 00:16:23,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:27,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:28,373 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:30,918 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:38,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:40,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:16:46,778 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 00:17:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:17:06,027 INFO L93 Difference]: Finished difference Result 63525 states and 80139 transitions. [2021-11-04 00:17:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-04 00:17:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2021-11-04 00:17:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:17:06,149 INFO L225 Difference]: With dead ends: 63525 [2021-11-04 00:17:06,150 INFO L226 Difference]: Without dead ends: 56909 [2021-11-04 00:17:06,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 899.83ms TimeCoverageRelationStatistics Valid=1006, Invalid=4544, Unknown=0, NotChecked=0, Total=5550 [2021-11-04 00:17:06,175 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5240 mSDsluCounter, 7216 mSDsCounter, 0 mSdLazyCounter, 9367 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47129.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.99ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 9367 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49383.06ms IncrementalHoareTripleChecker+Time [2021-11-04 00:17:06,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5240 Valid, 0 Invalid, 9403 Unknown, 0 Unchecked, 43.99ms Time], IncrementalHoareTripleChecker [31 Valid, 9367 Invalid, 5 Unknown, 0 Unchecked, 49383.06ms Time] [2021-11-04 00:17:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56909 states. [2021-11-04 00:17:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56909 to 11419. [2021-11-04 00:17:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11419 states, 11408 states have (on average 1.2522791023842916) internal successors, (14286), 11418 states have internal predecessors, (14286), 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 00:17:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 14286 transitions. [2021-11-04 00:17:08,337 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 14286 transitions. Word has length 62 [2021-11-04 00:17:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:17:08,337 INFO L470 AbstractCegarLoop]: Abstraction has 11419 states and 14286 transitions. [2021-11-04 00:17:08,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 00:17:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 14286 transitions. [2021-11-04 00:17:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-04 00:17:08,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:17:08,339 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:17:08,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-04 00:17:08,341 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:17:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:17:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -86443031, now seen corresponding path program 1 times [2021-11-04 00:17:08,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:17:08,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792315354] [2021-11-04 00:17:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:17:08,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:17:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 00:17:08,573 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-04 00:17:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 00:17:08,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-04 00:17:08,881 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-04 00:17:08,882 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2021-11-04 00:17:08,883 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2021-11-04 00:17:08,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2021-11-04 00:17:08,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2021-11-04 00:17:08,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2021-11-04 00:17:08,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2021-11-04 00:17:08,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2021-11-04 00:17:08,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2021-11-04 00:17:08,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2021-11-04 00:17:08,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2021-11-04 00:17:08,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2021-11-04 00:17:08,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-04 00:17:08,892 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-04 00:17:08,895 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-04 00:17:09,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.11 12:17:09 BoogieIcfgContainer [2021-11-04 00:17:09,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-04 00:17:09,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-04 00:17:09,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-04 00:17:09,098 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-04 00:17:09,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:33" (3/4) ... [2021-11-04 00:17:09,101 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-04 00:17:09,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-04 00:17:09,101 INFO L158 Benchmark]: Toolchain (without parser) took 459308.01ms. Allocated memory was 86.0MB in the beginning and 2.4GB in the end (delta: 2.4GB). Free memory was 61.0MB in the beginning and 798.7MB in the end (delta: -737.7MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-11-04 00:17:09,101 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 86.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 00:17:09,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1756.24ms. Allocated memory was 86.0MB in the beginning and 165.7MB in the end (delta: 79.7MB). Free memory was 61.0MB in the beginning and 78.0MB in the end (delta: -17.1MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2021-11-04 00:17:09,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.18ms. Allocated memory is still 165.7MB. Free memory was 78.0MB in the beginning and 111.8MB in the end (delta: -33.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2021-11-04 00:17:09,102 INFO L158 Benchmark]: Boogie Preprocessor took 146.05ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 98.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-04 00:17:09,102 INFO L158 Benchmark]: RCFGBuilder took 1713.86ms. Allocated memory was 165.7MB in the beginning and 232.8MB in the end (delta: 67.1MB). Free memory was 98.0MB in the beginning and 145.0MB in the end (delta: -47.0MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2021-11-04 00:17:09,102 INFO L158 Benchmark]: TraceAbstraction took 455491.51ms. Allocated memory was 232.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 145.0MB in the beginning and 798.7MB in the end (delta: -653.7MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-11-04 00:17:09,103 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 2.4GB. Free memory is still 798.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 00:17:09,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 86.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1756.24ms. Allocated memory was 86.0MB in the beginning and 165.7MB in the end (delta: 79.7MB). Free memory was 61.0MB in the beginning and 78.0MB in the end (delta: -17.1MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.18ms. Allocated memory is still 165.7MB. Free memory was 78.0MB in the beginning and 111.8MB in the end (delta: -33.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.05ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 98.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1713.86ms. Allocated memory was 165.7MB in the beginning and 232.8MB in the end (delta: 67.1MB). Free memory was 98.0MB in the beginning and 145.0MB in the end (delta: -47.0MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * TraceAbstraction took 455491.51ms. Allocated memory was 232.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 145.0MB in the beginning and 798.7MB in the end (delta: -653.7MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 2.4GB. Free memory is still 798.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5143, overapproximation of bitwiseAnd at line 6104. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6777] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6109] msg->length = (u8 )5 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6135] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6137] COND TRUE i < 10 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6151] COND TRUE ! context [L6154] dev->udev [L6154] urb->transfer_dma [L6802] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6810] COND TRUE \read(*addr) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 410 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 455223.36ms, OverallIterations: 30, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 70.41ms, AutomataDifference: 427882.16ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 21.14ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 35610 SdHoareTripleChecker+Valid, 384040.45ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35610 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 364260.67ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57566 mSDsCounter, 362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87369 IncrementalHoareTripleChecker+Invalid, 87768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 362 mSolverCounterUnsat, 9 mSDtfsCounter, 87369 mSolverCounterSat, 274.49ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 2082.37ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11444occurred in iteration=28, InterpolantAutomatonStates: 299, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 20284.35ms AutomataMinimizationTime, 29 MinimizatonAttempts, 165162 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 332.84ms SsaConstructionTime, 1832.58ms SatisfiabilityAnalysisTime, 2876.56ms InterpolantComputationTime, 1673 NumberOfCodeBlocks, 1673 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1698 ConstructedInterpolants, 0 QuantifiedInterpolants, 2491 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3514 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 43/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-04 00:17:09,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 00:17:11,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 00:17:11,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 00:17:11,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 00:17:11,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 00:17:11,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 00:17:11,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 00:17:11,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 00:17:11,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 00:17:11,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 00:17:11,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 00:17:11,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 00:17:11,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 00:17:11,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 00:17:11,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 00:17:11,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 00:17:11,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 00:17:11,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 00:17:11,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 00:17:11,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 00:17:11,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 00:17:11,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 00:17:11,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 00:17:11,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 00:17:11,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 00:17:11,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 00:17:11,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 00:17:11,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 00:17:11,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 00:17:11,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 00:17:11,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 00:17:11,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 00:17:11,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 00:17:11,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 00:17:11,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 00:17:11,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 00:17:11,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 00:17:11,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 00:17:11,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 00:17:11,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 00:17:11,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 00:17:11,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-04 00:17:11,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 00:17:11,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 00:17:11,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 00:17:11,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 00:17:11,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 00:17:11,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 00:17:11,414 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 00:17:11,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 00:17:11,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 00:17:11,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 00:17:11,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 00:17:11,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 00:17:11,416 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-04 00:17:11,417 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-04 00:17:11,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 00:17:11,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 00:17:11,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 00:17:11,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 00:17:11,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 00:17:11,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 00:17:11,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:17:11,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 00:17:11,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 00:17:11,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 00:17:11,419 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-04 00:17:11,419 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-04 00:17:11,419 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 00:17:11,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 00:17:11,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 00:17:11,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 00:17:11,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-04 00:17:11,420 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-04 00:17:11,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 00:17:11,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 00:17:11,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 00:17:11,788 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 00:17:11,788 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 00:17:11,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:17:11,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32961a01/cb267b9144864f28a848c28431c0ee05/FLAG07d13a448 [2021-11-04 00:17:12,642 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 00:17:12,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:17:12,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32961a01/cb267b9144864f28a848c28431c0ee05/FLAG07d13a448 [2021-11-04 00:17:12,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32961a01/cb267b9144864f28a848c28431c0ee05 [2021-11-04 00:17:12,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 00:17:12,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 00:17:12,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 00:17:12,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 00:17:12,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 00:17:12,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:17:12" (1/1) ... [2021-11-04 00:17:12,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697e604b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:12, skipping insertion in model container [2021-11-04 00:17:12,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:17:12" (1/1) ... [2021-11-04 00:17:12,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 00:17:12,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 00:17:14,034 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-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-04 00:17:14,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:17:14,140 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 00:17:14,428 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-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-04 00:17:14,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:17:14,623 INFO L208 MainTranslator]: Completed translation [2021-11-04 00:17:14,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14 WrapperNode [2021-11-04 00:17:14,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 00:17:14,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 00:17:14,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 00:17:14,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 00:17:14,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 00:17:14,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 00:17:14,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 00:17:14,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 00:17:14,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 00:17:14,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 00:17:14,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 00:17:14,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 00:17:14,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (1/1) ... [2021-11-04 00:17:14,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:17:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:17:15,049 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 00:17:15,076 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 00:17:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-04 00:17:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-04 00:17:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-04 00:17:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-04 00:17:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-04 00:17:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 00:17:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 00:17:15,533 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:17:16,723 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-04 00:17:16,724 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-04 00:17:16,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 00:17:16,741 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-04 00:17:16,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:17:16 BoogieIcfgContainer [2021-11-04 00:17:16,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 00:17:16,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 00:17:16,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 00:17:16,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 00:17:16,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:17:12" (1/3) ... [2021-11-04 00:17:16,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:17:16, skipping insertion in model container [2021-11-04 00:17:16,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:17:14" (2/3) ... [2021-11-04 00:17:16,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4251b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:17:16, skipping insertion in model container [2021-11-04 00:17:16,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:17:16" (3/3) ... [2021-11-04 00:17:16,751 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-04 00:17:16,756 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 00:17:16,757 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-04 00:17:16,809 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 00:17:16,818 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 00:17:16,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-04 00:17:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 00:17:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-04 00:17:16,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:17:16,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:17:16,846 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:17:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:17:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-04 00:17:16,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:17:16,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789548401] [2021-11-04 00:17:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:17:16,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:17:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:17:16,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:17:16,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-04 00:17:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:17:17,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:17:17,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:17:17,624 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 00:17:17,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:17:17,664 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 00:17:17,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:17:17,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789548401] [2021-11-04 00:17:17,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789548401] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:17:17,666 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:17:17,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:17:17,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687102050] [2021-11-04 00:17:17,668 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:17:17,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:17:17,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:17:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:17:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:17:17,707 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 3.3333333333333335) internal successors, (10), 2 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 00:17:19,800 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:22,925 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:31,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:36,511 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:17:40,927 INFO L93 Difference]: Finished difference Result 1119 states and 1645 transitions. [2021-11-04 00:17:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:17:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 00:17:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:17:40,945 INFO L225 Difference]: With dead ends: 1119 [2021-11-04 00:17:40,945 INFO L226 Difference]: Without dead ends: 696 [2021-11-04 00:17:40,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:17:40,954 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 419 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22024.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.64ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23010.82ms IncrementalHoareTripleChecker+Time [2021-11-04 00:17:40,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 18 Invalid, 1025 Unknown, 0 Unchecked, 17.64ms Time], IncrementalHoareTripleChecker [6 Valid, 1016 Invalid, 3 Unknown, 0 Unchecked, 23010.82ms Time] [2021-11-04 00:17:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-04 00:17:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 678. [2021-11-04 00:17:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 667 states have (on average 1.3403298350824588) internal successors, (894), 677 states have internal predecessors, (894), 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 00:17:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 894 transitions. [2021-11-04 00:17:41,042 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 894 transitions. Word has length 10 [2021-11-04 00:17:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:17:41,043 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 894 transitions. [2021-11-04 00:17:41,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 00:17:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 894 transitions. [2021-11-04 00:17:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-04 00:17:41,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:17:41,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:17:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-04 00:17:41,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:17:41,245 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:17:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:17:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-04 00:17:41,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:17:41,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969141186] [2021-11-04 00:17:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:17:41,247 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:17:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:17:41,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:17:41,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-04 00:17:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:17:41,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:17:41,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:17:41,912 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 00:17:41,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:17:42,047 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 00:17:42,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:17:42,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969141186] [2021-11-04 00:17:42,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969141186] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:17:42,048 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:17:42,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:17:42,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463042265] [2021-11-04 00:17:42,049 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:17:42,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:17:42,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:17:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:17:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:17:42,050 INFO L87 Difference]: Start difference. First operand 678 states and 894 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 00:17:44,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:47,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:52,364 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:02,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:18:08,277 INFO L93 Difference]: Finished difference Result 1940 states and 2571 transitions. [2021-11-04 00:18:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:18:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-04 00:18:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:18:08,284 INFO L225 Difference]: With dead ends: 1940 [2021-11-04 00:18:08,284 INFO L226 Difference]: Without dead ends: 1267 [2021-11-04 00:18:08,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.39ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:18:08,289 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 402 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24953.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.74ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26030.32ms IncrementalHoareTripleChecker+Time [2021-11-04 00:18:08,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 11.74ms Time], IncrementalHoareTripleChecker [3 Valid, 997 Invalid, 3 Unknown, 0 Unchecked, 26030.32ms Time] [2021-11-04 00:18:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2021-11-04 00:18:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1239. [2021-11-04 00:18:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1228 states have (on average 1.3460912052117264) internal successors, (1653), 1238 states have internal predecessors, (1653), 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 00:18:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1653 transitions. [2021-11-04 00:18:08,382 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1653 transitions. Word has length 11 [2021-11-04 00:18:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:18:08,383 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1653 transitions. [2021-11-04 00:18:08,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 00:18:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1653 transitions. [2021-11-04 00:18:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 00:18:08,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:18:08,387 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, 1, 1, 1] [2021-11-04 00:18:08,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-04 00:18:08,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:18:08,596 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:18:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:18:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-04 00:18:08,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:18:08,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242514732] [2021-11-04 00:18:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:18:08,597 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:18:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:18:08,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:18:08,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-04 00:18:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:18:09,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:18:09,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:18:09,379 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 00:18:09,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:18:09,636 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 00:18:09,637 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:18:09,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242514732] [2021-11-04 00:18:09,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242514732] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:18:09,637 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:18:09,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-04 00:18:09,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941458388] [2021-11-04 00:18:09,638 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:18:09,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:18:09,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:18:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:18:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:18:09,639 INFO L87 Difference]: Start difference. First operand 1239 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 00:18:11,732 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:17,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:20,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:30,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:32,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:34,941 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:43,250 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:18:48,126 INFO L93 Difference]: Finished difference Result 2472 states and 3299 transitions. [2021-11-04 00:18:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:18:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2021-11-04 00:18:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:18:48,133 INFO L225 Difference]: With dead ends: 2472 [2021-11-04 00:18:48,133 INFO L226 Difference]: Without dead ends: 1239 [2021-11-04 00:18:48,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 130.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:18:48,137 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37018.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38256.75ms IncrementalHoareTripleChecker+Time [2021-11-04 00:18:48,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 15.33ms Time], IncrementalHoareTripleChecker [0 Valid, 1505 Invalid, 3 Unknown, 0 Unchecked, 38256.75ms Time] [2021-11-04 00:18:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2021-11-04 00:18:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2021-11-04 00:18:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1228 states have (on average 1.3452768729641693) internal successors, (1652), 1238 states have internal predecessors, (1652), 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 00:18:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1652 transitions. [2021-11-04 00:18:48,196 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1652 transitions. Word has length 38 [2021-11-04 00:18:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:18:48,196 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1652 transitions. [2021-11-04 00:18:48,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 00:18:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1652 transitions. [2021-11-04 00:18:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 00:18:48,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:18:48,199 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, 1, 1, 1] [2021-11-04 00:18:48,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-04 00:18:48,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:18:48,423 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:18:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:18:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 667504064, now seen corresponding path program 1 times [2021-11-04 00:18:48,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:18:48,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363022476] [2021-11-04 00:18:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:18:48,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:18:48,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:18:48,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:18:48,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-04 00:18:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:18:48,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:18:48,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:18:49,259 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 00:18:49,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:18:49,602 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 00:18:49,602 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:18:49,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363022476] [2021-11-04 00:18:49,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363022476] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:18:49,602 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:18:49,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 00:18:49,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067601654] [2021-11-04 00:18:49,603 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:18:49,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:18:49,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:18:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:18:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:18:49,604 INFO L87 Difference]: Start difference. First operand 1239 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 00:18:51,669 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:55,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:10,566 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:17,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:21,448 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:19:27,588 INFO L93 Difference]: Finished difference Result 4552 states and 6121 transitions. [2021-11-04 00:19:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:19:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 38 [2021-11-04 00:19:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:19:27,603 INFO L225 Difference]: With dead ends: 4552 [2021-11-04 00:19:27,604 INFO L226 Difference]: Without dead ends: 3320 [2021-11-04 00:19:27,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.90ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:19:27,609 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1094 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36151.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.87ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37699.61ms IncrementalHoareTripleChecker+Time [2021-11-04 00:19:27,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 0 Invalid, 1373 Unknown, 0 Unchecked, 17.87ms Time], IncrementalHoareTripleChecker [9 Valid, 1361 Invalid, 3 Unknown, 0 Unchecked, 37699.61ms Time] [2021-11-04 00:19:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2021-11-04 00:19:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3254. [2021-11-04 00:19:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3243 states have (on average 1.3595436324390997) internal successors, (4409), 3253 states have internal predecessors, (4409), 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 00:19:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4409 transitions. [2021-11-04 00:19:27,738 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4409 transitions. Word has length 38 [2021-11-04 00:19:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:19:27,738 INFO L470 AbstractCegarLoop]: Abstraction has 3254 states and 4409 transitions. [2021-11-04 00:19:27,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 00:19:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4409 transitions. [2021-11-04 00:19:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 00:19:27,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:19:27,745 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:19:27,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-04 00:19:27,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:19:27,964 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:19:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:19:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1703756643, now seen corresponding path program 1 times [2021-11-04 00:19:27,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:19:27,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356873630] [2021-11-04 00:19:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:19:27,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:19:27,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:19:27,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:19:27,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-04 00:19:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:19:28,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:19:28,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:19:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:19:28,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:19:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:19:29,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:19:29,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356873630] [2021-11-04 00:19:29,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356873630] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:19:29,048 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:19:29,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-04 00:19:29,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199691967] [2021-11-04 00:19:29,048 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:19:29,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:19:29,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:19:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:19:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:19:29,049 INFO L87 Difference]: Start difference. First operand 3254 states and 4409 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 00:19:31,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:37,736 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:40,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:45,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:46,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:59,648 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:20:26,929 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:20:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:20:40,529 INFO L93 Difference]: Finished difference Result 12768 states and 17300 transitions. [2021-11-04 00:20:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:20:40,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 41 [2021-11-04 00:20:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:20:40,562 INFO L225 Difference]: With dead ends: 12768 [2021-11-04 00:20:40,563 INFO L226 Difference]: Without dead ends: 9522 [2021-11-04 00:20:40,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 216.28ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:20:40,572 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1613 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68382.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.33ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71025.14ms IncrementalHoareTripleChecker+Time [2021-11-04 00:20:40,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 0 Invalid, 3081 Unknown, 0 Unchecked, 28.33ms Time], IncrementalHoareTripleChecker [3 Valid, 3074 Invalid, 4 Unknown, 0 Unchecked, 71025.14ms Time] [2021-11-04 00:20:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states. [2021-11-04 00:20:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 3278. [2021-11-04 00:20:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3267 states have (on average 1.3569023569023568) internal successors, (4433), 3277 states have internal predecessors, (4433), 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 00:20:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4433 transitions. [2021-11-04 00:20:40,772 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4433 transitions. Word has length 41 [2021-11-04 00:20:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:20:40,772 INFO L470 AbstractCegarLoop]: Abstraction has 3278 states and 4433 transitions. [2021-11-04 00:20:40,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 00:20:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4433 transitions. [2021-11-04 00:20:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 00:20:40,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:20:40,774 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:20:40,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-04 00:20:40,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:20:40,988 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:20:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:20:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1337408933, now seen corresponding path program 1 times [2021-11-04 00:20:40,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:20:40,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918500311] [2021-11-04 00:20:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:20:40,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:20:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:20:40,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:20:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-04 00:20:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:20:41,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:20:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:20:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:20:41,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:20:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:20:41,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:20:41,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918500311] [2021-11-04 00:20:41,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918500311] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:20:41,993 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:20:41,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-04 00:20:41,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449000982] [2021-11-04 00:20:41,993 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:20:41,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:20:41,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:20:41,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:20:41,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:20:41,995 INFO L87 Difference]: Start difference. First operand 3278 states and 4433 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 00:20:44,066 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:20:50,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:20:59,696 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:06,993 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:15,861 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:23,980 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:37,583 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:42,126 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:21:54,408 INFO L93 Difference]: Finished difference Result 10872 states and 14740 transitions. [2021-11-04 00:21:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:21:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 42 [2021-11-04 00:21:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:21:54,429 INFO L225 Difference]: With dead ends: 10872 [2021-11-04 00:21:54,429 INFO L226 Difference]: Without dead ends: 7602 [2021-11-04 00:21:54,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 214.33ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:21:54,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1143 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69429.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.61ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71943.55ms IncrementalHoareTripleChecker+Time [2021-11-04 00:21:54,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 0 Invalid, 2863 Unknown, 0 Unchecked, 27.61ms Time], IncrementalHoareTripleChecker [1 Valid, 2859 Invalid, 3 Unknown, 0 Unchecked, 71943.55ms Time] [2021-11-04 00:21:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7602 states. [2021-11-04 00:21:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7602 to 3302. [2021-11-04 00:21:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3291 states have (on average 1.3542996049832878) internal successors, (4457), 3301 states have internal predecessors, (4457), 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 00:21:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4457 transitions. [2021-11-04 00:21:54,665 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4457 transitions. Word has length 42 [2021-11-04 00:21:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:21:54,666 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4457 transitions. [2021-11-04 00:21:54,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 00:21:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4457 transitions. [2021-11-04 00:21:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 00:21:54,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:21:54,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:21:54,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-04 00:21:54,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:21:54,888 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-04 00:21:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:21:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash -283318246, now seen corresponding path program 1 times [2021-11-04 00:21:54,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:21:54,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566392335] [2021-11-04 00:21:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:21:54,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:21:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:21:54,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:21:54,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-04 00:21:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:21:55,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-04 00:21:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:21:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:21:55,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:21:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:21:55,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:21:55,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566392335] [2021-11-04 00:21:55,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566392335] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:21:55,968 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:21:55,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-04 00:21:55,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160850822] [2021-11-04 00:21:55,968 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:21:55,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:21:55,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:21:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:21:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:21:55,969 INFO L87 Difference]: Start difference. First operand 3302 states and 4457 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:21:58,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:04,503 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:13,361 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:14,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:21,424 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:59,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15