./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--touchscreen--usbtouchscreen.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--touchscreen--usbtouchscreen.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 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 14:00:20,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 14:00:20,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 14:00:20,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 14:00:20,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 14:00:20,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 14:00:20,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 14:00:20,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 14:00:20,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 14:00:20,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 14:00:20,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 14:00:20,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 14:00:20,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 14:00:20,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 14:00:20,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 14:00:20,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 14:00:20,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 14:00:20,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 14:00:20,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 14:00:20,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 14:00:20,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 14:00:20,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 14:00:20,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 14:00:20,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 14:00:20,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 14:00:20,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 14:00:20,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 14:00:20,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 14:00:20,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 14:00:20,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 14:00:20,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 14:00:20,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 14:00:20,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 14:00:20,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 14:00:20,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 14:00:20,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 14:00:20,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 14:00:20,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 14:00:20,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 14:00:20,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 14:00:20,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 14:00:20,742 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:20,758 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 14:00:20,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 14:00:20,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 14:00:20,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 14:00:20,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 14:00:20,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 14:00:20,760 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 14:00:20,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 14:00:20,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 14:00:20,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 14:00:20,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 14:00:20,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:20,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 14:00:20,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 14:00:20,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 14:00:20,764 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 14:00:20,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 14:00:20,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 14:00:20,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 14:00:20,764 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 -> 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f [2021-11-06 14:00:20,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 14:00:20,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 14:00:20,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 14:00:20,964 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 14:00:20,965 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 14:00:20,966 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--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2021-11-06 14:00:21,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e967d3670/cf829c234fd84ad286736cb0f5feff95/FLAG6dbe6403a [2021-11-06 14:00:21,536 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 14:00:21,537 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--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2021-11-06 14:00:21,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e967d3670/cf829c234fd84ad286736cb0f5feff95/FLAG6dbe6403a [2021-11-06 14:00:21,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e967d3670/cf829c234fd84ad286736cb0f5feff95 [2021-11-06 14:00:21,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 14:00:21,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 14:00:21,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:21,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 14:00:21,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 14:00:21,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:21" (1/1) ... [2021-11-06 14:00:21,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395a9e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:21, skipping insertion in model container [2021-11-06 14:00:21,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:00:21" (1/1) ... [2021-11-06 14:00:21,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 14:00:21,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 14:00:22,391 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--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2021-11-06 14:00:22,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:22,750 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 14:00:22,814 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--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2021-11-06 14:00:23,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 14:00:23,102 INFO L208 MainTranslator]: Completed translation [2021-11-06 14:00:23,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:23 WrapperNode [2021-11-06 14:00:23,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 14:00:23,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:23,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 14:00:23,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 14:00:23,109 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:23" (1/1) ... [2021-11-06 14:00:23,188 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:23" (1/1) ... [2021-11-06 14:00:23,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 14:00:23,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 14:00:23,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 14:00:23,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 14:00:23,369 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:23" (1/1) ... [2021-11-06 14:00:23,369 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:23" (1/1) ... [2021-11-06 14:00:23,412 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:23" (1/1) ... [2021-11-06 14:00:23,412 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:23" (1/1) ... [2021-11-06 14:00:23,504 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:23" (1/1) ... [2021-11-06 14:00:23,526 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:23" (1/1) ... [2021-11-06 14:00:23,545 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:23" (1/1) ... [2021-11-06 14:00:23,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 14:00:23,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 14:00:23,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 14:00:23,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 14:00:23,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:23" (1/1) ... [2021-11-06 14:00:23,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 14:00:23,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:00:23,607 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:23,613 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:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 14:00:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2021-11-06 14:00:23,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2021-11-06 14:00:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_5 [2021-11-06 14:00:23,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_5 [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2021-11-06 14:00:23,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-06 14:00:23,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-06 14:00:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2021-11-06 14:00:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2021-11-06 14:00:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2021-11-06 14:00:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2021-11-06 14:00:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2021-11-06 14:00:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2021-11-06 14:00:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 14:00:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 14:00:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_22 [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_22 [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_16 [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_16 [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2021-11-06 14:00:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2021-11-06 14:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_open [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_open [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 14:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2021-11-06 14:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2021-11-06 14:00:30,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 14:00:30,198 INFO L299 CfgBuilder]: Removed 685 assume(true) statements. [2021-11-06 14:00:30,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:30 BoogieIcfgContainer [2021-11-06 14:00:30,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 14:00:30,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 14:00:30,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 14:00:30,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 14:00:30,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:00:21" (1/3) ... [2021-11-06 14:00:30,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179f4d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:30, skipping insertion in model container [2021-11-06 14:00:30,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:00:23" (2/3) ... [2021-11-06 14:00:30,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179f4d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:00:30, skipping insertion in model container [2021-11-06 14:00:30,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:00:30" (3/3) ... [2021-11-06 14:00:30,209 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2021-11-06 14:00:30,214 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 14:00:30,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-06 14:00:30,257 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 14:00:30,262 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:30,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-06 14:00:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 922 states, 856 states have (on average 1.419392523364486) internal successors, (1215), 867 states have internal predecessors, (1215), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2021-11-06 14:00:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-06 14:00:30,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:30,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:30,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 55747401, now seen corresponding path program 1 times [2021-11-06 14:00:30,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:30,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497096070] [2021-11-06 14:00:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:30,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:30,769 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:30,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:30,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497096070] [2021-11-06 14:00:30,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497096070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:30,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:30,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:30,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822815148] [2021-11-06 14:00:30,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:30,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:30,785 INFO L87 Difference]: Start difference. First operand has 922 states, 856 states have (on average 1.419392523364486) internal successors, (1215), 867 states have internal predecessors, (1215), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:33,096 INFO L93 Difference]: Finished difference Result 2720 states and 3883 transitions. [2021-11-06 14:00:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-06 14:00:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:33,122 INFO L225 Difference]: With dead ends: 2720 [2021-11-06 14:00:33,123 INFO L226 Difference]: Without dead ends: 1767 [2021-11-06 14:00:33,137 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:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2021-11-06 14:00:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1761. [2021-11-06 14:00:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1639 states have (on average 1.3691275167785235) internal successors, (2244), 1652 states have internal predecessors, (2244), 74 states have call successors, (74), 40 states have call predecessors, (74), 40 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-06 14:00:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2392 transitions. [2021-11-06 14:00:33,264 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2392 transitions. Word has length 17 [2021-11-06 14:00:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:33,265 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2392 transitions. [2021-11-06 14:00:33,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2392 transitions. [2021-11-06 14:00:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 14:00:33,270 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:33,270 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:33,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 14:00:33,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash 772708412, now seen corresponding path program 1 times [2021-11-06 14:00:33,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:33,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51247302] [2021-11-06 14:00:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:33,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:33,486 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:33,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:33,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51247302] [2021-11-06 14:00:33,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51247302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:33,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:33,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:33,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696337433] [2021-11-06 14:00:33,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:33,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:33,494 INFO L87 Difference]: Start difference. First operand 1761 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:33,597 INFO L93 Difference]: Finished difference Result 1791 states and 2420 transitions. [2021-11-06 14:00:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:33,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 14:00:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:33,605 INFO L225 Difference]: With dead ends: 1791 [2021-11-06 14:00:33,606 INFO L226 Difference]: Without dead ends: 1776 [2021-11-06 14:00:33,607 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:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2021-11-06 14:00:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1761. [2021-11-06 14:00:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1639 states have (on average 1.3685173886516169) internal successors, (2243), 1652 states have internal predecessors, (2243), 74 states have call successors, (74), 40 states have call predecessors, (74), 40 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-06 14:00:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2391 transitions. [2021-11-06 14:00:33,650 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2391 transitions. Word has length 24 [2021-11-06 14:00:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:33,650 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2391 transitions. [2021-11-06 14:00:33,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2391 transitions. [2021-11-06 14:00:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 14:00:33,651 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:33,651 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:33,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 14:00:33,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 772767994, now seen corresponding path program 1 times [2021-11-06 14:00:33,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:33,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902390990] [2021-11-06 14:00:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:33,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:33,908 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:33,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:33,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902390990] [2021-11-06 14:00:33,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902390990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:33,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:33,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:33,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506770807] [2021-11-06 14:00:33,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:33,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:33,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:33,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:33,910 INFO L87 Difference]: Start difference. First operand 1761 states and 2391 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:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:34,066 INFO L93 Difference]: Finished difference Result 5261 states and 7444 transitions. [2021-11-06 14:00:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:34,067 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:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:34,084 INFO L225 Difference]: With dead ends: 5261 [2021-11-06 14:00:34,085 INFO L226 Difference]: Without dead ends: 3510 [2021-11-06 14:00:34,128 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:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2021-11-06 14:00:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3492. [2021-11-06 14:00:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 3256 states have (on average 1.3673218673218672) internal successors, (4452), 3275 states have internal predecessors, (4452), 148 states have call successors, (148), 80 states have call predecessors, (148), 80 states have return successors, (296), 140 states have call predecessors, (296), 148 states have call successors, (296) [2021-11-06 14:00:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 4896 transitions. [2021-11-06 14:00:34,237 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 4896 transitions. Word has length 24 [2021-11-06 14:00:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:34,237 INFO L470 AbstractCegarLoop]: Abstraction has 3492 states and 4896 transitions. [2021-11-06 14:00:34,237 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:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 4896 transitions. [2021-11-06 14:00:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 14:00:34,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:34,240 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:34,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 14:00:34,240 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1813995682, now seen corresponding path program 1 times [2021-11-06 14:00:34,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:34,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190771712] [2021-11-06 14:00:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:34,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:34,401 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:34,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:34,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190771712] [2021-11-06 14:00:34,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190771712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:34,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:34,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:34,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942048911] [2021-11-06 14:00:34,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:34,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:34,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:34,403 INFO L87 Difference]: Start difference. First operand 3492 states and 4896 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:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:34,462 INFO L93 Difference]: Finished difference Result 3492 states and 4896 transitions. [2021-11-06 14:00:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:34,462 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:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:34,473 INFO L225 Difference]: With dead ends: 3492 [2021-11-06 14:00:34,473 INFO L226 Difference]: Without dead ends: 3490 [2021-11-06 14:00:34,475 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:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2021-11-06 14:00:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3490. [2021-11-06 14:00:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3255 states have (on average 1.3671274961597542) internal successors, (4450), 3273 states have internal predecessors, (4450), 148 states have call successors, (148), 80 states have call predecessors, (148), 80 states have return successors, (296), 140 states have call predecessors, (296), 148 states have call successors, (296) [2021-11-06 14:00:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4894 transitions. [2021-11-06 14:00:34,560 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4894 transitions. Word has length 25 [2021-11-06 14:00:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:34,561 INFO L470 AbstractCegarLoop]: Abstraction has 3490 states and 4894 transitions. [2021-11-06 14:00:34,561 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:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4894 transitions. [2021-11-06 14:00:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 14:00:34,562 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:34,562 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:34,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 14:00:34,562 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -399291004, now seen corresponding path program 1 times [2021-11-06 14:00:34,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:34,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191826564] [2021-11-06 14:00:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:34,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:34,703 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:34,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:34,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191826564] [2021-11-06 14:00:34,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191826564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:34,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:34,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:34,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542822419] [2021-11-06 14:00:34,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:34,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:34,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:34,705 INFO L87 Difference]: Start difference. First operand 3490 states and 4894 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:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:34,763 INFO L93 Difference]: Finished difference Result 3490 states and 4894 transitions. [2021-11-06 14:00:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:34,763 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:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:34,774 INFO L225 Difference]: With dead ends: 3490 [2021-11-06 14:00:34,775 INFO L226 Difference]: Without dead ends: 3488 [2021-11-06 14:00:34,776 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:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2021-11-06 14:00:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3488. [2021-11-06 14:00:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 3254 states have (on average 1.3669330055316533) internal successors, (4448), 3271 states have internal predecessors, (4448), 148 states have call successors, (148), 80 states have call predecessors, (148), 80 states have return successors, (296), 140 states have call predecessors, (296), 148 states have call successors, (296) [2021-11-06 14:00:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4892 transitions. [2021-11-06 14:00:34,858 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4892 transitions. Word has length 26 [2021-11-06 14:00:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:34,858 INFO L470 AbstractCegarLoop]: Abstraction has 3488 states and 4892 transitions. [2021-11-06 14:00:34,858 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:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4892 transitions. [2021-11-06 14:00:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 14:00:34,859 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:34,859 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, 1] [2021-11-06 14:00:34,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 14:00:34,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash 506881064, now seen corresponding path program 1 times [2021-11-06 14:00:34,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:34,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422646148] [2021-11-06 14:00:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:34,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:35,025 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:35,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:35,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422646148] [2021-11-06 14:00:35,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422646148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:35,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:35,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:35,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623623904] [2021-11-06 14:00:35,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:35,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:35,027 INFO L87 Difference]: Start difference. First operand 3488 states and 4892 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:35,229 INFO L93 Difference]: Finished difference Result 10407 states and 15205 transitions. [2021-11-06 14:00:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-06 14:00:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:35,259 INFO L225 Difference]: With dead ends: 10407 [2021-11-06 14:00:35,260 INFO L226 Difference]: Without dead ends: 6929 [2021-11-06 14:00:35,278 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:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2021-11-06 14:00:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6894. [2021-11-06 14:00:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6894 states, 6434 states have (on average 1.3683556108175319) internal successors, (8804), 6466 states have internal predecessors, (8804), 296 states have call successors, (296), 160 states have call predecessors, (296), 158 states have return successors, (880), 275 states have call predecessors, (880), 296 states have call successors, (880) [2021-11-06 14:00:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 9980 transitions. [2021-11-06 14:00:35,475 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 9980 transitions. Word has length 27 [2021-11-06 14:00:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:35,476 INFO L470 AbstractCegarLoop]: Abstraction has 6894 states and 9980 transitions. [2021-11-06 14:00:35,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 9980 transitions. [2021-11-06 14:00:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 14:00:35,477 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:35,477 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, 1, 1] [2021-11-06 14:00:35,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 14:00:35,477 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1466555890, now seen corresponding path program 1 times [2021-11-06 14:00:35,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:35,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508738565] [2021-11-06 14:00:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:35,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:35,580 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:35,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:35,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508738565] [2021-11-06 14:00:35,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508738565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:35,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:35,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 14:00:35,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958715506] [2021-11-06 14:00:35,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:35,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:35,583 INFO L87 Difference]: Start difference. First operand 6894 states and 9980 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:35,715 INFO L93 Difference]: Finished difference Result 6894 states and 9980 transitions. [2021-11-06 14:00:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-11-06 14:00:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:35,742 INFO L225 Difference]: With dead ends: 6894 [2021-11-06 14:00:35,742 INFO L226 Difference]: Without dead ends: 6885 [2021-11-06 14:00:35,747 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:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2021-11-06 14:00:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 6885. [2021-11-06 14:00:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6885 states, 6426 states have (on average 1.3681917211328976) internal successors, (8792), 6457 states have internal predecessors, (8792), 296 states have call successors, (296), 160 states have call predecessors, (296), 158 states have return successors, (880), 275 states have call predecessors, (880), 296 states have call successors, (880) [2021-11-06 14:00:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6885 states to 6885 states and 9968 transitions. [2021-11-06 14:00:35,942 INFO L78 Accepts]: Start accepts. Automaton has 6885 states and 9968 transitions. Word has length 28 [2021-11-06 14:00:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:35,943 INFO L470 AbstractCegarLoop]: Abstraction has 6885 states and 9968 transitions. [2021-11-06 14:00:35,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6885 states and 9968 transitions. [2021-11-06 14:00:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 14:00:35,945 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:35,946 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, 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:35,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 14:00:35,946 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -656058121, now seen corresponding path program 1 times [2021-11-06 14:00:35,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:35,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968545323] [2021-11-06 14:00:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:35,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:36,058 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:36,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:36,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968545323] [2021-11-06 14:00:36,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968545323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:36,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:36,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:36,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910102326] [2021-11-06 14:00:36,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:36,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:36,060 INFO L87 Difference]: Start difference. First operand 6885 states and 9968 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:36,327 INFO L93 Difference]: Finished difference Result 13881 states and 20095 transitions. [2021-11-06 14:00:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:36,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 14:00:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:36,355 INFO L225 Difference]: With dead ends: 13881 [2021-11-06 14:00:36,356 INFO L226 Difference]: Without dead ends: 7006 [2021-11-06 14:00:36,387 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:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2021-11-06 14:00:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 6985. [2021-11-06 14:00:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6985 states, 6526 states have (on average 1.3691388292981919) internal successors, (8935), 6557 states have internal predecessors, (8935), 296 states have call successors, (296), 160 states have call predecessors, (296), 158 states have return successors, (880), 275 states have call predecessors, (880), 296 states have call successors, (880) [2021-11-06 14:00:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 10111 transitions. [2021-11-06 14:00:36,582 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 10111 transitions. Word has length 47 [2021-11-06 14:00:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:36,582 INFO L470 AbstractCegarLoop]: Abstraction has 6985 states and 10111 transitions. [2021-11-06 14:00:36,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 10111 transitions. [2021-11-06 14:00:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 14:00:36,587 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:36,587 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, 1] [2021-11-06 14:00:36,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 14:00:36,587 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash -91498608, now seen corresponding path program 1 times [2021-11-06 14:00:36,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:36,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775069385] [2021-11-06 14:00:36,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:36,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:36,755 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:36,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:36,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775069385] [2021-11-06 14:00:36,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775069385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:36,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:36,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 14:00:36,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666611162] [2021-11-06 14:00:36,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 14:00:36,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 14:00:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 14:00:36,758 INFO L87 Difference]: Start difference. First operand 6985 states and 10111 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:39,209 INFO L93 Difference]: Finished difference Result 20644 states and 29812 transitions. [2021-11-06 14:00:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 14:00:39,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 14:00:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:39,261 INFO L225 Difference]: With dead ends: 20644 [2021-11-06 14:00:39,261 INFO L226 Difference]: Without dead ends: 13669 [2021-11-06 14:00:39,292 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:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2021-11-06 14:00:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13635. [2021-11-06 14:00:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13635 states, 12762 states have (on average 1.3660868202476102) internal successors, (17434), 12821 states have internal predecessors, (17434), 552 states have call successors, (552), 320 states have call predecessors, (552), 316 states have return successors, (1640), 509 states have call predecessors, (1640), 552 states have call successors, (1640) [2021-11-06 14:00:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 19626 transitions. [2021-11-06 14:00:39,757 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 19626 transitions. Word has length 62 [2021-11-06 14:00:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:39,758 INFO L470 AbstractCegarLoop]: Abstraction has 13635 states and 19626 transitions. [2021-11-06 14:00:39,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 14:00:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 19626 transitions. [2021-11-06 14:00:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 14:00:39,762 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:39,762 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:39,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 14:00:39,762 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1369587478, now seen corresponding path program 1 times [2021-11-06 14:00:39,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:39,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418261337] [2021-11-06 14:00:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:39,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:00:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:00:39,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:39,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418261337] [2021-11-06 14:00:39,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418261337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:39,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:39,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 14:00:39,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264028914] [2021-11-06 14:00:39,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:00:39,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:39,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:00:39,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:00:39,938 INFO L87 Difference]: Start difference. First operand 13635 states and 19626 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:00:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:00:48,426 INFO L93 Difference]: Finished difference Result 38152 states and 54817 transitions. [2021-11-06 14:00:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:00:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-11-06 14:00:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:00:48,532 INFO L225 Difference]: With dead ends: 38152 [2021-11-06 14:00:48,533 INFO L226 Difference]: Without dead ends: 24527 [2021-11-06 14:00:48,577 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:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2021-11-06 14:00:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 22673. [2021-11-06 14:00:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22673 states, 21062 states have (on average 1.3512961732029247) internal successors, (28461), 21197 states have internal predecessors, (28461), 808 states have call successors, (808), 480 states have call predecessors, (808), 798 states have return successors, (3020), 1019 states have call predecessors, (3020), 808 states have call successors, (3020) [2021-11-06 14:00:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22673 states to 22673 states and 32289 transitions. [2021-11-06 14:00:49,552 INFO L78 Accepts]: Start accepts. Automaton has 22673 states and 32289 transitions. Word has length 80 [2021-11-06 14:00:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:00:49,552 INFO L470 AbstractCegarLoop]: Abstraction has 22673 states and 32289 transitions. [2021-11-06 14:00:49,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:00:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 22673 states and 32289 transitions. [2021-11-06 14:00:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 14:00:49,556 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:00:49,556 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:00:49,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 14:00:49,556 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:00:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:00:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash -930745385, now seen corresponding path program 1 times [2021-11-06 14:00:49,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:00:49,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251827565] [2021-11-06 14:00:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:00:49,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:00:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:00:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:00:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 14:00:49,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:00:49,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251827565] [2021-11-06 14:00:49,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251827565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:00:49,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:00:49,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 14:00:49,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141912746] [2021-11-06 14:00:49,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:00:49,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:00:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:00:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:00:49,845 INFO L87 Difference]: Start difference. First operand 22673 states and 32289 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:03,741 INFO L93 Difference]: Finished difference Result 42480 states and 63651 transitions. [2021-11-06 14:01:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 14:01:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-11-06 14:01:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:03,940 INFO L225 Difference]: With dead ends: 42480 [2021-11-06 14:01:03,940 INFO L226 Difference]: Without dead ends: 42474 [2021-11-06 14:01:03,974 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 14:01:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42474 states. [2021-11-06 14:01:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42474 to 39459. [2021-11-06 14:01:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39459 states, 36388 states have (on average 1.342612949323953) internal successors, (48855), 36559 states have internal predecessors, (48855), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1686 states have return successors, (8336), 2239 states have call predecessors, (8336), 1380 states have call successors, (8336) [2021-11-06 14:01:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39459 states to 39459 states and 58571 transitions. [2021-11-06 14:01:05,740 INFO L78 Accepts]: Start accepts. Automaton has 39459 states and 58571 transitions. Word has length 81 [2021-11-06 14:01:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:05,742 INFO L470 AbstractCegarLoop]: Abstraction has 39459 states and 58571 transitions. [2021-11-06 14:01:05,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39459 states and 58571 transitions. [2021-11-06 14:01:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 14:01:05,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:05,745 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:05,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 14:01:05,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 844261977, now seen corresponding path program 1 times [2021-11-06 14:01:05,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:05,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520525284] [2021-11-06 14:01:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:05,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:06,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:06,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520525284] [2021-11-06 14:01:06,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520525284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:06,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:06,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 14:01:06,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516077573] [2021-11-06 14:01:06,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:01:06,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:01:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:01:06,024 INFO L87 Difference]: Start difference. First operand 39459 states and 58571 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:16,919 INFO L93 Difference]: Finished difference Result 95811 states and 142692 transitions. [2021-11-06 14:01:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 14:01:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-11-06 14:01:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:17,184 INFO L225 Difference]: With dead ends: 95811 [2021-11-06 14:01:17,184 INFO L226 Difference]: Without dead ends: 56362 [2021-11-06 14:01:17,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:01:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56362 states. [2021-11-06 14:01:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56362 to 39555. [2021-11-06 14:01:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39555 states, 36448 states have (on average 1.3420489464442493) internal successors, (48915), 36643 states have internal predecessors, (48915), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1722 states have return successors, (8384), 2251 states have call predecessors, (8384), 1380 states have call successors, (8384) [2021-11-06 14:01:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39555 states to 39555 states and 58679 transitions. [2021-11-06 14:01:19,202 INFO L78 Accepts]: Start accepts. Automaton has 39555 states and 58679 transitions. Word has length 81 [2021-11-06 14:01:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:19,202 INFO L470 AbstractCegarLoop]: Abstraction has 39555 states and 58679 transitions. [2021-11-06 14:01:19,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39555 states and 58679 transitions. [2021-11-06 14:01:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 14:01:19,209 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:19,209 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:19,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 14:01:19,210 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1715261232, now seen corresponding path program 1 times [2021-11-06 14:01:19,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:19,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480410939] [2021-11-06 14:01:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:19,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:19,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:19,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480410939] [2021-11-06 14:01:19,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480410939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:19,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:19,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 14:01:19,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255619697] [2021-11-06 14:01:19,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:01:19,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:01:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:01:19,425 INFO L87 Difference]: Start difference. First operand 39555 states and 58679 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:30,270 INFO L93 Difference]: Finished difference Result 96039 states and 142956 transitions. [2021-11-06 14:01:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 14:01:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-11-06 14:01:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:30,628 INFO L225 Difference]: With dead ends: 96039 [2021-11-06 14:01:30,628 INFO L226 Difference]: Without dead ends: 56494 [2021-11-06 14:01:30,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:01:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56494 states. [2021-11-06 14:01:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56494 to 39555. [2021-11-06 14:01:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39555 states, 36448 states have (on average 1.3420489464442493) internal successors, (48915), 36643 states have internal predecessors, (48915), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1722 states have return successors, (8384), 2251 states have call predecessors, (8384), 1380 states have call successors, (8384) [2021-11-06 14:01:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39555 states to 39555 states and 58679 transitions. [2021-11-06 14:01:32,439 INFO L78 Accepts]: Start accepts. Automaton has 39555 states and 58679 transitions. Word has length 85 [2021-11-06 14:01:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:32,440 INFO L470 AbstractCegarLoop]: Abstraction has 39555 states and 58679 transitions. [2021-11-06 14:01:32,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 39555 states and 58679 transitions. [2021-11-06 14:01:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 14:01:32,442 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:32,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:32,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 14:01:32,443 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -267654302, now seen corresponding path program 1 times [2021-11-06 14:01:32,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:32,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736827902] [2021-11-06 14:01:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:32,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 14:01:32,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:32,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736827902] [2021-11-06 14:01:32,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736827902] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:01:32,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767288202] [2021-11-06 14:01:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:32,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:01:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:01:32,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:01:32,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 14:01:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:33,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 3412 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 14:01:33,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:01:33,885 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:33,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767288202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:33,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 14:01:33,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-11-06 14:01:33,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261541434] [2021-11-06 14:01:33,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:01:33,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:01:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:01:33,886 INFO L87 Difference]: Start difference. First operand 39555 states and 58679 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:38,392 INFO L93 Difference]: Finished difference Result 93131 states and 138100 transitions. [2021-11-06 14:01:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 14:01:38,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-11-06 14:01:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:38,712 INFO L225 Difference]: With dead ends: 93131 [2021-11-06 14:01:38,713 INFO L226 Difference]: Without dead ends: 53586 [2021-11-06 14:01:38,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-06 14:01:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53586 states. [2021-11-06 14:01:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53586 to 39711. [2021-11-06 14:01:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39711 states, 36598 states have (on average 1.3406470298923439) internal successors, (49065), 36799 states have internal predecessors, (49065), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:01:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39711 states to 39711 states and 58853 transitions. [2021-11-06 14:01:40,620 INFO L78 Accepts]: Start accepts. Automaton has 39711 states and 58853 transitions. Word has length 91 [2021-11-06 14:01:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:40,621 INFO L470 AbstractCegarLoop]: Abstraction has 39711 states and 58853 transitions. [2021-11-06 14:01:40,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39711 states and 58853 transitions. [2021-11-06 14:01:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 14:01:40,622 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:40,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:40,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 14:01:40,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-06 14:01:40,823 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash 433410276, now seen corresponding path program 1 times [2021-11-06 14:01:40,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:40,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536713534] [2021-11-06 14:01:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:40,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:41,146 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:41,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:41,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536713534] [2021-11-06 14:01:41,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536713534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:41,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:41,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 14:01:41,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403595900] [2021-11-06 14:01:41,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 14:01:41,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 14:01:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:01:41,149 INFO L87 Difference]: Start difference. First operand 39711 states and 58853 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:47,442 INFO L93 Difference]: Finished difference Result 87407 states and 139356 transitions. [2021-11-06 14:01:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:01:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-11-06 14:01:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:47,653 INFO L225 Difference]: With dead ends: 87407 [2021-11-06 14:01:47,653 INFO L226 Difference]: Without dead ends: 47634 [2021-11-06 14:01:47,824 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:01:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2021-11-06 14:01:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 39711. [2021-11-06 14:01:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39711 states, 36598 states have (on average 1.3396633695830373) internal successors, (49029), 36799 states have internal predecessors, (49029), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:01:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39711 states to 39711 states and 58817 transitions. [2021-11-06 14:01:49,684 INFO L78 Accepts]: Start accepts. Automaton has 39711 states and 58817 transitions. Word has length 91 [2021-11-06 14:01:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:49,684 INFO L470 AbstractCegarLoop]: Abstraction has 39711 states and 58817 transitions. [2021-11-06 14:01:49,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 39711 states and 58817 transitions. [2021-11-06 14:01:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 14:01:49,688 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:49,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 14:01:49,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 14:01:49,688 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash -111315136, now seen corresponding path program 1 times [2021-11-06 14:01:49,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:49,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902826628] [2021-11-06 14:01:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:49,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:49,943 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:49,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:49,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902826628] [2021-11-06 14:01:49,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902826628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:49,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:49,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 14:01:49,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754210359] [2021-11-06 14:01:49,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 14:01:49,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 14:01:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:01:49,945 INFO L87 Difference]: Start difference. First operand 39711 states and 58817 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:01:56,391 INFO L93 Difference]: Finished difference Result 82292 states and 130116 transitions. [2021-11-06 14:01:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:01:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-11-06 14:01:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:01:56,562 INFO L225 Difference]: With dead ends: 82292 [2021-11-06 14:01:56,563 INFO L226 Difference]: Without dead ends: 42591 [2021-11-06 14:01:56,731 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:01:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42591 states. [2021-11-06 14:01:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42591 to 39783. [2021-11-06 14:01:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39783 states, 36670 states have (on average 1.3389964548677393) internal successors, (49101), 36871 states have internal predecessors, (49101), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:01:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39783 states to 39783 states and 58889 transitions. [2021-11-06 14:01:58,522 INFO L78 Accepts]: Start accepts. Automaton has 39783 states and 58889 transitions. Word has length 93 [2021-11-06 14:01:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:01:58,522 INFO L470 AbstractCegarLoop]: Abstraction has 39783 states and 58889 transitions. [2021-11-06 14:01:58,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:01:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 39783 states and 58889 transitions. [2021-11-06 14:01:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-06 14:01:58,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:01:58,524 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, 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:58,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 14:01:58,524 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:01:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:01:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1669527108, now seen corresponding path program 1 times [2021-11-06 14:01:58,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:01:58,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589201231] [2021-11-06 14:01:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:01:58,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:01:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:01:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:01:58,890 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:58,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:01:58,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589201231] [2021-11-06 14:01:58,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589201231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:01:58,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:01:58,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 14:01:58,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508477706] [2021-11-06 14:01:58,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 14:01:58,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:01:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 14:01:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 14:01:58,892 INFO L87 Difference]: Start difference. First operand 39783 states and 58889 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:02:07,623 INFO L93 Difference]: Finished difference Result 116225 states and 191988 transitions. [2021-11-06 14:02:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 14:02:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2021-11-06 14:02:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:02:08,006 INFO L225 Difference]: With dead ends: 116225 [2021-11-06 14:02:08,006 INFO L226 Difference]: Without dead ends: 76452 [2021-11-06 14:02:08,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-11-06 14:02:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76452 states. [2021-11-06 14:02:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76452 to 40305. [2021-11-06 14:02:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40305 states, 37192 states have (on average 1.3352064960206496) internal successors, (49659), 37393 states have internal predecessors, (49659), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:02:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40305 states to 40305 states and 59447 transitions. [2021-11-06 14:02:10,507 INFO L78 Accepts]: Start accepts. Automaton has 40305 states and 59447 transitions. Word has length 96 [2021-11-06 14:02:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:02:10,508 INFO L470 AbstractCegarLoop]: Abstraction has 40305 states and 59447 transitions. [2021-11-06 14:02:10,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 40305 states and 59447 transitions. [2021-11-06 14:02:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 14:02:10,509 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:02:10,509 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, 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:02:10,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 14:02:10,509 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:02:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:02:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -108519448, now seen corresponding path program 1 times [2021-11-06 14:02:10,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:02:10,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647530630] [2021-11-06 14:02:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:10,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:02:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:02:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:10,909 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:02:10,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:02:10,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647530630] [2021-11-06 14:02:10,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647530630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:02:10,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:02:10,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 14:02:10,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411365411] [2021-11-06 14:02:10,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 14:02:10,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:02:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 14:02:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 14:02:10,911 INFO L87 Difference]: Start difference. First operand 40305 states and 59447 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:02:18,920 INFO L93 Difference]: Finished difference Result 98519 states and 159096 transitions. [2021-11-06 14:02:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 14:02:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-11-06 14:02:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:02:19,158 INFO L225 Difference]: With dead ends: 98519 [2021-11-06 14:02:19,158 INFO L226 Difference]: Without dead ends: 58224 [2021-11-06 14:02:19,302 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-06 14:02:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58224 states. [2021-11-06 14:02:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58224 to 40305. [2021-11-06 14:02:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40305 states, 37192 states have (on average 1.3352064960206496) internal successors, (49659), 37393 states have internal predecessors, (49659), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:02:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40305 states to 40305 states and 59447 transitions. [2021-11-06 14:02:21,325 INFO L78 Accepts]: Start accepts. Automaton has 40305 states and 59447 transitions. Word has length 98 [2021-11-06 14:02:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:02:21,326 INFO L470 AbstractCegarLoop]: Abstraction has 40305 states and 59447 transitions. [2021-11-06 14:02:21,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 40305 states and 59447 transitions. [2021-11-06 14:02:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 14:02:21,327 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:02:21,327 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, 1, 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:02:21,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 14:02:21,327 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:02:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:02:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1129567428, now seen corresponding path program 1 times [2021-11-06 14:02:21,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:02:21,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047429859] [2021-11-06 14:02:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:21,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:02:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:02:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:21,588 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:02:21,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:02:21,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047429859] [2021-11-06 14:02:21,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047429859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:02:21,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:02:21,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 14:02:21,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640481078] [2021-11-06 14:02:21,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 14:02:21,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:02:21,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 14:02:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 14:02:21,591 INFO L87 Difference]: Start difference. First operand 40305 states and 59447 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:02:28,460 INFO L93 Difference]: Finished difference Result 88685 states and 140520 transitions. [2021-11-06 14:02:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:02:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2021-11-06 14:02:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:02:28,712 INFO L225 Difference]: With dead ends: 88685 [2021-11-06 14:02:28,712 INFO L226 Difference]: Without dead ends: 48390 [2021-11-06 14:02:28,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:02:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48390 states. [2021-11-06 14:02:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48390 to 40665. [2021-11-06 14:02:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40665 states, 37552 states have (on average 1.3342298679164892) internal successors, (50103), 37753 states have internal predecessors, (50103), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:02:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40665 states to 40665 states and 59891 transitions. [2021-11-06 14:02:31,156 INFO L78 Accepts]: Start accepts. Automaton has 40665 states and 59891 transitions. Word has length 100 [2021-11-06 14:02:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:02:31,157 INFO L470 AbstractCegarLoop]: Abstraction has 40665 states and 59891 transitions. [2021-11-06 14:02:31,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40665 states and 59891 transitions. [2021-11-06 14:02:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 14:02:31,158 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:02:31,158 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, 1, 1, 1, 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:02:31,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 14:02:31,159 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:02:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:02:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2139744504, now seen corresponding path program 1 times [2021-11-06 14:02:31,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:02:31,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534620778] [2021-11-06 14:02:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:31,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:02:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:02:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:31,418 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:02:31,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:02:31,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534620778] [2021-11-06 14:02:31,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534620778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:02:31,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:02:31,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 14:02:31,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961993272] [2021-11-06 14:02:31,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:02:31,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:02:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:02:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:02:31,420 INFO L87 Difference]: Start difference. First operand 40665 states and 59891 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:02:38,590 INFO L93 Difference]: Finished difference Result 88907 states and 140796 transitions. [2021-11-06 14:02:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 14:02:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2021-11-06 14:02:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:02:38,803 INFO L225 Difference]: With dead ends: 88907 [2021-11-06 14:02:38,803 INFO L226 Difference]: Without dead ends: 48252 [2021-11-06 14:02:38,989 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 14:02:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48252 states. [2021-11-06 14:02:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48252 to 40719. [2021-11-06 14:02:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40719 states, 37606 states have (on average 1.3332712864968357) internal successors, (50139), 37807 states have internal predecessors, (50139), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:02:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40719 states to 40719 states and 59927 transitions. [2021-11-06 14:02:41,224 INFO L78 Accepts]: Start accepts. Automaton has 40719 states and 59927 transitions. Word has length 102 [2021-11-06 14:02:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:02:41,224 INFO L470 AbstractCegarLoop]: Abstraction has 40719 states and 59927 transitions. [2021-11-06 14:02:41,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 40719 states and 59927 transitions. [2021-11-06 14:02:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-06 14:02:41,226 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:02:41,226 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, 1, 1, 1, 1, 1, 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:02:41,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 14:02:41,226 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:02:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:02:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 633856812, now seen corresponding path program 1 times [2021-11-06 14:02:41,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:02:41,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551741300] [2021-11-06 14:02:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:41,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:02:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-06 14:02:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:02:41,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:02:41,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551741300] [2021-11-06 14:02:41,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551741300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:02:41,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 14:02:41,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 14:02:41,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019692028] [2021-11-06 14:02:41,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:02:41,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:02:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:02:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:02:41,455 INFO L87 Difference]: Start difference. First operand 40719 states and 59927 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:02:47,647 INFO L93 Difference]: Finished difference Result 84166 states and 124351 transitions. [2021-11-06 14:02:47,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:02:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-11-06 14:02:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:02:47,839 INFO L225 Difference]: With dead ends: 84166 [2021-11-06 14:02:47,839 INFO L226 Difference]: Without dead ends: 43456 [2021-11-06 14:02:48,093 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 14:02:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43456 states. [2021-11-06 14:02:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43456 to 40720. [2021-11-06 14:02:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40720 states, 37607 states have (on average 1.3332624245486213) internal successors, (50140), 37808 states have internal predecessors, (50140), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:02:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40720 states to 40720 states and 59928 transitions. [2021-11-06 14:02:50,125 INFO L78 Accepts]: Start accepts. Automaton has 40720 states and 59928 transitions. Word has length 104 [2021-11-06 14:02:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:02:50,126 INFO L470 AbstractCegarLoop]: Abstraction has 40720 states and 59928 transitions. [2021-11-06 14:02:50,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:02:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 40720 states and 59928 transitions. [2021-11-06 14:02:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-06 14:02:50,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:02:50,128 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, 1, 1, 1, 1, 1, 1, 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:02:50,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 14:02:50,128 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:02:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:02:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -977162503, now seen corresponding path program 1 times [2021-11-06 14:02:50,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:02:50,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202599617] [2021-11-06 14:02:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:50,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:02:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-06 14:02:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:02:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:02:50,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:02:50,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202599617] [2021-11-06 14:02:50,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202599617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:02:50,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136966857] [2021-11-06 14:02:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:02:50,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:02:50,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:02:50,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:02:50,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 14:03:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:03:16,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 3522 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 14:03:16,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:03:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:03:17,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136966857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:03:17,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 14:03:17,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-11-06 14:03:17,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512220284] [2021-11-06 14:03:17,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:03:17,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:03:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:03:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:03:17,080 INFO L87 Difference]: Start difference. First operand 40720 states and 59928 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-06 14:03:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:03:23,734 INFO L93 Difference]: Finished difference Result 84167 states and 124352 transitions. [2021-11-06 14:03:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 14:03:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2021-11-06 14:03:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:03:23,919 INFO L225 Difference]: With dead ends: 84167 [2021-11-06 14:03:23,919 INFO L226 Difference]: Without dead ends: 43457 [2021-11-06 14:03:24,138 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:03:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43457 states. [2021-11-06 14:03:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43457 to 40721. [2021-11-06 14:03:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40721 states, 37608 states have (on average 1.3332535630716869) internal successors, (50141), 37809 states have internal predecessors, (50141), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:03:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40721 states to 40721 states and 59929 transitions. [2021-11-06 14:03:25,999 INFO L78 Accepts]: Start accepts. Automaton has 40721 states and 59929 transitions. Word has length 105 [2021-11-06 14:03:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:03:25,999 INFO L470 AbstractCegarLoop]: Abstraction has 40721 states and 59929 transitions. [2021-11-06 14:03:25,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-06 14:03:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40721 states and 59929 transitions. [2021-11-06 14:03:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-06 14:03:26,000 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:03:26,000 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:26,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 14:03:26,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-06 14:03:26,201 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:03:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:03:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 620846284, now seen corresponding path program 2 times [2021-11-06 14:03:26,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:03:26,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067026819] [2021-11-06 14:03:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:03:26,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:03:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:03:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-06 14:03:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:03:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:03:26,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:03:26,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067026819] [2021-11-06 14:03:26,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067026819] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:03:26,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815829261] [2021-11-06 14:03:26,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 14:03:26,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:03:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:03:26,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:03:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 14:04:37,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 14:04:37,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 14:04:38,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 3528 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 14:04:38,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:04:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:04:38,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815829261] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:04:38,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 14:04:38,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-11-06 14:04:38,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635283637] [2021-11-06 14:04:38,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 14:04:38,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:04:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 14:04:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-06 14:04:38,314 INFO L87 Difference]: Start difference. First operand 40721 states and 59929 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-06 14:04:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:04:44,665 INFO L93 Difference]: Finished difference Result 84168 states and 124353 transitions. [2021-11-06 14:04:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 14:04:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2021-11-06 14:04:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:04:44,866 INFO L225 Difference]: With dead ends: 84168 [2021-11-06 14:04:44,866 INFO L226 Difference]: Without dead ends: 43458 [2021-11-06 14:04:44,980 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-06 14:04:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43458 states. [2021-11-06 14:04:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43458 to 40722. [2021-11-06 14:04:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40722 states, 37609 states have (on average 1.3332447020659948) internal successors, (50142), 37810 states have internal predecessors, (50142), 1380 states have call successors, (1380), 720 states have call predecessors, (1380), 1728 states have return successors, (8408), 2251 states have call predecessors, (8408), 1380 states have call successors, (8408) [2021-11-06 14:04:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40722 states to 40722 states and 59930 transitions. [2021-11-06 14:04:47,042 INFO L78 Accepts]: Start accepts. Automaton has 40722 states and 59930 transitions. Word has length 106 [2021-11-06 14:04:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:04:47,043 INFO L470 AbstractCegarLoop]: Abstraction has 40722 states and 59930 transitions. [2021-11-06 14:04:47,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-06 14:04:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 40722 states and 59930 transitions. [2021-11-06 14:04:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-06 14:04:47,044 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:04:47,044 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 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:04:47,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 14:04:47,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:04:47,245 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:04:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:04:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1380488871, now seen corresponding path program 3 times [2021-11-06 14:04:47,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:04:47,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448763239] [2021-11-06 14:04:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:04:47,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:04:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:04:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-06 14:04:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:04:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 14:04:47,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:04:47,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448763239] [2021-11-06 14:04:47,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448763239] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:04:47,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052615703] [2021-11-06 14:04:47,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 14:04:47,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:04:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:04:47,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:04:47,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 14:06:16,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 14:06:16,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 14:06:16,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 3412 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-06 14:06:16,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:06:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 14:06:16,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052615703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:06:16,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 14:06:16,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-11-06 14:06:16,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883802878] [2021-11-06 14:06:16,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 14:06:16,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:06:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 14:06:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-06 14:06:16,947 INFO L87 Difference]: Start difference. First operand 40722 states and 59930 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:06:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:06:27,363 INFO L93 Difference]: Finished difference Result 101565 states and 166055 transitions. [2021-11-06 14:06:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 14:06:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-11-06 14:06:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:06:27,745 INFO L225 Difference]: With dead ends: 101565 [2021-11-06 14:06:27,746 INFO L226 Difference]: Without dead ends: 60853 [2021-11-06 14:06:27,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-11-06 14:06:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60853 states. [2021-11-06 14:06:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60853 to 59811. [2021-11-06 14:06:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59811 states, 55180 states have (on average 1.3323486770569046) internal successors, (73519), 55447 states have internal predecessors, (73519), 2034 states have call successors, (2034), 1080 states have call predecessors, (2034), 2592 states have return successors, (17682), 3373 states have call predecessors, (17682), 2034 states have call successors, (17682) [2021-11-06 14:06:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59811 states to 59811 states and 93235 transitions. [2021-11-06 14:06:31,411 INFO L78 Accepts]: Start accepts. Automaton has 59811 states and 93235 transitions. Word has length 107 [2021-11-06 14:06:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 14:06:31,412 INFO L470 AbstractCegarLoop]: Abstraction has 59811 states and 93235 transitions. [2021-11-06 14:06:31,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:06:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59811 states and 93235 transitions. [2021-11-06 14:06:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-06 14:06:31,417 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 14:06:31,417 INFO L513 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:31,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 14:06:31,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:06:31,631 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [usbtouch_openErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-06 14:06:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 14:06:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 512777161, now seen corresponding path program 1 times [2021-11-06 14:06:31,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 14:06:31,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46939964] [2021-11-06 14:06:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:06:31,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 14:06:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:06:31,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-06 14:06:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:06:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 14:06:31,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 14:06:31,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46939964] [2021-11-06 14:06:31,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46939964] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 14:06:31,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791205116] [2021-11-06 14:06:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 14:06:31,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 14:06:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 14:06:31,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 14:06:31,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 14:06:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 14:06:32,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 3832 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 14:06:32,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 14:06:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-06 14:06:33,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791205116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 14:06:33,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 14:06:33,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-11-06 14:06:33,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732177235] [2021-11-06 14:06:33,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 14:06:33,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 14:06:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 14:06:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:06:33,138 INFO L87 Difference]: Start difference. First operand 59811 states and 93235 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 14:06:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 14:06:39,169 INFO L93 Difference]: Finished difference Result 79830 states and 124268 transitions. [2021-11-06 14:06:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 14:06:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-11-06 14:06:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 14:06:39,476 INFO L225 Difference]: With dead ends: 79830 [2021-11-06 14:06:39,476 INFO L226 Difference]: Without dead ends: 79814 [2021-11-06 14:06:39,515 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 14:06:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79814 states.