./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d1c5cab86bdad088c77b22873d9637b845147835 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d1c5cab86bdad088c77b22873d9637b845147835 .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: only flexible array member at the end can have non-constant size --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-15 10:39:19,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 10:39:19,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 10:39:19,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 10:39:19,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 10:39:19,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 10:39:19,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 10:39:19,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 10:39:19,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 10:39:19,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 10:39:19,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 10:39:19,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 10:39:19,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 10:39:19,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 10:39:19,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 10:39:19,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 10:39:19,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 10:39:19,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 10:39:19,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 10:39:19,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 10:39:19,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 10:39:19,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 10:39:19,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 10:39:19,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 10:39:19,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 10:39:19,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 10:39:19,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 10:39:19,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 10:39:19,806 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 10:39:19,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 10:39:19,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 10:39:19,808 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 10:39:19,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 10:39:19,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 10:39:19,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 10:39:19,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 10:39:19,811 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-15 10:39:19,826 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 10:39:19,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 10:39:19,828 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 10:39:19,828 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 10:39:19,828 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 10:39:19,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 10:39:19,829 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-15 10:39:19,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 10:39:19,830 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 10:39:19,830 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 10:39:19,830 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 10:39:19,830 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 10:39:19,830 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 10:39:19,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 10:39:19,831 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 10:39:19,831 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 10:39:19,831 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 10:39:19,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 10:39:19,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 10:39:19,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 10:39:19,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 10:39:19,833 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-15 10:39:19,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 10:39:19,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-15 10:39:19,834 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 10:39:19,834 INFO L133 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> d1c5cab86bdad088c77b22873d9637b845147835 [2019-01-15 10:39:19,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 10:39:19,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 10:39:19,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 10:39:19,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 10:39:19,889 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 10:39:19,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i [2019-01-15 10:39:19,945 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982498635/23326f870a5a459a92547f096d7dc1ad/FLAG4bfdd8695 [2019-01-15 10:39:20,669 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 10:39:20,670 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i [2019-01-15 10:39:20,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982498635/23326f870a5a459a92547f096d7dc1ad/FLAG4bfdd8695 [2019-01-15 10:39:21,206 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982498635/23326f870a5a459a92547f096d7dc1ad [2019-01-15 10:39:21,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 10:39:21,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 10:39:21,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 10:39:21,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 10:39:21,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 10:39:21,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:39:21" (1/1) ... [2019-01-15 10:39:21,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4680f5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:21, skipping insertion in model container [2019-01-15 10:39:21,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:39:21" (1/1) ... [2019-01-15 10:39:21,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 10:39:21,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 10:39:23,262 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 10:39:23,341 INFO L191 MainTranslator]: Completed pre-run [2019-01-15 10:39:23,592 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 10:39:24,263 INFO L195 MainTranslator]: Completed translation [2019-01-15 10:39:24,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24 WrapperNode [2019-01-15 10:39:24,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-15 10:39:24,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-15 10:39:24,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-15 10:39:24,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-15 10:39:24,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-15 10:39:24,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-15 10:39:24,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-15 10:39:24,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-15 10:39:24,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... [2019-01-15 10:39:24,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-15 10:39:24,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-15 10:39:24,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-15 10:39:24,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-15 10:39:24,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 10:39:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-15 10:39:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-15 10:39:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-15 10:39:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-15 10:39:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-15 10:39:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-15 10:39:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-15 10:39:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-15 10:39:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-15 10:39:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-15 10:39:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-15 10:39:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-15 10:39:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-01-15 10:39:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-15 10:39:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-15 10:39:25,556 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-15 10:39:25,609 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-15 10:39:32,014 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##511: assume false; [2019-01-15 10:39:32,015 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !false; [2019-01-15 10:39:32,015 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2019-01-15 10:39:32,015 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2019-01-15 10:39:32,016 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-15 10:39:32,017 INFO L286 CfgBuilder]: Removed 647 assue(true) statements. [2019-01-15 10:39:32,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:39:32 BoogieIcfgContainer [2019-01-15 10:39:32,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-15 10:39:32,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-15 10:39:32,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-15 10:39:32,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-15 10:39:32,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 10:39:21" (1/3) ... [2019-01-15 10:39:32,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4afbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 10:39:32, skipping insertion in model container [2019-01-15 10:39:32,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:39:24" (2/3) ... [2019-01-15 10:39:32,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4afbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 10:39:32, skipping insertion in model container [2019-01-15 10:39:32,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:39:32" (3/3) ... [2019-01-15 10:39:32,028 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i [2019-01-15 10:39:32,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-15 10:39:32,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-01-15 10:39:32,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-01-15 10:39:32,117 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-15 10:39:32,118 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-15 10:39:32,118 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-15 10:39:32,118 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-15 10:39:32,118 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-15 10:39:32,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-15 10:39:32,119 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-15 10:39:32,119 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-15 10:39:32,119 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-15 10:39:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-01-15 10:39:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-15 10:39:32,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:32,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:32,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:32,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1802577452, now seen corresponding path program 1 times [2019-01-15 10:39:32,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:32,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:39:32,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:39:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:39:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:32,917 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 5 states. [2019-01-15 10:39:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:33,266 INFO L93 Difference]: Finished difference Result 2036 states and 2970 transitions. [2019-01-15 10:39:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-15 10:39:33,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-15 10:39:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:33,309 INFO L225 Difference]: With dead ends: 2036 [2019-01-15 10:39:33,309 INFO L226 Difference]: Without dead ends: 1326 [2019-01-15 10:39:33,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:39:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-01-15 10:39:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 666. [2019-01-15 10:39:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-01-15 10:39:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 838 transitions. [2019-01-15 10:39:33,475 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 838 transitions. Word has length 11 [2019-01-15 10:39:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:33,475 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 838 transitions. [2019-01-15 10:39:33,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:39:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 838 transitions. [2019-01-15 10:39:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-15 10:39:33,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:33,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:33,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1859835754, now seen corresponding path program 1 times [2019-01-15 10:39:33,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:33,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:33,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:33,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 10:39:33,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:39:33,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:39:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:39:33,657 INFO L87 Difference]: Start difference. First operand 666 states and 838 transitions. Second operand 3 states. [2019-01-15 10:39:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:34,143 INFO L93 Difference]: Finished difference Result 1957 states and 2471 transitions. [2019-01-15 10:39:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:39:34,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-15 10:39:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:34,152 INFO L225 Difference]: With dead ends: 1957 [2019-01-15 10:39:34,152 INFO L226 Difference]: Without dead ends: 1303 [2019-01-15 10:39:34,155 INFO L631 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 [2019-01-15 10:39:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-01-15 10:39:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1279. [2019-01-15 10:39:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-15 10:39:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1622 transitions. [2019-01-15 10:39:34,250 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1622 transitions. Word has length 11 [2019-01-15 10:39:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:34,251 INFO L480 AbstractCegarLoop]: Abstraction has 1279 states and 1622 transitions. [2019-01-15 10:39:34,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:39:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1622 transitions. [2019-01-15 10:39:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-15 10:39:34,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:34,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:34,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1820334476, now seen corresponding path program 1 times [2019-01-15 10:39:34,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:34,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:34,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 10:39:34,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:39:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:39:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:39:34,421 INFO L87 Difference]: Start difference. First operand 1279 states and 1622 transitions. Second operand 3 states. [2019-01-15 10:39:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:34,522 INFO L93 Difference]: Finished difference Result 1279 states and 1622 transitions. [2019-01-15 10:39:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:39:34,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-15 10:39:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:34,532 INFO L225 Difference]: With dead ends: 1279 [2019-01-15 10:39:34,532 INFO L226 Difference]: Without dead ends: 1274 [2019-01-15 10:39:34,534 INFO L631 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 [2019-01-15 10:39:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-01-15 10:39:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1271. [2019-01-15 10:39:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-01-15 10:39:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1609 transitions. [2019-01-15 10:39:34,649 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1609 transitions. Word has length 12 [2019-01-15 10:39:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:34,650 INFO L480 AbstractCegarLoop]: Abstraction has 1271 states and 1609 transitions. [2019-01-15 10:39:34,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:39:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1609 transitions. [2019-01-15 10:39:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-15 10:39:34,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:34,654 INFO L402 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] [2019-01-15 10:39:34,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1108327780, now seen corresponding path program 1 times [2019-01-15 10:39:34,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:34,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:34,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:34,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:34,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:39:34,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:39:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:39:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:39:34,853 INFO L87 Difference]: Start difference. First operand 1271 states and 1609 transitions. Second operand 3 states. [2019-01-15 10:39:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:35,201 INFO L93 Difference]: Finished difference Result 3095 states and 3962 transitions. [2019-01-15 10:39:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:39:35,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-15 10:39:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:35,214 INFO L225 Difference]: With dead ends: 3095 [2019-01-15 10:39:35,214 INFO L226 Difference]: Without dead ends: 1832 [2019-01-15 10:39:35,217 INFO L631 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 [2019-01-15 10:39:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-01-15 10:39:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1828. [2019-01-15 10:39:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-01-15 10:39:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2353 transitions. [2019-01-15 10:39:35,376 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2353 transitions. Word has length 34 [2019-01-15 10:39:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:35,376 INFO L480 AbstractCegarLoop]: Abstraction has 1828 states and 2353 transitions. [2019-01-15 10:39:35,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:39:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2353 transitions. [2019-01-15 10:39:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-15 10:39:35,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:35,387 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:35,388 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash 641619767, now seen corresponding path program 1 times [2019-01-15 10:39:35,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:35,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:35,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:39:35,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:39:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:39:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:39:35,626 INFO L87 Difference]: Start difference. First operand 1828 states and 2353 transitions. Second operand 4 states. [2019-01-15 10:39:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:36,162 INFO L93 Difference]: Finished difference Result 3655 states and 4704 transitions. [2019-01-15 10:39:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:39:36,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-15 10:39:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:36,177 INFO L225 Difference]: With dead ends: 3655 [2019-01-15 10:39:36,177 INFO L226 Difference]: Without dead ends: 1830 [2019-01-15 10:39:36,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-01-15 10:39:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1826. [2019-01-15 10:39:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-01-15 10:39:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2347 transitions. [2019-01-15 10:39:36,527 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2347 transitions. Word has length 52 [2019-01-15 10:39:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:36,529 INFO L480 AbstractCegarLoop]: Abstraction has 1826 states and 2347 transitions. [2019-01-15 10:39:36,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:39:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2347 transitions. [2019-01-15 10:39:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-15 10:39:36,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:36,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:36,539 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -970404317, now seen corresponding path program 1 times [2019-01-15 10:39:36,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:37,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:39:37,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:39:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:39:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:37,100 INFO L87 Difference]: Start difference. First operand 1826 states and 2347 transitions. Second operand 5 states. [2019-01-15 10:39:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:44,301 INFO L93 Difference]: Finished difference Result 3562 states and 4587 transitions. [2019-01-15 10:39:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:39:44,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-15 10:39:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:44,323 INFO L225 Difference]: With dead ends: 3562 [2019-01-15 10:39:44,324 INFO L226 Difference]: Without dead ends: 3500 [2019-01-15 10:39:44,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:39:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2019-01-15 10:39:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 1826. [2019-01-15 10:39:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-01-15 10:39:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2345 transitions. [2019-01-15 10:39:44,510 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2345 transitions. Word has length 73 [2019-01-15 10:39:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:44,511 INFO L480 AbstractCegarLoop]: Abstraction has 1826 states and 2345 transitions. [2019-01-15 10:39:44,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:39:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2345 transitions. [2019-01-15 10:39:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-15 10:39:44,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:44,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:44,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1143498548, now seen corresponding path program 1 times [2019-01-15 10:39:44,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:44,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:45,113 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-15 10:39:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:39:45,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:39:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:39:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:45,474 INFO L87 Difference]: Start difference. First operand 1826 states and 2345 transitions. Second operand 5 states. [2019-01-15 10:39:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:48,553 INFO L93 Difference]: Finished difference Result 4016 states and 5158 transitions. [2019-01-15 10:39:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:39:48,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-15 10:39:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:48,563 INFO L225 Difference]: With dead ends: 4016 [2019-01-15 10:39:48,564 INFO L226 Difference]: Without dead ends: 2155 [2019-01-15 10:39:48,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-15 10:39:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-01-15 10:39:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1225. [2019-01-15 10:39:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2019-01-15 10:39:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1581 transitions. [2019-01-15 10:39:48,693 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1581 transitions. Word has length 74 [2019-01-15 10:39:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:48,694 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1581 transitions. [2019-01-15 10:39:48,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:39:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1581 transitions. [2019-01-15 10:39:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-15 10:39:48,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:48,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:48,696 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash 634025458, now seen corresponding path program 1 times [2019-01-15 10:39:48,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:49,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:49,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:39:49,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:39:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:39:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:39:49,049 INFO L87 Difference]: Start difference. First operand 1225 states and 1581 transitions. Second operand 4 states. [2019-01-15 10:39:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:49,503 INFO L93 Difference]: Finished difference Result 2164 states and 2783 transitions. [2019-01-15 10:39:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:39:49,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-01-15 10:39:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:49,513 INFO L225 Difference]: With dead ends: 2164 [2019-01-15 10:39:49,513 INFO L226 Difference]: Without dead ends: 2140 [2019-01-15 10:39:49,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:39:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-01-15 10:39:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2110. [2019-01-15 10:39:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-01-15 10:39:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2730 transitions. [2019-01-15 10:39:49,722 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2730 transitions. Word has length 74 [2019-01-15 10:39:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:49,722 INFO L480 AbstractCegarLoop]: Abstraction has 2110 states and 2730 transitions. [2019-01-15 10:39:49,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:39:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2730 transitions. [2019-01-15 10:39:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-15 10:39:49,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:49,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:49,726 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 380386471, now seen corresponding path program 1 times [2019-01-15 10:39:49,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:49,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:49,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:39:50,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:39:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:39:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:50,214 INFO L87 Difference]: Start difference. First operand 2110 states and 2730 transitions. Second operand 5 states. [2019-01-15 10:39:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:39:56,351 INFO L93 Difference]: Finished difference Result 3847 states and 4977 transitions. [2019-01-15 10:39:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:39:56,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-01-15 10:39:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:39:56,366 INFO L225 Difference]: With dead ends: 3847 [2019-01-15 10:39:56,366 INFO L226 Difference]: Without dead ends: 3792 [2019-01-15 10:39:56,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:39:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-01-15 10:39:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 2115. [2019-01-15 10:39:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-01-15 10:39:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2734 transitions. [2019-01-15 10:39:56,623 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2734 transitions. Word has length 80 [2019-01-15 10:39:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:39:56,624 INFO L480 AbstractCegarLoop]: Abstraction has 2115 states and 2734 transitions. [2019-01-15 10:39:56,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:39:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2734 transitions. [2019-01-15 10:39:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-15 10:39:56,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:39:56,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:39:56,627 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:39:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:39:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 563320383, now seen corresponding path program 1 times [2019-01-15 10:39:56,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:39:56,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:39:56,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:56,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:39:56,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:39:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:39:57,048 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-15 10:39:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:39:57,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:39:57,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:39:57,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:39:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:39:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:39:57,097 INFO L87 Difference]: Start difference. First operand 2115 states and 2734 transitions. Second operand 5 states. [2019-01-15 10:40:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:00,173 INFO L93 Difference]: Finished difference Result 5767 states and 7436 transitions. [2019-01-15 10:40:00,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:40:00,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-01-15 10:40:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:00,188 INFO L225 Difference]: With dead ends: 5767 [2019-01-15 10:40:00,188 INFO L226 Difference]: Without dead ends: 3926 [2019-01-15 10:40:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-15 10:40:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2019-01-15 10:40:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 2130. [2019-01-15 10:40:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-01-15 10:40:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2750 transitions. [2019-01-15 10:40:00,463 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2750 transitions. Word has length 81 [2019-01-15 10:40:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:00,463 INFO L480 AbstractCegarLoop]: Abstraction has 2130 states and 2750 transitions. [2019-01-15 10:40:00,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2750 transitions. [2019-01-15 10:40:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-15 10:40:00,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:00,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:00,467 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1949523777, now seen corresponding path program 1 times [2019-01-15 10:40:00,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:00,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:00,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:40:00,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:00,844 INFO L87 Difference]: Start difference. First operand 2130 states and 2750 transitions. Second operand 5 states. [2019-01-15 10:40:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:02,103 INFO L93 Difference]: Finished difference Result 3469 states and 4468 transitions. [2019-01-15 10:40:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:40:02,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-01-15 10:40:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:02,117 INFO L225 Difference]: With dead ends: 3469 [2019-01-15 10:40:02,118 INFO L226 Difference]: Without dead ends: 3425 [2019-01-15 10:40:02,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-01-15 10:40:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2175. [2019-01-15 10:40:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2175 states. [2019-01-15 10:40:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 2802 transitions. [2019-01-15 10:40:02,379 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 2802 transitions. Word has length 81 [2019-01-15 10:40:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:02,380 INFO L480 AbstractCegarLoop]: Abstraction has 2175 states and 2802 transitions. [2019-01-15 10:40:02,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 2802 transitions. [2019-01-15 10:40:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-15 10:40:02,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:02,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:02,382 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash 450073942, now seen corresponding path program 1 times [2019-01-15 10:40:02,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:02,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:02,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:02,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:02,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:02,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:02,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:02,835 INFO L87 Difference]: Start difference. First operand 2175 states and 2802 transitions. Second operand 5 states. [2019-01-15 10:40:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:08,506 INFO L93 Difference]: Finished difference Result 3951 states and 5090 transitions. [2019-01-15 10:40:08,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:40:08,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-01-15 10:40:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:08,516 INFO L225 Difference]: With dead ends: 3951 [2019-01-15 10:40:08,516 INFO L226 Difference]: Without dead ends: 3890 [2019-01-15 10:40:08,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:40:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-01-15 10:40:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2186. [2019-01-15 10:40:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2019-01-15 10:40:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 2814 transitions. [2019-01-15 10:40:08,782 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 2814 transitions. Word has length 87 [2019-01-15 10:40:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:08,783 INFO L480 AbstractCegarLoop]: Abstraction has 2186 states and 2814 transitions. [2019-01-15 10:40:08,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2814 transitions. [2019-01-15 10:40:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-15 10:40:08,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:08,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:08,785 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1668913855, now seen corresponding path program 1 times [2019-01-15 10:40:08,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:08,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:08,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:09,289 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-15 10:40:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:09,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:09,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:09,343 INFO L87 Difference]: Start difference. First operand 2186 states and 2814 transitions. Second operand 5 states. [2019-01-15 10:40:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:12,311 INFO L93 Difference]: Finished difference Result 5994 states and 7692 transitions. [2019-01-15 10:40:12,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-15 10:40:12,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-01-15 10:40:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:12,321 INFO L225 Difference]: With dead ends: 5994 [2019-01-15 10:40:12,321 INFO L226 Difference]: Without dead ends: 4087 [2019-01-15 10:40:12,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-15 10:40:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2019-01-15 10:40:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 2196. [2019-01-15 10:40:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-01-15 10:40:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2825 transitions. [2019-01-15 10:40:12,787 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2825 transitions. Word has length 88 [2019-01-15 10:40:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:12,788 INFO L480 AbstractCegarLoop]: Abstraction has 2196 states and 2825 transitions. [2019-01-15 10:40:12,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2825 transitions. [2019-01-15 10:40:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-15 10:40:12,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:12,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:12,791 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1691546109, now seen corresponding path program 1 times [2019-01-15 10:40:12,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:13,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:13,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:13,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-15 10:40:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-15 10:40:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-15 10:40:13,308 INFO L87 Difference]: Start difference. First operand 2196 states and 2825 transitions. Second operand 6 states. [2019-01-15 10:40:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:14,384 INFO L93 Difference]: Finished difference Result 4265 states and 5487 transitions. [2019-01-15 10:40:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-15 10:40:14,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-01-15 10:40:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:14,392 INFO L225 Difference]: With dead ends: 4265 [2019-01-15 10:40:14,392 INFO L226 Difference]: Without dead ends: 4175 [2019-01-15 10:40:14,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-15 10:40:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-01-15 10:40:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 2205. [2019-01-15 10:40:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-01-15 10:40:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2835 transitions. [2019-01-15 10:40:14,695 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2835 transitions. Word has length 88 [2019-01-15 10:40:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:14,695 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 2835 transitions. [2019-01-15 10:40:14,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-15 10:40:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2835 transitions. [2019-01-15 10:40:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-15 10:40:14,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:14,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:14,699 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash -780207748, now seen corresponding path program 1 times [2019-01-15 10:40:14,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:14,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:14,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:14,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:14,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:15,028 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-15 10:40:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:15,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:15,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:40:15,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:40:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:40:15,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:40:15,036 INFO L87 Difference]: Start difference. First operand 2205 states and 2835 transitions. Second operand 3 states. [2019-01-15 10:40:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:15,591 INFO L93 Difference]: Finished difference Result 4059 states and 5214 transitions. [2019-01-15 10:40:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:40:15,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-15 10:40:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:15,597 INFO L225 Difference]: With dead ends: 4059 [2019-01-15 10:40:15,598 INFO L226 Difference]: Without dead ends: 2147 [2019-01-15 10:40:15,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:40:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-01-15 10:40:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2140. [2019-01-15 10:40:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-01-15 10:40:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2737 transitions. [2019-01-15 10:40:16,008 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2737 transitions. Word has length 93 [2019-01-15 10:40:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 2737 transitions. [2019-01-15 10:40:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:40:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2737 transitions. [2019-01-15 10:40:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-15 10:40:16,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:16,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:16,011 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1138102706, now seen corresponding path program 1 times [2019-01-15 10:40:16,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:16,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:16,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:16,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:16,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:16,277 INFO L87 Difference]: Start difference. First operand 2140 states and 2737 transitions. Second operand 5 states. [2019-01-15 10:40:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:19,451 INFO L93 Difference]: Finished difference Result 2150 states and 2744 transitions. [2019-01-15 10:40:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:40:19,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-15 10:40:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:19,456 INFO L225 Difference]: With dead ends: 2150 [2019-01-15 10:40:19,456 INFO L226 Difference]: Without dead ends: 2116 [2019-01-15 10:40:19,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-15 10:40:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-01-15 10:40:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2112. [2019-01-15 10:40:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-01-15 10:40:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2707 transitions. [2019-01-15 10:40:19,789 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2707 transitions. Word has length 94 [2019-01-15 10:40:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:19,790 INFO L480 AbstractCegarLoop]: Abstraction has 2112 states and 2707 transitions. [2019-01-15 10:40:19,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2707 transitions. [2019-01-15 10:40:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-15 10:40:19,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:19,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:19,792 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2024173775, now seen corresponding path program 1 times [2019-01-15 10:40:19,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:19,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:19,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:19,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:20,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:20,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:40:20,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:40:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:40:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:40:20,172 INFO L87 Difference]: Start difference. First operand 2112 states and 2707 transitions. Second operand 4 states. [2019-01-15 10:40:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:20,843 INFO L93 Difference]: Finished difference Result 2120 states and 2713 transitions. [2019-01-15 10:40:20,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:40:20,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-01-15 10:40:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:20,848 INFO L225 Difference]: With dead ends: 2120 [2019-01-15 10:40:20,848 INFO L226 Difference]: Without dead ends: 2116 [2019-01-15 10:40:20,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-01-15 10:40:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2112. [2019-01-15 10:40:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-01-15 10:40:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2705 transitions. [2019-01-15 10:40:21,137 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2705 transitions. Word has length 121 [2019-01-15 10:40:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:21,137 INFO L480 AbstractCegarLoop]: Abstraction has 2112 states and 2705 transitions. [2019-01-15 10:40:21,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:40:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2705 transitions. [2019-01-15 10:40:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-15 10:40:21,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:21,139 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:21,139 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532314, now seen corresponding path program 1 times [2019-01-15 10:40:21,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:21,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:21,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:21,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:21,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:21,413 INFO L87 Difference]: Start difference. First operand 2112 states and 2705 transitions. Second operand 5 states. [2019-01-15 10:40:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:23,460 INFO L93 Difference]: Finished difference Result 3988 states and 5085 transitions. [2019-01-15 10:40:23,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:40:23,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-01-15 10:40:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:23,464 INFO L225 Difference]: With dead ends: 3988 [2019-01-15 10:40:23,465 INFO L226 Difference]: Without dead ends: 2164 [2019-01-15 10:40:23,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:40:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-01-15 10:40:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2117. [2019-01-15 10:40:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2019-01-15 10:40:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2711 transitions. [2019-01-15 10:40:23,745 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2711 transitions. Word has length 126 [2019-01-15 10:40:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:23,745 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 2711 transitions. [2019-01-15 10:40:23,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2711 transitions. [2019-01-15 10:40:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-15 10:40:23,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:23,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:23,747 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1453260060, now seen corresponding path program 1 times [2019-01-15 10:40:23,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:23,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:23,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:40:23,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:40:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:40:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:40:23,943 INFO L87 Difference]: Start difference. First operand 2117 states and 2711 transitions. Second operand 3 states. [2019-01-15 10:40:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:24,981 INFO L93 Difference]: Finished difference Result 4000 states and 5105 transitions. [2019-01-15 10:40:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:40:24,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-01-15 10:40:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:24,985 INFO L225 Difference]: With dead ends: 4000 [2019-01-15 10:40:24,985 INFO L226 Difference]: Without dead ends: 2176 [2019-01-15 10:40:24,988 INFO L631 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 [2019-01-15 10:40:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-01-15 10:40:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2087. [2019-01-15 10:40:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-01-15 10:40:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2651 transitions. [2019-01-15 10:40:25,261 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2651 transitions. Word has length 126 [2019-01-15 10:40:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:25,262 INFO L480 AbstractCegarLoop]: Abstraction has 2087 states and 2651 transitions. [2019-01-15 10:40:25,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:40:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2651 transitions. [2019-01-15 10:40:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-15 10:40:25,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:25,264 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:25,265 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 958456292, now seen corresponding path program 1 times [2019-01-15 10:40:25,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:25,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:25,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:25,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:25,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-15 10:40:25,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-15 10:40:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:26,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-15 10:40:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:26,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-15 10:40:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-15 10:40:26,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:26,361 INFO L87 Difference]: Start difference. First operand 2087 states and 2651 transitions. Second operand 5 states. [2019-01-15 10:40:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:27,310 INFO L93 Difference]: Finished difference Result 3885 states and 4919 transitions. [2019-01-15 10:40:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:40:27,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-01-15 10:40:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:27,325 INFO L225 Difference]: With dead ends: 3885 [2019-01-15 10:40:27,328 INFO L226 Difference]: Without dead ends: 2091 [2019-01-15 10:40:27,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-15 10:40:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2087. [2019-01-15 10:40:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-01-15 10:40:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2647 transitions. [2019-01-15 10:40:27,804 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2647 transitions. Word has length 126 [2019-01-15 10:40:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:27,804 INFO L480 AbstractCegarLoop]: Abstraction has 2087 states and 2647 transitions. [2019-01-15 10:40:27,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2647 transitions. [2019-01-15 10:40:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-15 10:40:27,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:27,809 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:27,809 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash 879370106, now seen corresponding path program 1 times [2019-01-15 10:40:27,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:40:28,607 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-15 10:40:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:40:28,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:40:28,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:40:28,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:40:28,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:40:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:40:28,656 INFO L87 Difference]: Start difference. First operand 2087 states and 2647 transitions. Second operand 5 states. [2019-01-15 10:40:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:40:32,833 INFO L93 Difference]: Finished difference Result 3897 states and 4926 transitions. [2019-01-15 10:40:32,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:40:32,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-01-15 10:40:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:40:32,838 INFO L225 Difference]: With dead ends: 3897 [2019-01-15 10:40:32,838 INFO L226 Difference]: Without dead ends: 2103 [2019-01-15 10:40:32,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-15 10:40:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-01-15 10:40:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2093. [2019-01-15 10:40:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-01-15 10:40:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2653 transitions. [2019-01-15 10:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2653 transitions. Word has length 134 [2019-01-15 10:40:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:40:33,216 INFO L480 AbstractCegarLoop]: Abstraction has 2093 states and 2653 transitions. [2019-01-15 10:40:33,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:40:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2653 transitions. [2019-01-15 10:40:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-15 10:40:33,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:40:33,219 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:40:33,219 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:40:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:40:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1013383612, now seen corresponding path program 1 times [2019-01-15 10:40:33,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:40:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:40:33,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:40:33,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:40:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-15 10:40:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-15 10:40:40,770 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-15 10:40:41,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 10:40:41 BoogieIcfgContainer [2019-01-15 10:40:41,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-15 10:40:41,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-15 10:40:41,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-15 10:40:41,245 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-15 10:40:41,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:39:32" (3/4) ... [2019-01-15 10:40:41,252 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-15 10:40:41,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-15 10:40:41,253 INFO L168 Benchmark]: Toolchain (without parser) took 80041.02 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 941.8 MB in the beginning and 1.2 GB in the end (delta: -255.9 MB). Peak memory consumption was 888.6 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,254 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 10:40:41,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3051.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 941.8 MB in the beginning and 894.2 MB in the end (delta: 47.6 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 366.88 ms. Allocated memory is still 1.2 GB. Free memory was 894.2 MB in the beginning and 865.8 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,258 INFO L168 Benchmark]: Boogie Preprocessor took 267.78 ms. Allocated memory is still 1.2 GB. Free memory was 865.8 MB in the beginning and 844.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,258 INFO L168 Benchmark]: RCFGBuilder took 7116.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 161.0 MB). Free memory was 844.4 MB in the beginning and 1.2 GB in the end (delta: -381.0 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,259 INFO L168 Benchmark]: TraceAbstraction took 69225.56 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 797.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-15 10:40:41,266 INFO L168 Benchmark]: Witness Printer took 7.32 ms. Allocated memory is still 2.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 10:40:41,273 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3051.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 941.8 MB in the beginning and 894.2 MB in the end (delta: 47.6 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 366.88 ms. Allocated memory is still 1.2 GB. Free memory was 894.2 MB in the beginning and 865.8 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 267.78 ms. Allocated memory is still 1.2 GB. Free memory was 865.8 MB in the beginning and 844.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7116.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 161.0 MB). Free memory was 844.4 MB in the beginning and 1.2 GB in the end (delta: -381.0 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69225.56 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 797.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 7.32 ms. Allocated memory is still 2.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6935]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 6624, overapproximation of bitwiseOr at line 5685, overapproximation of shiftLeft at line 5130, overapproximation of bitwiseAnd at line 4917. Possible FailurePath: [L5159-L5170] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5171-L5186] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5187-L5191] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5192-L5193] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6118-L6165] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6220-L6258] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6259] static struct lock_class_key __key___9 ; [L6260] static struct lock_class_key __key___10 ; [L6261] static struct lock_class_key __key___11 ; [L6673-L6681] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6684-L6699] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6752] int LDV_IN_INTERRUPT ; [L6753] static int res_catc_open_15 ; [L6754] static int res_catc_stop_16 ; [L6755] static int res_catc_probe_17 ; [L6948] int ldv_urb_state = 0; [L6949] int ldv_coherent_state = 0; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6757] struct net_device *var_group1 ; [L6758] struct ethtool_drvinfo *var_group2 ; [L6759] struct ethtool_cmd *var_group3 ; [L6760] struct sk_buff *var_group4 ; [L6761] struct usb_interface *var_group5 ; [L6762] struct usb_device_id const *var_catc_probe_17_p1 ; [L6763] unsigned long var_catc_stats_timer_10_p0 ; [L6764] int tmp___7 ; [L6765] int ldv_s_catc_netdev_ops_net_device_ops ; [L6766] int ldv_s_catc_driver_usb_driver ; [L6767] int tmp___8 ; [L6768] int tmp___9 ; [L6771] LDV_IN_INTERRUPT = 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6703] int result ; [L6704] int tmp___7 ; [L5077] int tmp___7 ; [L7194] return __VERIFIER_nondet_int(); [L5080] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5082] return (tmp___7); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6707] tmp___7 = usb_register(& catc_driver) [L6708] result = tmp___7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6710] COND TRUE result == 0 [L6716] return (result); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6773] tmp___7 = catc_init() [L6775] COND FALSE !(\read(tmp___7)) [L6779] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6780] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6785] tmp___9 = __VERIFIER_nondet_int() [L6787] COND TRUE \read(tmp___9) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___8 = __VERIFIER_nondet_int() [L6798] COND FALSE !(tmp___8 == 0) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6801] COND FALSE !(tmp___8 == 1) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6804] COND FALSE !(tmp___8 == 2) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] COND FALSE !(tmp___8 == 3) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6810] COND FALSE !(tmp___8 == 4) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6813] COND FALSE !(tmp___8 == 5) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6816] COND FALSE !(tmp___8 == 6) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6819] COND TRUE tmp___8 == 7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6884] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6263] struct usb_device *usbdev ; [L6264] struct usb_device *tmp___7 ; [L6265] struct net_device *netdev ; [L6266] struct catc *catc ; [L6267] u8 broadcast[6] ; [L6268] int i ; [L6269] int pktsz ; [L6270] int tmp___8 ; [L6271] void *tmp___9 ; [L6272] unsigned int tmp___10 ; [L6273] unsigned int tmp___11 ; [L6274] unsigned int tmp___12 ; [L6275] unsigned int tmp___13 ; [L6276] char const *tmp___14 ; [L6277] int tmp___15 ; [L5054] struct device const *__mptr ; [L5056] EXPR intf->dev.parent [L5056] __mptr = (struct device const *)intf->dev.parent [L5057] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6280] tmp___7 = interface_to_usbdev(intf) [L6281] usbdev = tmp___7 [L6282] EXPR intf->altsetting [L6282] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7198] return __VERIFIER_nondet_int(); [L6282-L6283] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6285] COND FALSE !(\read(tmp___8)) [L7213] return __VERIFIER_nondet_pointer(); [L7100] return (struct net_device *)external_alloc(); [L6293] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6295] COND FALSE !(! netdev) [L4917] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6300] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6301] catc = (struct catc *)tmp___9 [L6302] netdev->netdev_ops = & catc_netdev_ops [L6303] netdev->watchdog_timeo = 1250 [L6304] netdev->ethtool_ops = & ops [L6305] catc->usbdev = usbdev [L6306] catc->netdev = netdev VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6309] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6315] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6332] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6338] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6355] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] catc->timer.data = (unsigned long )((long )catc) [L6367] catc->timer.function = & catc_stats_timer [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7147] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6368] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7147] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6369] catc->tx_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7147] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6370] catc->rx_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7147] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6371] catc->irq_urb = usb_alloc_urb(0, 208U) [L6373] EXPR catc->ctrl_urb VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6373] COND FALSE !(! catc->ctrl_urb) [L6376] EXPR catc->tx_urb VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6376] COND FALSE !(! catc->tx_urb) [L6379] EXPR catc->rx_urb VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] COND FALSE !(! catc->rx_urb) [L6382] EXPR catc->irq_urb VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] COND FALSE !(! catc->irq_urb) [L6395] EXPR usbdev->descriptor.idVendor VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6395] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6418] pktsz = 23070 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6421] tmp___10 = __create_pipe(usbdev, 0U) [L6422] catc->ctrl_urb [L5092] urb->dev = dev [L5093] urb->pipe = pipe [L5094] urb->setup_packet = setup_packet [L5095] urb->transfer_buffer = transfer_buffer [L5096] urb->transfer_buffer_length = (u32 )buffer_length [L5097] urb->complete = complete_fn [L5098] urb->context = context VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6425] tmp___11 = __create_pipe(usbdev, 1U) [L6426] catc->tx_urb [L5108] urb->dev = dev [L5109] urb->pipe = pipe [L5110] urb->transfer_buffer = transfer_buffer [L5111] urb->transfer_buffer_length = (u32 )buffer_length [L5112] urb->complete = complete_fn [L5113] urb->context = context VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6428] tmp___12 = __create_pipe(usbdev, 1U) [L6429] catc->rx_urb [L5108] urb->dev = dev [L5109] urb->pipe = pipe [L5110] urb->transfer_buffer = transfer_buffer [L5111] urb->transfer_buffer_length = (u32 )buffer_length [L5112] urb->complete = complete_fn [L5113] urb->context = context VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6431] tmp___13 = __create_pipe(usbdev, 2U) [L6432] catc->irq_urb [L5123] urb->dev = dev [L5124] urb->pipe = pipe [L5125] urb->transfer_buffer = transfer_buffer [L5126] urb->transfer_buffer_length = (u32 )buffer_length [L5127] urb->complete = complete_fn [L5128] urb->context = context [L5129] EXPR dev->speed VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5129] COND TRUE (unsigned int )dev->speed == 3U [L5130] urb->interval = 1 << (interval - 1) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5137] urb->start_frame = -1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] EXPR catc->is_f5u011 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] COND FALSE !(! catc->is_f5u011) [L6588] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND FALSE !(\read(dir)) [L5680] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5680] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5681] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7184] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND FALSE !(retval < 0) [L5692] tmp___11 = 0 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6597] netdev->dev_addr [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND TRUE \read(dir) [L5675] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5675] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5676] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7184] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND TRUE retval < 0 [L5690] tmp___11 = retval VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6601] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6609] catc->rxmode[0] = (u8 )11 [L6610] catc->rxmode[1] = (u8 )0 [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND FALSE !(\read(dir)) [L5680] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5680] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5681] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7184] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND TRUE retval < 0 [L5690] tmp___11 = retval VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6616] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] catc->is_f5u011 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] COND TRUE catc->is_f5u011 [L6624] tmp___14 = "Belkin F5U011" VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6629] EXPR usbdev->bus [L6629] (usbdev->bus)->bus_name [L6630] netdev->dev_addr [L7123] return __VERIFIER_nondet_int(); [L6632] netdev->dev.parent = & intf->dev [L7173] return __VERIFIER_nondet_int(); [L6633] tmp___15 = register_netdev(netdev) [L6635] COND FALSE !(tmp___15 != 0) [L6647] return (0); [L6647] return (0); [L6647] return (0); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6886] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6889] COND FALSE !(\read(res_catc_probe_17)) [L6893] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6785] tmp___9 = __VERIFIER_nondet_int() [L6787] COND TRUE \read(tmp___9) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___8 = __VERIFIER_nondet_int() [L6798] COND FALSE !(tmp___8 == 0) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6801] COND FALSE !(tmp___8 == 1) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6804] COND TRUE tmp___8 == 2 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6841] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6167] struct catc *catc ; [L6168] void *tmp___7 ; [L6169] int status ; [L4917] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6172] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6173] catc = (struct catc *)tmp___7 [L6174] EXPR catc->irq_urb [L6174] EXPR catc->usbdev [L6174] (catc->irq_urb)->dev = catc->usbdev [L6175] EXPR catc->irq_urb [L7202] return __VERIFIER_nondet_int(); [L6175] status = usb_submit_urb(catc->irq_urb, 208U) [L6177] COND TRUE status < 0 [L6181] return (-1); VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6843] res_catc_open_15 = catc_open(var_group1) [L6846] COND TRUE res_catc_open_15 < 0 VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7070] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6935] __VERIFIER_error() VAL [__key___10={-51:0}, __key___11={-9:0}, __key___9={-17:0}, __this_module={4294967315:4294967375}, catc_driver={2:0}, catc_id_table={-3:0}, catc_netdev_ops={-6:0}, driver_name={-11:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-37:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 683 locations, 14 error locations. UNSAFE Result, 69.1s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 45.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23427 SDtfs, 20473 SDslu, 38451 SDs, 0 SdLazy, 5382 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 171 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 13782 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1926 NumberOfCodeBlocks, 1926 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1770 ConstructedInterpolants, 0 QuantifiedInterpolants, 495012 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2149 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 28/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-15 10:40:43,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 10:40:43,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 10:40:43,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 10:40:43,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 10:40:43,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 10:40:43,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 10:40:43,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 10:40:43,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 10:40:43,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 10:40:43,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 10:40:43,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 10:40:43,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 10:40:43,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 10:40:43,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 10:40:43,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 10:40:43,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 10:40:43,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 10:40:43,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 10:40:43,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 10:40:43,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 10:40:43,574 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 10:40:43,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 10:40:43,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 10:40:43,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 10:40:43,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 10:40:43,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 10:40:43,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 10:40:43,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 10:40:43,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 10:40:43,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 10:40:43,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 10:40:43,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 10:40:43,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 10:40:43,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 10:40:43,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 10:40:43,585 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-01-15 10:40:43,609 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 10:40:43,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 10:40:43,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 10:40:43,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 10:40:43,613 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 10:40:43,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 10:40:43,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-15 10:40:43,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 10:40:43,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 10:40:43,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 10:40:43,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 10:40:43,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 10:40:43,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 10:40:43,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 10:40:43,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 10:40:43,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 10:40:43,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 10:40:43,619 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-15 10:40:43,619 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 10:40:43,619 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-15 10:40:43,619 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-15 10:40:43,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 10:40:43,620 INFO L133 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> d1c5cab86bdad088c77b22873d9637b845147835 [2019-01-15 10:40:43,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 10:40:43,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 10:40:43,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 10:40:43,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 10:40:43,683 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 10:40:43,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i [2019-01-15 10:40:43,738 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c2c6c25/32ab0c014832402a9059a583e1ad745d/FLAG8d0caca30 [2019-01-15 10:40:44,526 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 10:40:44,526 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko_false-unreach-call.cil.out.i [2019-01-15 10:40:44,573 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c2c6c25/32ab0c014832402a9059a583e1ad745d/FLAG8d0caca30 [2019-01-15 10:40:44,997 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c2c6c25/32ab0c014832402a9059a583e1ad745d [2019-01-15 10:40:45,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 10:40:45,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 10:40:45,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 10:40:45,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 10:40:45,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 10:40:45,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:40:44" (1/1) ... [2019-01-15 10:40:45,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5310df89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:40:45, skipping insertion in model container [2019-01-15 10:40:45,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:40:44" (1/1) ... [2019-01-15 10:40:45,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 10:40:45,141 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 10:40:46,474 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError: only flexible array member at the end can have non-constant size at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeMemberOffset(TypeSizeAndOffsetComputer.java:583) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:304) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:203) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructOffsetForField(TypeSizeAndOffsetComputer.java:133) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructOffsetForField(TypeSizeAndOffsetComputer.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.StructHandler.handleFieldReference(StructHandler.java:144) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1308) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.dispatchDecaySwitchToRValueFunctionArgument(ExpressionResultTransformer.java:114) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:643) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1328) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:667) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1272) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:964) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:964) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:964) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1343) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3447) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:190) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-15 10:40:46,483 INFO L168 Benchmark]: Toolchain (without parser) took 1481.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:46,486 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 10:40:46,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1471.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2019-01-15 10:40:46,492 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1471.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: only flexible array member at the end can have non-constant size de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: only flexible array member at the end can have non-constant size: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeMemberOffset(TypeSizeAndOffsetComputer.java:583) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...