./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.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 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 14:00:05,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 14:00:05,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 14:00:05,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 14:00:05,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 14:00:05,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 14:00:05,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 14:00:05,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 14:00:05,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 14:00:05,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 14:00:05,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 14:00:05,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 14:00:05,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 14:00:05,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 14:00:05,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 14:00:05,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 14:00:05,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 14:00:05,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 14:00:05,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 14:00:05,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 14:00:05,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 14:00:05,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 14:00:05,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 14:00:05,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 14:00:05,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 14:00:05,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 14:00:05,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 14:00:05,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 14:00:05,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 14:00:05,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 14:00:05,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 14:00:05,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 14:00:05,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 14:00:05,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 14:00:05,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 14:00:05,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 14:00:05,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 14:00:05,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 14:00:05,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 14:00:05,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 14:00:05,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 14:00:05,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 14:00:05,713 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 14:00:05,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 14:00:05,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 14:00:05,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 14:00:05,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 14:00:05,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 14:00:05,716 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 14:00:05,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 14:00:05,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 14:00:05,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 14:00:05,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 14:00:05,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 14:00:05,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 14:00:05,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 14:00:05,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:05,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 14:00:05,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 14:00:05,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 14:00:05,721 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 -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-06 14:00:05,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 14:00:05,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 14:00:05,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 14:00:05,964 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 14:00:05,964 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 14:00:05,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:06,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34946340/3b73caf59dc54114a0563f545deeabab/FLAGa2401daa9 [2021-11-06 14:00:06,650 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 14:00:06,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:06,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34946340/3b73caf59dc54114a0563f545deeabab/FLAGa2401daa9 [2021-11-06 14:00:07,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34946340/3b73caf59dc54114a0563f545deeabab [2021-11-06 14:00:07,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 14:00:07,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 14:00:07,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:07,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 14:00:07,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 14:00:07,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:07" (1/1) ... [2021-11-06 14:00:07,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251143d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:07, skipping insertion in model container [2021-11-06 14:00:07,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:07" (1/1) ... [2021-11-06 14:00:07,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 14:00:07,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 14:00:07,549 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-06 14:00:07,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:07,847 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 14:00:07,922 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-06 14:00:08,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:08,061 INFO L208 MainTranslator]: Completed translation [2021-11-06 14:00:08,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08 WrapperNode [2021-11-06 14:00:08,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:08,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:08,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 14:00:08,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 14:00:08,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:08,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 14:00:08,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 14:00:08,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 14:00:08,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 14:00:08,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 14:00:08,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 14:00:08,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 14:00:08,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (1/1) ... [2021-11-06 14:00:08,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:00:08,465 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-06 14:00:08,483 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-06 14:00:08,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 14:00:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 14:00:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 14:00:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 14:00:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 14:00:08,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 14:00:15,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 14:00:15,861 INFO L299 CfgBuilder]: Removed 310 assume(true) statements. [2021-11-06 14:00:15,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:15 BoogieIcfgContainer [2021-11-06 14:00:15,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 14:00:15,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 14:00:15,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 14:00:15,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 14:00:15,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:00:07" (1/3) ... [2021-11-06 14:00:15,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa9cf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:15, skipping insertion in model container [2021-11-06 14:00:15,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:08" (2/3) ... [2021-11-06 14:00:15,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa9cf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:15, skipping insertion in model container [2021-11-06 14:00:15,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:15" (3/3) ... [2021-11-06 14:00:15,868 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:15,871 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 14:00:15,872 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-06 14:00:15,901 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 14:00:15,905 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-06 14:00:15,905 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-06 14:00:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 0 states have call successors, (0), 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-06 14:00:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 14:00:15,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:15,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:15,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1148713798, now seen corresponding path program 1 times [2021-11-06 14:00:15,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:15,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632799809] [2021-11-06 14:00:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:15,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:16,389 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-06 14:00:16,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:16,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632799809] [2021-11-06 14:00:16,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632799809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:16,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:16,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:16,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516748761] [2021-11-06 14:00:16,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:16,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:16,449 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 0 states have call successors, (0), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:18,802 INFO L93 Difference]: Finished difference Result 1120 states and 1667 transitions. [2021-11-06 14:00:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-06 14:00:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:18,815 INFO L225 Difference]: With dead ends: 1120 [2021-11-06 14:00:18,815 INFO L226 Difference]: Without dead ends: 725 [2021-11-06 14:00:18,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-11-06 14:00:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2021-11-06 14:00:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 720 states have (on average 1.4055555555555554) internal successors, (1012), 724 states have internal predecessors, (1012), 0 states have call successors, (0), 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-06 14:00:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1012 transitions. [2021-11-06 14:00:18,883 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1012 transitions. Word has length 15 [2021-11-06 14:00:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:18,883 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1012 transitions. [2021-11-06 14:00:18,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-06 14:00:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1012 transitions. [2021-11-06 14:00:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 14:00:18,885 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:18,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:18,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 14:00:18,885 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1888760138, now seen corresponding path program 1 times [2021-11-06 14:00:18,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:18,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509502299] [2021-11-06 14:00:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:18,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:19,083 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-06 14:00:19,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:19,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509502299] [2021-11-06 14:00:19,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509502299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:19,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:19,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:19,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305683599] [2021-11-06 14:00:19,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:19,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:19,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,088 INFO L87 Difference]: Start difference. First operand 725 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:19,159 INFO L93 Difference]: Finished difference Result 755 states and 1040 transitions. [2021-11-06 14:00:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:19,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 14:00:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:19,164 INFO L225 Difference]: With dead ends: 755 [2021-11-06 14:00:19,165 INFO L226 Difference]: Without dead ends: 740 [2021-11-06 14:00:19,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-11-06 14:00:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 725. [2021-11-06 14:00:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 720 states have (on average 1.4041666666666666) internal successors, (1011), 724 states have internal predecessors, (1011), 0 states have call successors, (0), 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-06 14:00:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1011 transitions. [2021-11-06 14:00:19,200 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1011 transitions. Word has length 22 [2021-11-06 14:00:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:19,200 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1011 transitions. [2021-11-06 14:00:19,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1011 transitions. [2021-11-06 14:00:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 14:00:19,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:19,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:19,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 14:00:19,204 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1888700556, now seen corresponding path program 1 times [2021-11-06 14:00:19,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:19,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500957066] [2021-11-06 14:00:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:19,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:19,514 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-06 14:00:19,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:19,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500957066] [2021-11-06 14:00:19,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500957066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:19,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:19,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:19,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398110658] [2021-11-06 14:00:19,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:19,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:19,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:19,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,516 INFO L87 Difference]: Start difference. First operand 725 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:19,611 INFO L93 Difference]: Finished difference Result 2157 states and 3014 transitions. [2021-11-06 14:00:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 14:00:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:19,618 INFO L225 Difference]: With dead ends: 2157 [2021-11-06 14:00:19,618 INFO L226 Difference]: Without dead ends: 1440 [2021-11-06 14:00:19,621 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2021-11-06 14:00:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1428. [2021-11-06 14:00:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1423 states have (on average 1.4026704146170064) internal successors, (1996), 1427 states have internal predecessors, (1996), 0 states have call successors, (0), 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-06 14:00:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1996 transitions. [2021-11-06 14:00:19,662 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1996 transitions. Word has length 22 [2021-11-06 14:00:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:19,662 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 1996 transitions. [2021-11-06 14:00:19,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1996 transitions. [2021-11-06 14:00:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 14:00:19,667 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:19,667 INFO L513 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] [2021-11-06 14:00:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 14:00:19,667 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1579824603, now seen corresponding path program 1 times [2021-11-06 14:00:19,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:19,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484845909] [2021-11-06 14:00:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:19,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:19,885 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-06 14:00:19,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:19,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484845909] [2021-11-06 14:00:19,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484845909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:19,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:19,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:19,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943725148] [2021-11-06 14:00:19,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:19,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,890 INFO L87 Difference]: Start difference. First operand 1428 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:19,974 INFO L93 Difference]: Finished difference Result 4262 states and 5961 transitions. [2021-11-06 14:00:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-06 14:00:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:19,983 INFO L225 Difference]: With dead ends: 4262 [2021-11-06 14:00:19,983 INFO L226 Difference]: Without dead ends: 2842 [2021-11-06 14:00:19,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2021-11-06 14:00:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2831. [2021-11-06 14:00:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2826 states have (on average 1.4012738853503184) internal successors, (3960), 2830 states have internal predecessors, (3960), 0 states have call successors, (0), 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-06 14:00:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3960 transitions. [2021-11-06 14:00:20,042 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3960 transitions. Word has length 23 [2021-11-06 14:00:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:20,043 INFO L470 AbstractCegarLoop]: Abstraction has 2831 states and 3960 transitions. [2021-11-06 14:00:20,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3960 transitions. [2021-11-06 14:00:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 14:00:20,045 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:20,045 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:20,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 14:00:20,046 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1729922142, now seen corresponding path program 1 times [2021-11-06 14:00:20,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:20,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477523037] [2021-11-06 14:00:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:20,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:20,173 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-06 14:00:20,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:20,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477523037] [2021-11-06 14:00:20,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477523037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:20,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:20,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:20,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346033161] [2021-11-06 14:00:20,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:20,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,176 INFO L87 Difference]: Start difference. First operand 2831 states and 3960 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:20,230 INFO L93 Difference]: Finished difference Result 2836 states and 3964 transitions. [2021-11-06 14:00:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 14:00:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:20,279 INFO L225 Difference]: With dead ends: 2836 [2021-11-06 14:00:20,280 INFO L226 Difference]: Without dead ends: 2834 [2021-11-06 14:00:20,280 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-11-06 14:00:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2832. [2021-11-06 14:00:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2827 states have (on average 1.401131941987973) internal successors, (3961), 2831 states have internal predecessors, (3961), 0 states have call successors, (0), 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-06 14:00:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3961 transitions. [2021-11-06 14:00:20,331 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3961 transitions. Word has length 24 [2021-11-06 14:00:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:20,332 INFO L470 AbstractCegarLoop]: Abstraction has 2832 states and 3961 transitions. [2021-11-06 14:00:20,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3961 transitions. [2021-11-06 14:00:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 14:00:20,333 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:20,333 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:20,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 14:00:20,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2087978565, now seen corresponding path program 1 times [2021-11-06 14:00:20,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:20,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308680187] [2021-11-06 14:00:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:20,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:20,450 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-06 14:00:20,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:20,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308680187] [2021-11-06 14:00:20,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308680187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:20,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:20,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:20,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809761777] [2021-11-06 14:00:20,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:20,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,456 INFO L87 Difference]: Start difference. First operand 2832 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:20,498 INFO L93 Difference]: Finished difference Result 2832 states and 3961 transitions. [2021-11-06 14:00:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 14:00:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:20,507 INFO L225 Difference]: With dead ends: 2832 [2021-11-06 14:00:20,507 INFO L226 Difference]: Without dead ends: 2830 [2021-11-06 14:00:20,508 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2021-11-06 14:00:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2021-11-06 14:00:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2826 states have (on average 1.4009200283085634) internal successors, (3959), 2829 states have internal predecessors, (3959), 0 states have call successors, (0), 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-06 14:00:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3959 transitions. [2021-11-06 14:00:20,562 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3959 transitions. Word has length 25 [2021-11-06 14:00:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:20,563 INFO L470 AbstractCegarLoop]: Abstraction has 2830 states and 3959 transitions. [2021-11-06 14:00:20,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3959 transitions. [2021-11-06 14:00:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 14:00:20,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:20,565 INFO L513 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] [2021-11-06 14:00:20,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 14:00:20,565 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:20,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash 302825800, now seen corresponding path program 1 times [2021-11-06 14:00:20,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:20,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920725637] [2021-11-06 14:00:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:20,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:20,677 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-06 14:00:20,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:20,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920725637] [2021-11-06 14:00:20,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920725637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:20,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:20,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:20,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806130308] [2021-11-06 14:00:20,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:20,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,679 INFO L87 Difference]: Start difference. First operand 2830 states and 3959 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 14:00:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:20,716 INFO L93 Difference]: Finished difference Result 2830 states and 3959 transitions. [2021-11-06 14:00:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-06 14:00:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:20,727 INFO L225 Difference]: With dead ends: 2830 [2021-11-06 14:00:20,727 INFO L226 Difference]: Without dead ends: 2821 [2021-11-06 14:00:20,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2021-11-06 14:00:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2821. [2021-11-06 14:00:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2818 states have (on average 1.400638750887154) internal successors, (3947), 2820 states have internal predecessors, (3947), 0 states have call successors, (0), 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-06 14:00:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3947 transitions. [2021-11-06 14:00:20,812 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3947 transitions. Word has length 26 [2021-11-06 14:00:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:20,813 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 3947 transitions. [2021-11-06 14:00:20,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 14:00:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3947 transitions. [2021-11-06 14:00:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 14:00:20,816 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:20,817 INFO L513 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-06 14:00:20,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 14:00:20,817 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -67576925, now seen corresponding path program 1 times [2021-11-06 14:00:20,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:20,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757057004] [2021-11-06 14:00:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:20,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 14:00:20,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:20,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757057004] [2021-11-06 14:00:20,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757057004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:20,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:20,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:20,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4133936] [2021-11-06 14:00:20,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:20,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:20,943 INFO L87 Difference]: Start difference. First operand 2821 states and 3947 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-06 14:00:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:21,058 INFO L93 Difference]: Finished difference Result 5756 states and 8057 transitions. [2021-11-06 14:00:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:21,059 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-06 14:00:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:21,066 INFO L225 Difference]: With dead ends: 5756 [2021-11-06 14:00:21,067 INFO L226 Difference]: Without dead ends: 2943 [2021-11-06 14:00:21,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-11-06 14:00:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2921. [2021-11-06 14:00:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2918 states have (on average 1.4016449623029472) internal successors, (4090), 2920 states have internal predecessors, (4090), 0 states have call successors, (0), 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-06 14:00:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4090 transitions. [2021-11-06 14:00:21,201 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4090 transitions. Word has length 61 [2021-11-06 14:00:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:21,201 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 4090 transitions. [2021-11-06 14:00:21,202 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-06 14:00:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4090 transitions. [2021-11-06 14:00:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 14:00:21,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:21,203 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:21,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 14:00:21,203 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1531221519, now seen corresponding path program 1 times [2021-11-06 14:00:21,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:21,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938091914] [2021-11-06 14:00:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:21,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:00:21,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:21,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938091914] [2021-11-06 14:00:21,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938091914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:21,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:21,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 14:00:21,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924924912] [2021-11-06 14:00:21,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 14:00:21,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 14:00:21,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 14:00:21,553 INFO L87 Difference]: Start difference. First operand 2921 states and 4090 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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-06 14:00:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:22,507 INFO L93 Difference]: Finished difference Result 11655 states and 16064 transitions. [2021-11-06 14:00:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 14:00:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 69 [2021-11-06 14:00:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:22,551 INFO L225 Difference]: With dead ends: 11655 [2021-11-06 14:00:22,551 INFO L226 Difference]: Without dead ends: 8742 [2021-11-06 14:00:22,560 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-06 14:00:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8742 states. [2021-11-06 14:00:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8742 to 3025. [2021-11-06 14:00:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.3904698874917274) internal successors, (4202), 3024 states have internal predecessors, (4202), 0 states have call successors, (0), 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-06 14:00:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4202 transitions. [2021-11-06 14:00:22,768 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4202 transitions. Word has length 69 [2021-11-06 14:00:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:22,769 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4202 transitions. [2021-11-06 14:00:22,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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-06 14:00:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4202 transitions. [2021-11-06 14:00:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 14:00:22,770 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:22,771 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 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-06 14:00:22,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 14:00:22,771 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 605807179, now seen corresponding path program 1 times [2021-11-06 14:00:22,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:22,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309280831] [2021-11-06 14:00:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:22,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:00:23,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:23,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309280831] [2021-11-06 14:00:23,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309280831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:23,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:23,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 14:00:23,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509339276] [2021-11-06 14:00:23,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 14:00:23,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 14:00:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 14:00:23,333 INFO L87 Difference]: Start difference. First operand 3025 states and 4202 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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-06 14:00:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:24,526 INFO L93 Difference]: Finished difference Result 10578 states and 14567 transitions. [2021-11-06 14:00:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 14:00:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 71 [2021-11-06 14:00:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:24,539 INFO L225 Difference]: With dead ends: 10578 [2021-11-06 14:00:24,540 INFO L226 Difference]: Without dead ends: 7561 [2021-11-06 14:00:24,545 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-06 14:00:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7561 states. [2021-11-06 14:00:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7561 to 3025. [2021-11-06 14:00:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.3904698874917274) internal successors, (4202), 3024 states have internal predecessors, (4202), 0 states have call successors, (0), 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-06 14:00:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4202 transitions. [2021-11-06 14:00:24,714 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4202 transitions. Word has length 71 [2021-11-06 14:00:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:24,714 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4202 transitions. [2021-11-06 14:00:24,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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-06 14:00:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4202 transitions. [2021-11-06 14:00:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 14:00:24,716 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:24,716 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 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-06 14:00:24,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 14:00:24,717 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 449215055, now seen corresponding path program 1 times [2021-11-06 14:00:24,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:24,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235309335] [2021-11-06 14:00:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:24,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:00:24,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:24,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235309335] [2021-11-06 14:00:24,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235309335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:24,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:24,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 14:00:24,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402737294] [2021-11-06 14:00:24,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:00:24,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:00:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:24,968 INFO L87 Difference]: Start difference. First operand 3025 states and 4202 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-06 14:00:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:25,247 INFO L93 Difference]: Finished difference Result 8679 states and 12120 transitions. [2021-11-06 14:00:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:00:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 73 [2021-11-06 14:00:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:25,259 INFO L225 Difference]: With dead ends: 8679 [2021-11-06 14:00:25,259 INFO L226 Difference]: Without dead ends: 5646 [2021-11-06 14:00:25,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:00:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2021-11-06 14:00:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 3025. [2021-11-06 14:00:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.387822634017207) internal successors, (4194), 3024 states have internal predecessors, (4194), 0 states have call successors, (0), 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-06 14:00:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4194 transitions. [2021-11-06 14:00:25,417 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4194 transitions. Word has length 73 [2021-11-06 14:00:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:25,418 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4194 transitions. [2021-11-06 14:00:25,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-06 14:00:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4194 transitions. [2021-11-06 14:00:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 14:00:25,420 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:25,420 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 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-06 14:00:25,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 14:00:25,420 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash 77040683, now seen corresponding path program 1 times [2021-11-06 14:00:25,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:25,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684134528] [2021-11-06 14:00:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:25,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 14:00:26,528 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 14:00:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 14:00:27,659 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-06 14:00:27,659 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 14:00:27,660 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:00:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:00:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:00:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:00:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 14:00:27,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 14:00:27,664 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:27,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 14:00:28,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 02:00:28 BoogieIcfgContainer [2021-11-06 14:00:28,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 14:00:28,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 14:00:28,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 14:00:28,129 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 14:00:28,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:15" (3/4) ... [2021-11-06 14:00:28,132 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 14:00:28,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 14:00:28,133 INFO L168 Benchmark]: Toolchain (without parser) took 21074.80 ms. Allocated memory was 96.5 MB in the beginning and 885.0 MB in the end (delta: 788.5 MB). Free memory was 58.2 MB in the beginning and 562.9 MB in the end (delta: -504.7 MB). Peak memory consumption was 286.4 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,133 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 96.5 MB. Free memory was 53.8 MB in the beginning and 53.8 MB in the end (delta: 43.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 14:00:28,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1003.90 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 58.0 MB in the beginning and 61.8 MB in the end (delta: -3.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 186.77 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 61.3 MB in the beginning and 92.9 MB in the end (delta: -31.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,134 INFO L168 Benchmark]: Boogie Preprocessor took 129.80 ms. Allocated memory is still 142.6 MB. Free memory was 92.9 MB in the beginning and 77.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,134 INFO L168 Benchmark]: RCFGBuilder took 7480.88 ms. Allocated memory was 142.6 MB in the beginning and 408.9 MB in the end (delta: 266.3 MB). Free memory was 77.7 MB in the beginning and 157.4 MB in the end (delta: -79.7 MB). Peak memory consumption was 231.6 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,134 INFO L168 Benchmark]: TraceAbstraction took 12264.74 ms. Allocated memory was 408.9 MB in the beginning and 885.0 MB in the end (delta: 476.1 MB). Free memory was 156.4 MB in the beginning and 562.9 MB in the end (delta: -406.5 MB). Peak memory consumption was 375.7 MB. Max. memory is 16.1 GB. [2021-11-06 14:00:28,135 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 885.0 MB. Free memory is still 562.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 14:00:28,136 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.18 ms. Allocated memory is still 96.5 MB. Free memory was 53.8 MB in the beginning and 53.8 MB in the end (delta: 43.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1003.90 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 58.0 MB in the beginning and 61.8 MB in the end (delta: -3.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 186.77 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 61.3 MB in the beginning and 92.9 MB in the end (delta: -31.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 129.80 ms. Allocated memory is still 142.6 MB. Free memory was 92.9 MB in the beginning and 77.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * RCFGBuilder took 7480.88 ms. Allocated memory was 142.6 MB in the beginning and 408.9 MB in the end (delta: 266.3 MB). Free memory was 77.7 MB in the beginning and 157.4 MB in the end (delta: -79.7 MB). Peak memory consumption was 231.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12264.74 ms. Allocated memory was 408.9 MB in the beginning and 885.0 MB in the end (delta: 476.1 MB). Free memory was 156.4 MB in the beginning and 562.9 MB in the end (delta: -406.5 MB). Peak memory consumption was 375.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.89 ms. Allocated memory is still 885.0 MB. Free memory is still 562.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 3766. Possible FailurePath: [L3758] int ldv_state_variable_1 ; [L3759] int LDV_IN_INTERRUPT = 1; [L3760] int usb_counter ; [L3761] struct usb_interface *gtco_driverinfo_table_group1 ; [L3762] int ref_cnt ; [L3763] int ldv_state_variable_0 ; [L3830-L3844] static struct usb_device_id const gtco_usbid_table[6U] = { {3U, 1932U, 1024U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 1025U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4096U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4097U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4098U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L3845] struct usb_device_id const __mod_usb_device_table ; [L4829-L4834] static struct usb_driver gtco_driverinfo_table = {"gtco", & gtco_probe, & gtco_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& gtco_usbid_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4850] int ldv_retval_0 ; [L4851] int ldv_retval_1 ; [L5064] int INTERF_STATE = 0; [L5065] int SERIAL_STATE = 0; [L5066] void *usb_intfdata = 0; [L5067] struct urb *usb_urb = 0; [L5068] struct usb_device *usb_dev = 0; [L5069] int dev_counter = 0; [L5070] int completeFnIntCounter = 0; [L5071] int completeFnBulkCounter = 0; [L5072] void (*completeFnInt)(struct urb * ) ; [L5073] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4865] struct usb_device_id *ldvarg0 ; [L4866] void *tmp ; [L4867] int tmp___0 ; [L4868] int tmp___1 ; [L4869] int tmp___2 ; [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] tmp = ldv_zalloc(32UL) [L4872] ldvarg0 = (struct usb_device_id *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4874] ldv_state_variable_1 = 0 [L4875] ref_cnt = 0 [L4876] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: [L4922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4923] COND TRUE ldv_state_variable_0 == 1 [L4837] int tmp ; [L5036] ldv_func_ret_type ldv_func_res ; [L5037] int tmp ; [L5370] return __VERIFIER_nondet_int(); [L5039] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5040] ldv_func_res = tmp [L5041] ldv_state_variable_1 = 1 [L5042] usb_counter = 0 [L4856] void *tmp ; [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] tmp = ldv_zalloc(1520UL) [L4859] gtco_driverinfo_table_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5044] return (ldv_func_res); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4839] tmp = ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4840] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4924] ldv_retval_1 = gtco_driverinfo_table_init() [L4925] COND TRUE ldv_retval_1 == 0 [L4926] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4929] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4881] COND TRUE ldv_state_variable_1 != 0 [L4882] tmp___1 = __VERIFIER_nondet_int() [L4884] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4885] COND TRUE ldv_state_variable_1 == 1 [L4569] struct gtco *gtco ; [L4570] struct input_dev *input_dev ; [L4571] struct hid_descriptor *hid_desc ; [L4572] char *report ; [L4573] int result ; [L4574] int retry ; [L4575] int error ; [L4576] struct usb_endpoint_descriptor *endpoint ; [L4577] void *tmp ; [L4578] struct usb_device *tmp___0 ; [L4579] void *tmp___1 ; [L4580] struct _ddebug descriptor ; [L4581] long tmp___2 ; [L4582] struct _ddebug descriptor___0 ; [L4583] long tmp___3 ; [L4584] struct _ddebug descriptor___1 ; [L4585] long tmp___4 ; [L4586] struct _ddebug descriptor___2 ; [L4587] long tmp___5 ; [L4588] struct _ddebug descriptor___3 ; [L4589] long tmp___6 ; [L4590] int tmp___7 ; [L4591] struct _ddebug descriptor___4 ; [L4592] long tmp___8 ; [L4593] int tmp___9 ; [L4594] struct _ddebug descriptor___5 ; [L4595] long tmp___10 ; [L4596] void *tmp___11 ; [L4597] unsigned int tmp___12 ; [L4598] struct _ddebug descriptor___6 ; [L4599] long tmp___13 ; [L4600] unsigned int tmp___14 ; [L4602] result = 0 [L3667] void *tmp ; [L3658] void *tmp___2 ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4603] tmp = kzalloc(152UL, 208U) [L4604] gtco = (struct gtco *)tmp [L3667] void *tmp ; [L3658] void *tmp___2 ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L4605] input_dev = input_allocate_device() [L4606] COND FALSE !((unsigned long )gtco == (unsigned long )((struct gtco *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L4612] gtco->inputdevice = input_dev [L4956] struct usb_device *tmp ; [L5177] void *result ; [L5178] void *tmp ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] tmp = ldv_malloc(sizeof(struct usb_device)) [L5181] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5182] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5186] return (result); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4958] tmp = ldv_interface_to_usbdev() [L4959] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4613] tmp___0 = interface_to_usbdev(usbinterface) [L4980] struct usb_device *tmp ; [L5191] int tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5193] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)0) [L3717] int tmp ; [L3719] tmp = __VERIFIER_nondet_int() [L3720] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] tmp = ldv_undef_int() [L5195] COND TRUE \read(tmp) [L5196] dev_counter = dev_counter + 1 [L5197] usb_dev = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5205] return (usb_dev); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4982] tmp = ldv_get_dev(ldv_func_arg1) [L4983] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4614] gtco->usbdev = ldv_usb_get_dev_4(tmp___0) [L4615] gtco->intf = usbinterface [L4616] EXPR gtco->usbdev [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND TRUE tmp___0 != 0 [L3689] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] return ldv_malloc(0UL); [L4616] tmp___1 = usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4617] gtco->buffer = (unsigned char *)tmp___1 [L4618] EXPR gtco->buffer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4618] COND TRUE (unsigned long )gtco->buffer == (unsigned long )((unsigned char *)0U) [L4620] error = -12 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4886] ldv_retval_0 = gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4887] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4915] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5051] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4917] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5283] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5287] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3735] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 3735]: 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: 3735]: 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: 3735]: 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: 3735]: 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, 388 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6737 SDtfs, 9460 SDslu, 10197 SDs, 0 SdLazy, 389 SolverSat, 53 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3025occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 12936 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 506 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 29/29 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-06 14:00:28,219 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.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 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 14:00:30,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 14:00:30,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 14:00:30,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 14:00:30,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 14:00:30,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 14:00:30,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 14:00:30,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 14:00:30,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 14:00:30,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 14:00:30,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 14:00:30,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 14:00:30,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 14:00:30,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 14:00:30,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 14:00:30,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 14:00:30,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 14:00:30,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 14:00:30,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 14:00:30,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 14:00:30,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 14:00:30,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 14:00:30,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 14:00:30,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 14:00:30,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 14:00:30,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 14:00:30,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 14:00:30,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 14:00:30,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 14:00:30,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 14:00:30,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 14:00:30,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 14:00:30,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 14:00:30,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 14:00:30,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 14:00:30,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 14:00:30,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 14:00:30,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 14:00:30,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 14:00:30,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 14:00:30,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 14:00:30,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 14:00:30,226 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 14:00:30,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 14:00:30,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 14:00:30,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 14:00:30,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 14:00:30,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 14:00:30,229 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 14:00:30,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 14:00:30,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 14:00:30,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 14:00:30,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 14:00:30,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 14:00:30,231 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 14:00:30,231 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 14:00:30,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 14:00:30,231 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 14:00:30,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 14:00:30,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 14:00:30,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 14:00:30,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 14:00:30,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:30,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 14:00:30,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 14:00:30,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 14:00:30,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 14:00:30,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 14:00:30,234 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 -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-06 14:00:30,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 14:00:30,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 14:00:30,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 14:00:30,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 14:00:30,503 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 14:00:30,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:30,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71614fbc/0aec031583dc460098b15362f7a567a1/FLAG5a6ed84f2 [2021-11-06 14:00:31,102 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 14:00:31,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:31,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71614fbc/0aec031583dc460098b15362f7a567a1/FLAG5a6ed84f2 [2021-11-06 14:00:31,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71614fbc/0aec031583dc460098b15362f7a567a1 [2021-11-06 14:00:31,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 14:00:31,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 14:00:31,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:31,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 14:00:31,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 14:00:31,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:31" (1/1) ... [2021-11-06 14:00:31,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a2131b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:31, skipping insertion in model container [2021-11-06 14:00:31,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:31" (1/1) ... [2021-11-06 14:00:31,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 14:00:31,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 14:00:32,050 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-06 14:00:32,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:32,340 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 14:00:32,436 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-06 14:00:32,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:32,612 INFO L208 MainTranslator]: Completed translation [2021-11-06 14:00:32,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32 WrapperNode [2021-11-06 14:00:32,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:32,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:32,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 14:00:32,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 14:00:32,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:32,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 14:00:32,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 14:00:32,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 14:00:32,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 14:00:32,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 14:00:32,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 14:00:32,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 14:00:32,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (1/1) ... [2021-11-06 14:00:32,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:32,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:00:32,966 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-06 14:00:32,996 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-06 14:00:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 14:00:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 14:00:33,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 14:00:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 14:00:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 14:00:33,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 14:00:45,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 14:00:45,979 INFO L299 CfgBuilder]: Removed 310 assume(true) statements. [2021-11-06 14:00:45,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:45 BoogieIcfgContainer [2021-11-06 14:00:45,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 14:00:45,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 14:00:45,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 14:00:45,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 14:00:45,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:00:31" (1/3) ... [2021-11-06 14:00:45,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b73eeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:45, skipping insertion in model container [2021-11-06 14:00:45,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:32" (2/3) ... [2021-11-06 14:00:45,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b73eeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:45, skipping insertion in model container [2021-11-06 14:00:45,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:45" (3/3) ... [2021-11-06 14:00:45,987 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-06 14:00:45,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 14:00:45,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-06 14:00:46,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 14:00:46,030 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-06 14:00:46,030 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-06 14:00:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 0 states have call successors, (0), 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-06 14:00:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 14:00:46,052 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:46,053 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:46,053 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1148713798, now seen corresponding path program 1 times [2021-11-06 14:00:46,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:00:46,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077719861] [2021-11-06 14:00:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:46,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:00:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:00:46,077 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-06 14:00:46,119 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-06 14:00:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:48,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:00:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:00:48,129 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-06 14:00:48,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:00:48,206 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-06 14:00:48,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:00:48,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077719861] [2021-11-06 14:00:48,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077719861] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:48,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:48,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 14:00:48,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488509992] [2021-11-06 14:00:48,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:00:48,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:00:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:00:48,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:48,224 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:50,622 INFO L93 Difference]: Finished difference Result 1468 states and 2191 transitions. [2021-11-06 14:00:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:00:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-06 14:00:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:50,644 INFO L225 Difference]: With dead ends: 1468 [2021-11-06 14:00:50,645 INFO L226 Difference]: Without dead ends: 1069 [2021-11-06 14:00:50,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-11-06 14:00:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2021-11-06 14:00:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1064 states have (on average 1.4078947368421053) internal successors, (1498), 1068 states have internal predecessors, (1498), 0 states have call successors, (0), 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-06 14:00:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1498 transitions. [2021-11-06 14:00:50,754 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1498 transitions. Word has length 15 [2021-11-06 14:00:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:50,755 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1498 transitions. [2021-11-06 14:00:50,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1498 transitions. [2021-11-06 14:00:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 14:00:50,756 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:50,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:50,793 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-06 14:00:50,981 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-06 14:00:50,981 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1888760138, now seen corresponding path program 1 times [2021-11-06 14:00:50,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:00:50,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368166996] [2021-11-06 14:00:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:50,986 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:00:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:00:50,987 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-06 14:00:51,006 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-06 14:00:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:52,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:00:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:00:52,814 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-06 14:00:52,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:00:52,854 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-06 14:00:52,855 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:00:52,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368166996] [2021-11-06 14:00:52,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368166996] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:52,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:52,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 14:00:52,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954333390] [2021-11-06 14:00:52,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:52,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:00:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:52,857 INFO L87 Difference]: Start difference. First operand 1069 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:53,068 INFO L93 Difference]: Finished difference Result 1099 states and 1526 transitions. [2021-11-06 14:00:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 14:00:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:53,077 INFO L225 Difference]: With dead ends: 1099 [2021-11-06 14:00:53,078 INFO L226 Difference]: Without dead ends: 1084 [2021-11-06 14:00:53,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-11-06 14:00:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1069. [2021-11-06 14:00:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1064 states have (on average 1.406954887218045) internal successors, (1497), 1068 states have internal predecessors, (1497), 0 states have call successors, (0), 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-06 14:00:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1497 transitions. [2021-11-06 14:00:53,110 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1497 transitions. Word has length 22 [2021-11-06 14:00:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:53,110 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1497 transitions. [2021-11-06 14:00:53,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1497 transitions. [2021-11-06 14:00:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 14:00:53,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:53,112 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:53,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-06 14:00:53,329 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-06 14:00:53,329 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1888700556, now seen corresponding path program 1 times [2021-11-06 14:00:53,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:00:53,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476887962] [2021-11-06 14:00:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:53,333 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:00:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:00:53,334 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-06 14:00:53,336 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-06 14:00:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:55,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 14:00:55,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:00:55,419 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-06 14:00:55,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:00:55,577 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-06 14:00:55,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:00:55,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476887962] [2021-11-06 14:00:55,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476887962] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:55,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:55,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-06 14:00:55,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232883801] [2021-11-06 14:00:55,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:00:55,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:00:55,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:00:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:55,579 INFO L87 Difference]: Start difference. First operand 1069 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-06 14:00:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:55,771 INFO L93 Difference]: Finished difference Result 3189 states and 4472 transitions. [2021-11-06 14:00:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:00:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 14:00:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:55,779 INFO L225 Difference]: With dead ends: 3189 [2021-11-06 14:00:55,779 INFO L226 Difference]: Without dead ends: 2128 [2021-11-06 14:00:55,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2021-11-06 14:00:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2116. [2021-11-06 14:00:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2111 states have (on average 1.4050213169114163) internal successors, (2966), 2115 states have internal predecessors, (2966), 0 states have call successors, (0), 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-06 14:00:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2966 transitions. [2021-11-06 14:00:55,826 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2966 transitions. Word has length 22 [2021-11-06 14:00:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:55,827 INFO L470 AbstractCegarLoop]: Abstraction has 2116 states and 2966 transitions. [2021-11-06 14:00:55,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-06 14:00:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2966 transitions. [2021-11-06 14:00:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 14:00:55,829 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:55,829 INFO L513 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] [2021-11-06 14:00:55,852 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-06 14:00:56,050 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-06 14:00:56,050 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1579824603, now seen corresponding path program 1 times [2021-11-06 14:00:56,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:00:56,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957721362] [2021-11-06 14:00:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:56,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:00:56,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:00:56,054 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-06 14:00:56,056 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-06 14:00:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:58,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 14:00:58,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:00:58,407 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-06 14:00:58,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:00:58,693 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-06 14:00:58,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:00:58,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957721362] [2021-11-06 14:00:58,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957721362] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:58,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:58,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-06 14:00:58,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780411418] [2021-11-06 14:00:58,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:00:58,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:00:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:00:58,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:58,696 INFO L87 Difference]: Start difference. First operand 2116 states and 2966 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-06 14:00:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:58,961 INFO L93 Difference]: Finished difference Result 8403 states and 11785 transitions. [2021-11-06 14:00:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:00:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 23 [2021-11-06 14:00:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:58,987 INFO L225 Difference]: With dead ends: 8403 [2021-11-06 14:00:58,988 INFO L226 Difference]: Without dead ends: 6295 [2021-11-06 14:00:58,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2021-11-06 14:00:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 4193. [2021-11-06 14:00:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4193 states, 4188 states have (on average 1.4030563514804202) internal successors, (5876), 4192 states have internal predecessors, (5876), 0 states have call successors, (0), 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-06 14:00:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 5876 transitions. [2021-11-06 14:00:59,149 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 5876 transitions. Word has length 23 [2021-11-06 14:00:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:59,149 INFO L470 AbstractCegarLoop]: Abstraction has 4193 states and 5876 transitions. [2021-11-06 14:00:59,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-06 14:00:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 5876 transitions. [2021-11-06 14:00:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 14:00:59,153 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:59,153 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:59,184 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-06 14:00:59,375 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-06 14:00:59,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:00:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1729922142, now seen corresponding path program 1 times [2021-11-06 14:00:59,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:00:59,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741529304] [2021-11-06 14:00:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:59,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:00:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:00:59,381 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-06 14:00:59,382 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-06 14:01:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:01,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:01:01,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:01,327 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-06 14:01:01,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:01,447 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-06 14:01:01,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:01,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741529304] [2021-11-06 14:01:01,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741529304] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:01,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:01,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 14:01:01,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965121079] [2021-11-06 14:01:01,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:01:01,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:01:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:01,448 INFO L87 Difference]: Start difference. First operand 4193 states and 5876 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:01:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:01,637 INFO L93 Difference]: Finished difference Result 6287 states and 8808 transitions. [2021-11-06 14:01:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:01:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 14:01:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:01,657 INFO L225 Difference]: With dead ends: 6287 [2021-11-06 14:01:01,657 INFO L226 Difference]: Without dead ends: 6285 [2021-11-06 14:01:01,659 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2021-11-06 14:01:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6283. [2021-11-06 14:01:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6283 states, 6278 states have (on average 1.4025167250716788) internal successors, (8805), 6282 states have internal predecessors, (8805), 0 states have call successors, (0), 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-06 14:01:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6283 states to 6283 states and 8805 transitions. [2021-11-06 14:01:01,827 INFO L78 Accepts]: Start accepts. Automaton has 6283 states and 8805 transitions. Word has length 24 [2021-11-06 14:01:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:01,828 INFO L470 AbstractCegarLoop]: Abstraction has 6283 states and 8805 transitions. [2021-11-06 14:01:01,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:01:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6283 states and 8805 transitions. [2021-11-06 14:01:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 14:01:01,829 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:01,829 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:01,869 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-06 14:01:02,042 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-06 14:01:02,043 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2087978565, now seen corresponding path program 1 times [2021-11-06 14:01:02,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:02,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204053625] [2021-11-06 14:01:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:02,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:02,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:02,048 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-06 14:01:02,049 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-06 14:01:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:03,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:01:03,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:04,081 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-06 14:01:04,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:04,267 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-06 14:01:04,267 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:04,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204053625] [2021-11-06 14:01:04,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204053625] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:04,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:04,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 14:01:04,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081241945] [2021-11-06 14:01:04,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:01:04,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:04,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:01:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:04,269 INFO L87 Difference]: Start difference. First operand 6283 states and 8805 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:01:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:04,392 INFO L93 Difference]: Finished difference Result 6283 states and 8805 transitions. [2021-11-06 14:01:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:01:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 14:01:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:04,410 INFO L225 Difference]: With dead ends: 6283 [2021-11-06 14:01:04,410 INFO L226 Difference]: Without dead ends: 6281 [2021-11-06 14:01:04,412 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2021-11-06 14:01:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6281. [2021-11-06 14:01:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6277 states have (on average 1.4024215389517285) internal successors, (8803), 6280 states have internal predecessors, (8803), 0 states have call successors, (0), 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-06 14:01:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8803 transitions. [2021-11-06 14:01:04,640 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8803 transitions. Word has length 25 [2021-11-06 14:01:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:04,642 INFO L470 AbstractCegarLoop]: Abstraction has 6281 states and 8803 transitions. [2021-11-06 14:01:04,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:01:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8803 transitions. [2021-11-06 14:01:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 14:01:04,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:04,644 INFO L513 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] [2021-11-06 14:01:04,687 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-06 14:01:04,857 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-06 14:01:04,857 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 302825800, now seen corresponding path program 1 times [2021-11-06 14:01:04,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:04,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946826986] [2021-11-06 14:01:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:04,860 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:04,862 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-06 14:01:04,863 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-06 14:01:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:06,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:01:06,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:07,072 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-06 14:01:07,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:07,209 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-06 14:01:07,209 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:07,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946826986] [2021-11-06 14:01:07,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946826986] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:07,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:07,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 14:01:07,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926264230] [2021-11-06 14:01:07,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:01:07,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:01:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:07,211 INFO L87 Difference]: Start difference. First operand 6281 states and 8803 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 14:01:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:07,335 INFO L93 Difference]: Finished difference Result 6281 states and 8803 transitions. [2021-11-06 14:01:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:01:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-06 14:01:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:07,363 INFO L225 Difference]: With dead ends: 6281 [2021-11-06 14:01:07,363 INFO L226 Difference]: Without dead ends: 6272 [2021-11-06 14:01:07,366 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2021-11-06 14:01:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 6272. [2021-11-06 14:01:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6269 states have (on average 1.4022970170681128) internal successors, (8791), 6271 states have internal predecessors, (8791), 0 states have call successors, (0), 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-06 14:01:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 8791 transitions. [2021-11-06 14:01:07,601 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 8791 transitions. Word has length 26 [2021-11-06 14:01:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:07,602 INFO L470 AbstractCegarLoop]: Abstraction has 6272 states and 8791 transitions. [2021-11-06 14:01:07,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 14:01:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 8791 transitions. [2021-11-06 14:01:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 14:01:07,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:07,606 INFO L513 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-06 14:01:07,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 14:01:07,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 14:01:07,828 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -67576925, now seen corresponding path program 1 times [2021-11-06 14:01:07,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:07,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083586744] [2021-11-06 14:01:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:07,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:07,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:07,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 14:01:07,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 14:01:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:09,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 14:01:09,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 14:01:10,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 14:01:10,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:10,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083586744] [2021-11-06 14:01:10,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083586744] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:10,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:10,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 14:01:10,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728589608] [2021-11-06 14:01:10,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:01:10,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:01:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:10,378 INFO L87 Difference]: Start difference. First operand 6272 states and 8791 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-06 14:01:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:10,838 INFO L93 Difference]: Finished difference Result 12795 states and 17951 transitions. [2021-11-06 14:01:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:01:10,839 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-06 14:01:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:10,861 INFO L225 Difference]: With dead ends: 12795 [2021-11-06 14:01:10,861 INFO L226 Difference]: Without dead ends: 6531 [2021-11-06 14:01:10,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:01:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2021-11-06 14:01:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 6487. [2021-11-06 14:01:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6487 states, 6484 states have (on average 1.4036088834053053) internal successors, (9101), 6486 states have internal predecessors, (9101), 0 states have call successors, (0), 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-06 14:01:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6487 states to 6487 states and 9101 transitions. [2021-11-06 14:01:11,053 INFO L78 Accepts]: Start accepts. Automaton has 6487 states and 9101 transitions. Word has length 61 [2021-11-06 14:01:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:11,053 INFO L470 AbstractCegarLoop]: Abstraction has 6487 states and 9101 transitions. [2021-11-06 14:01:11,053 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-06 14:01:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6487 states and 9101 transitions. [2021-11-06 14:01:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 14:01:11,055 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:11,055 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 14:01:11,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 14:01:11,270 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1531221519, now seen corresponding path program 1 times [2021-11-06 14:01:11,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:11,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645976099] [2021-11-06 14:01:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:11,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:11,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:11,275 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 14:01:11,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 14:01:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:13,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 14:01:13,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:13,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:14,395 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:14,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645976099] [2021-11-06 14:01:14,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645976099] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:14,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:14,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-06 14:01:14,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238936445] [2021-11-06 14:01:14,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 14:01:14,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 14:01:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-06 14:01:14,397 INFO L87 Difference]: Start difference. First operand 6487 states and 9101 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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-06 14:01:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:20,328 INFO L93 Difference]: Finished difference Result 25717 states and 35555 transitions. [2021-11-06 14:01:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 14:01:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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 69 [2021-11-06 14:01:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:20,372 INFO L225 Difference]: With dead ends: 25717 [2021-11-06 14:01:20,372 INFO L226 Difference]: Without dead ends: 19238 [2021-11-06 14:01:20,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-11-06 14:01:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19238 states. [2021-11-06 14:01:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19238 to 6721. [2021-11-06 14:01:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.392229830306639) internal successors, (9353), 6720 states have internal predecessors, (9353), 0 states have call successors, (0), 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-06 14:01:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9353 transitions. [2021-11-06 14:01:20,744 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9353 transitions. Word has length 69 [2021-11-06 14:01:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:20,745 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9353 transitions. [2021-11-06 14:01:20,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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-06 14:01:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9353 transitions. [2021-11-06 14:01:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 14:01:20,749 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:20,749 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 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-06 14:01:20,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 14:01:20,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 14:01:20,963 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 605807179, now seen corresponding path program 1 times [2021-11-06 14:01:20,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:20,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155569043] [2021-11-06 14:01:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:20,966 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:20,967 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 14:01:20,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 14:01:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:23,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 14:01:23,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:23,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:24,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:24,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155569043] [2021-11-06 14:01:24,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155569043] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:24,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:24,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-11-06 14:01:24,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005719920] [2021-11-06 14:01:24,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 14:01:24,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 14:01:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-06 14:01:24,334 INFO L87 Difference]: Start difference. First operand 6721 states and 9353 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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-06 14:01:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:29,094 INFO L93 Difference]: Finished difference Result 23384 states and 32304 transitions. [2021-11-06 14:01:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 14:01:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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 71 [2021-11-06 14:01:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:29,128 INFO L225 Difference]: With dead ends: 23384 [2021-11-06 14:01:29,129 INFO L226 Difference]: Without dead ends: 16671 [2021-11-06 14:01:29,140 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-11-06 14:01:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16671 states. [2021-11-06 14:01:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16671 to 6721. [2021-11-06 14:01:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.392229830306639) internal successors, (9353), 6720 states have internal predecessors, (9353), 0 states have call successors, (0), 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-06 14:01:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9353 transitions. [2021-11-06 14:01:29,552 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9353 transitions. Word has length 71 [2021-11-06 14:01:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:29,552 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9353 transitions. [2021-11-06 14:01:29,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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-06 14:01:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9353 transitions. [2021-11-06 14:01:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 14:01:29,554 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:29,554 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 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-06 14:01:29,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 14:01:29,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 14:01:29,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash 449215055, now seen corresponding path program 1 times [2021-11-06 14:01:29,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:29,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994685363] [2021-11-06 14:01:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:29,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:29,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:29,783 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 14:01:29,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 14:01:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:32,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 14:01:32,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:32,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 14:01:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:32,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 14:01:32,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994685363] [2021-11-06 14:01:32,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994685363] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:32,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:32,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 14:01:32,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069358736] [2021-11-06 14:01:32,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:01:32,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 14:01:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:01:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:01:32,562 INFO L87 Difference]: Start difference. First operand 6721 states and 9353 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-06 14:01:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:33,650 INFO L93 Difference]: Finished difference Result 19307 states and 27015 transitions. [2021-11-06 14:01:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:01:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 73 [2021-11-06 14:01:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:33,708 INFO L225 Difference]: With dead ends: 19307 [2021-11-06 14:01:33,708 INFO L226 Difference]: Without dead ends: 12558 [2021-11-06 14:01:33,720 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 14:01:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12558 states. [2021-11-06 14:01:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12558 to 6721. [2021-11-06 14:01:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.3895504614468592) internal successors, (9335), 6720 states have internal predecessors, (9335), 0 states have call successors, (0), 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-06 14:01:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9335 transitions. [2021-11-06 14:01:34,066 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9335 transitions. Word has length 73 [2021-11-06 14:01:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:34,067 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9335 transitions. [2021-11-06 14:01:34,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-06 14:01:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9335 transitions. [2021-11-06 14:01:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 14:01:34,069 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:34,069 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 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-06 14:01:34,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 14:01:34,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 14:01:34,296 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-06 14:01:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash 77040683, now seen corresponding path program 1 times [2021-11-06 14:01:34,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 14:01:34,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139586608] [2021-11-06 14:01:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:34,299 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 14:01:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 14:01:34,302 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 14:01:34,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 14:07:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 14:07:51,101 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. Killed by 15