./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer --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 15a252f1c7ca431b6a743c06b5657c2785328dc7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer --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 15a252f1c7ca431b6a743c06b5657c2785328dc7 ................................................................................................................................................................... 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-cad4683 [2019-11-16 00:05:28,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:05:28,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:05:28,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:05:28,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:05:28,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:05:28,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:05:28,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:05:28,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:05:28,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:05:28,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:05:28,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:05:28,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:05:28,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:05:28,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:05:28,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:05:28,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:05:28,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:05:28,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:05:28,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:05:28,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:05:28,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:05:28,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:05:28,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:05:28,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:05:28,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:05:28,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:05:28,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:05:28,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:05:28,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:05:28,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:05:28,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:05:28,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:05:28,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:05:28,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:05:28,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:05:28,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:05:28,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:05:28,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:05:28,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:05:28,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:05:28,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-16 00:05:28,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:05:28,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:05:28,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:05:28,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:05:28,222 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:05:28,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:05:28,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:05:28,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:05:28,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:05:28,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:05:28,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:05:28,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:05:28,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:05:28,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:05:28,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:05:28,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:05:28,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:05:28,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:05:28,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:05:28,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:05:28,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:05:28,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:05:28,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:05:28,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:05:28,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:05:28,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:05:28,228 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer 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 -> 15a252f1c7ca431b6a743c06b5657c2785328dc7 [2019-11-16 00:05:28,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:05:28,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:05:28,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:05:28,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:05:28,283 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:05:28,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-16 00:05:28,350 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/70e1b9b3e/0d2845c94103441c89aafda7bea858a0/FLAGc9e1ef092 [2019-11-16 00:05:29,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:05:29,117 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-16 00:05:29,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/70e1b9b3e/0d2845c94103441c89aafda7bea858a0/FLAGc9e1ef092 [2019-11-16 00:05:29,359 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/70e1b9b3e/0d2845c94103441c89aafda7bea858a0 [2019-11-16 00:05:29,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:05:29,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:05:29,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:29,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:05:29,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:05:29,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:29" (1/1) ... [2019-11-16 00:05:29,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9f650a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:29, skipping insertion in model container [2019-11-16 00:05:29,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:29" (1/1) ... [2019-11-16 00:05:29,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:05:29,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:05:30,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:30,946 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:05:31,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:31,732 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:05:31,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31 WrapperNode [2019-11-16 00:05:31,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:31,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:31,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:05:31,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:05:31,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:31,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:31,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:31,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:05:31,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:05:31,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:05:31,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:31,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:31,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:31,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:32,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:32,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:32,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... [2019-11-16 00:05:32,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:05:32,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:05:32,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:05:32,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:05:32,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/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-11-16 00:05:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-16 00:05:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-16 00:05:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-16 00:05:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:05:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:05:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:05:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-16 00:05:32,178 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-16 00:05:32,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:05:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:05:32,739 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:05:32,845 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:05:37,502 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##511: assume false; [2019-11-16 00:05:37,502 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !false; [2019-11-16 00:05:37,502 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2019-11-16 00:05:37,503 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2019-11-16 00:05:37,504 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:05:37,504 INFO L284 CfgBuilder]: Removed 647 assume(true) statements. [2019-11-16 00:05:37,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:37 BoogieIcfgContainer [2019-11-16 00:05:37,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:05:37,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:05:37,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:05:37,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:05:37,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:05:29" (1/3) ... [2019-11-16 00:05:37,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19936815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:37, skipping insertion in model container [2019-11-16 00:05:37,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:31" (2/3) ... [2019-11-16 00:05:37,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19936815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:37, skipping insertion in model container [2019-11-16 00:05:37,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:37" (3/3) ... [2019-11-16 00:05:37,513 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-16 00:05:37,522 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:05:37,530 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-16 00:05:37,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-16 00:05:37,572 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:05:37,573 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:05:37,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:05:37,573 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:05:37,573 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:05:37,573 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:05:37,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:05:37,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:05:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-11-16 00:05:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:05:37,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:37,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:37,614 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1802577452, now seen corresponding path program 1 times [2019-11-16 00:05:37,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:37,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358841149] [2019-11-16 00:05:37,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:37,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:37,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:38,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358841149] [2019-11-16 00:05:38,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:38,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:38,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337206897] [2019-11-16 00:05:38,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:38,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:38,162 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 5 states. [2019-11-16 00:05:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:38,402 INFO L93 Difference]: Finished difference Result 2036 states and 2970 transitions. [2019-11-16 00:05:38,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:05:38,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:05:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:38,436 INFO L225 Difference]: With dead ends: 2036 [2019-11-16 00:05:38,436 INFO L226 Difference]: Without dead ends: 1326 [2019-11-16 00:05:38,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:05:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-16 00:05:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 666. [2019-11-16 00:05:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-16 00:05:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 838 transitions. [2019-11-16 00:05:38,568 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 838 transitions. Word has length 11 [2019-11-16 00:05:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:38,569 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 838 transitions. [2019-11-16 00:05:38,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 838 transitions. [2019-11-16 00:05:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:05:38,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:38,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:38,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1859835754, now seen corresponding path program 1 times [2019-11-16 00:05:38,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:38,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387410965] [2019-11-16 00:05:38,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:38,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:38,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:38,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387410965] [2019-11-16 00:05:38,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:38,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:05:38,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539114732] [2019-11-16 00:05:38,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:05:38,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:05:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:38,697 INFO L87 Difference]: Start difference. First operand 666 states and 838 transitions. Second operand 3 states. [2019-11-16 00:05:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:38,890 INFO L93 Difference]: Finished difference Result 1957 states and 2471 transitions. [2019-11-16 00:05:38,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:05:38,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-16 00:05:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:38,898 INFO L225 Difference]: With dead ends: 1957 [2019-11-16 00:05:38,898 INFO L226 Difference]: Without dead ends: 1303 [2019-11-16 00:05:38,900 INFO L600 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-11-16 00:05:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-11-16 00:05:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1279. [2019-11-16 00:05:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-11-16 00:05:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1622 transitions. [2019-11-16 00:05:38,962 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1622 transitions. Word has length 11 [2019-11-16 00:05:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:38,963 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1622 transitions. [2019-11-16 00:05:38,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:05:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1622 transitions. [2019-11-16 00:05:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:05:38,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:38,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:38,965 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1820334476, now seen corresponding path program 1 times [2019-11-16 00:05:38,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:38,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030569019] [2019-11-16 00:05:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:38,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:39,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030569019] [2019-11-16 00:05:39,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:39,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:05:39,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134021400] [2019-11-16 00:05:39,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:05:39,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:05:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:39,050 INFO L87 Difference]: Start difference. First operand 1279 states and 1622 transitions. Second operand 3 states. [2019-11-16 00:05:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:39,104 INFO L93 Difference]: Finished difference Result 1279 states and 1622 transitions. [2019-11-16 00:05:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:05:39,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-16 00:05:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:39,110 INFO L225 Difference]: With dead ends: 1279 [2019-11-16 00:05:39,111 INFO L226 Difference]: Without dead ends: 1274 [2019-11-16 00:05:39,111 INFO L600 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-11-16 00:05:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-16 00:05:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1271. [2019-11-16 00:05:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-11-16 00:05:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1609 transitions. [2019-11-16 00:05:39,175 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1609 transitions. Word has length 12 [2019-11-16 00:05:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:39,175 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 1609 transitions. [2019-11-16 00:05:39,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:05:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1609 transitions. [2019-11-16 00:05:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:05:39,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:39,177 INFO L380 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-11-16 00:05:39,178 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1108327780, now seen corresponding path program 1 times [2019-11-16 00:05:39,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:39,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277810374] [2019-11-16 00:05:39,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:39,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:39,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:39,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277810374] [2019-11-16 00:05:39,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:39,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:39,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468915278] [2019-11-16 00:05:39,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:05:39,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:39,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:05:39,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:39,286 INFO L87 Difference]: Start difference. First operand 1271 states and 1609 transitions. Second operand 3 states. [2019-11-16 00:05:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:39,413 INFO L93 Difference]: Finished difference Result 3095 states and 3962 transitions. [2019-11-16 00:05:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:05:39,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-16 00:05:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:39,516 INFO L225 Difference]: With dead ends: 3095 [2019-11-16 00:05:39,516 INFO L226 Difference]: Without dead ends: 1832 [2019-11-16 00:05:39,518 INFO L600 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-11-16 00:05:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-11-16 00:05:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1828. [2019-11-16 00:05:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-11-16 00:05:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2353 transitions. [2019-11-16 00:05:39,619 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2353 transitions. Word has length 34 [2019-11-16 00:05:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:39,620 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 2353 transitions. [2019-11-16 00:05:39,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:05:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2353 transitions. [2019-11-16 00:05:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:05:39,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:39,630 INFO L380 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-11-16 00:05:39,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 641619767, now seen corresponding path program 1 times [2019-11-16 00:05:39,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:39,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236525084] [2019-11-16 00:05:39,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:39,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:39,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:39,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236525084] [2019-11-16 00:05:39,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:39,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:05:39,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046326283] [2019-11-16 00:05:39,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:39,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:39,794 INFO L87 Difference]: Start difference. First operand 1828 states and 2353 transitions. Second operand 4 states. [2019-11-16 00:05:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:40,059 INFO L93 Difference]: Finished difference Result 3655 states and 4704 transitions. [2019-11-16 00:05:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:40,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:05:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:40,070 INFO L225 Difference]: With dead ends: 3655 [2019-11-16 00:05:40,070 INFO L226 Difference]: Without dead ends: 1830 [2019-11-16 00:05:40,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-11-16 00:05:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1826. [2019-11-16 00:05:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-16 00:05:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2347 transitions. [2019-11-16 00:05:40,179 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2347 transitions. Word has length 52 [2019-11-16 00:05:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:40,180 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2347 transitions. [2019-11-16 00:05:40,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2347 transitions. [2019-11-16 00:05:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:05:40,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:40,182 INFO L380 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-11-16 00:05:40,183 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash -970404317, now seen corresponding path program 1 times [2019-11-16 00:05:40,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:40,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42816550] [2019-11-16 00:05:40,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:40,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:40,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:40,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42816550] [2019-11-16 00:05:40,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:40,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:40,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209318971] [2019-11-16 00:05:40,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:40,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:40,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:40,387 INFO L87 Difference]: Start difference. First operand 1826 states and 2347 transitions. Second operand 5 states. [2019-11-16 00:05:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:46,759 INFO L93 Difference]: Finished difference Result 3562 states and 4587 transitions. [2019-11-16 00:05:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:05:46,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-16 00:05:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:46,787 INFO L225 Difference]: With dead ends: 3562 [2019-11-16 00:05:46,787 INFO L226 Difference]: Without dead ends: 3500 [2019-11-16 00:05:46,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:05:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2019-11-16 00:05:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 1826. [2019-11-16 00:05:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-16 00:05:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2345 transitions. [2019-11-16 00:05:47,035 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2345 transitions. Word has length 73 [2019-11-16 00:05:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:47,036 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2345 transitions. [2019-11-16 00:05:47,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2345 transitions. [2019-11-16 00:05:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:05:47,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:47,039 INFO L380 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-11-16 00:05:47,040 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1143498548, now seen corresponding path program 1 times [2019-11-16 00:05:47,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:47,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482809341] [2019-11-16 00:05:47,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:47,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:47,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:47,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482809341] [2019-11-16 00:05:47,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:47,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:47,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203525622] [2019-11-16 00:05:47,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:47,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:47,308 INFO L87 Difference]: Start difference. First operand 1826 states and 2345 transitions. Second operand 5 states. [2019-11-16 00:05:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:50,606 INFO L93 Difference]: Finished difference Result 4016 states and 5158 transitions. [2019-11-16 00:05:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:05:50,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-11-16 00:05:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:50,621 INFO L225 Difference]: With dead ends: 4016 [2019-11-16 00:05:50,621 INFO L226 Difference]: Without dead ends: 2155 [2019-11-16 00:05:50,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:05:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-11-16 00:05:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1225. [2019-11-16 00:05:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2019-11-16 00:05:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1581 transitions. [2019-11-16 00:05:50,699 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1581 transitions. Word has length 74 [2019-11-16 00:05:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:50,700 INFO L462 AbstractCegarLoop]: Abstraction has 1225 states and 1581 transitions. [2019-11-16 00:05:50,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1581 transitions. [2019-11-16 00:05:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:05:50,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:50,702 INFO L380 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-11-16 00:05:50,702 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 634025458, now seen corresponding path program 1 times [2019-11-16 00:05:50,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:50,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943753697] [2019-11-16 00:05:50,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:50,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:50,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:50,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943753697] [2019-11-16 00:05:50,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:50,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:50,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346275594] [2019-11-16 00:05:50,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:50,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:50,951 INFO L87 Difference]: Start difference. First operand 1225 states and 1581 transitions. Second operand 4 states. [2019-11-16 00:05:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:51,226 INFO L93 Difference]: Finished difference Result 2164 states and 2783 transitions. [2019-11-16 00:05:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:51,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:05:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:51,238 INFO L225 Difference]: With dead ends: 2164 [2019-11-16 00:05:51,238 INFO L226 Difference]: Without dead ends: 2140 [2019-11-16 00:05:51,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-16 00:05:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2110. [2019-11-16 00:05:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-11-16 00:05:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2730 transitions. [2019-11-16 00:05:51,356 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2730 transitions. Word has length 74 [2019-11-16 00:05:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:51,358 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 2730 transitions. [2019-11-16 00:05:51,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2730 transitions. [2019-11-16 00:05:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:05:51,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:51,361 INFO L380 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-11-16 00:05:51,361 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 380386471, now seen corresponding path program 1 times [2019-11-16 00:05:51,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:51,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147268957] [2019-11-16 00:05:51,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:51,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:51,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:51,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147268957] [2019-11-16 00:05:51,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:51,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:51,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273715882] [2019-11-16 00:05:51,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:51,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:51,651 INFO L87 Difference]: Start difference. First operand 2110 states and 2730 transitions. Second operand 5 states. [2019-11-16 00:05:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:57,059 INFO L93 Difference]: Finished difference Result 3847 states and 4977 transitions. [2019-11-16 00:05:57,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:05:57,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-16 00:05:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:57,079 INFO L225 Difference]: With dead ends: 3847 [2019-11-16 00:05:57,079 INFO L226 Difference]: Without dead ends: 3792 [2019-11-16 00:05:57,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:05:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-11-16 00:05:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 2115. [2019-11-16 00:05:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-11-16 00:05:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2734 transitions. [2019-11-16 00:05:57,216 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2734 transitions. Word has length 80 [2019-11-16 00:05:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:57,217 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 2734 transitions. [2019-11-16 00:05:57,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2734 transitions. [2019-11-16 00:05:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:05:57,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:57,219 INFO L380 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-11-16 00:05:57,219 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 563320383, now seen corresponding path program 1 times [2019-11-16 00:05:57,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:57,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730228503] [2019-11-16 00:05:57,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:57,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:57,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730228503] [2019-11-16 00:05:57,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:57,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:57,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456875005] [2019-11-16 00:05:57,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:57,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:57,411 INFO L87 Difference]: Start difference. First operand 2115 states and 2734 transitions. Second operand 5 states. [2019-11-16 00:06:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:00,748 INFO L93 Difference]: Finished difference Result 5767 states and 7436 transitions. [2019-11-16 00:06:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:00,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:06:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:00,770 INFO L225 Difference]: With dead ends: 5767 [2019-11-16 00:06:00,770 INFO L226 Difference]: Without dead ends: 3926 [2019-11-16 00:06:00,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2019-11-16 00:06:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 2130. [2019-11-16 00:06:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-16 00:06:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2750 transitions. [2019-11-16 00:06:00,922 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2750 transitions. Word has length 81 [2019-11-16 00:06:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:00,922 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 2750 transitions. [2019-11-16 00:06:00,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2750 transitions. [2019-11-16 00:06:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:06:00,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:00,924 INFO L380 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-11-16 00:06:00,925 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1949523777, now seen corresponding path program 1 times [2019-11-16 00:06:00,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:00,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537056207] [2019-11-16 00:06:00,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:00,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:00,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537056207] [2019-11-16 00:06:01,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:01,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:01,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142235898] [2019-11-16 00:06:01,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:01,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:01,162 INFO L87 Difference]: Start difference. First operand 2130 states and 2750 transitions. Second operand 5 states. [2019-11-16 00:06:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:01,654 INFO L93 Difference]: Finished difference Result 3469 states and 4468 transitions. [2019-11-16 00:06:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:01,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:06:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:01,668 INFO L225 Difference]: With dead ends: 3469 [2019-11-16 00:06:01,668 INFO L226 Difference]: Without dead ends: 3425 [2019-11-16 00:06:01,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-11-16 00:06:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2175. [2019-11-16 00:06:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2175 states. [2019-11-16 00:06:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 2802 transitions. [2019-11-16 00:06:01,815 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 2802 transitions. Word has length 81 [2019-11-16 00:06:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:01,815 INFO L462 AbstractCegarLoop]: Abstraction has 2175 states and 2802 transitions. [2019-11-16 00:06:01,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 2802 transitions. [2019-11-16 00:06:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:06:01,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:01,817 INFO L380 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-11-16 00:06:01,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 450073942, now seen corresponding path program 1 times [2019-11-16 00:06:01,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:01,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968568342] [2019-11-16 00:06:01,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:01,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:01,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968568342] [2019-11-16 00:06:01,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:01,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:01,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714929323] [2019-11-16 00:06:01,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:01,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:01,966 INFO L87 Difference]: Start difference. First operand 2175 states and 2802 transitions. Second operand 5 states. [2019-11-16 00:06:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:07,816 INFO L93 Difference]: Finished difference Result 3951 states and 5090 transitions. [2019-11-16 00:06:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:07,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-16 00:06:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:07,824 INFO L225 Difference]: With dead ends: 3951 [2019-11-16 00:06:07,825 INFO L226 Difference]: Without dead ends: 3890 [2019-11-16 00:06:07,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-11-16 00:06:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2186. [2019-11-16 00:06:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2019-11-16 00:06:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 2814 transitions. [2019-11-16 00:06:07,970 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 2814 transitions. Word has length 87 [2019-11-16 00:06:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:07,970 INFO L462 AbstractCegarLoop]: Abstraction has 2186 states and 2814 transitions. [2019-11-16 00:06:07,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2814 transitions. [2019-11-16 00:06:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:06:07,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:07,972 INFO L380 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-11-16 00:06:07,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1668913855, now seen corresponding path program 1 times [2019-11-16 00:06:07,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:07,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316621801] [2019-11-16 00:06:07,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:08,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316621801] [2019-11-16 00:06:08,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:08,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:08,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674891473] [2019-11-16 00:06:08,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:08,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:08,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:08,135 INFO L87 Difference]: Start difference. First operand 2186 states and 2814 transitions. Second operand 5 states. [2019-11-16 00:06:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:11,175 INFO L93 Difference]: Finished difference Result 5994 states and 7692 transitions. [2019-11-16 00:06:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:11,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-16 00:06:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:11,183 INFO L225 Difference]: With dead ends: 5994 [2019-11-16 00:06:11,183 INFO L226 Difference]: Without dead ends: 4087 [2019-11-16 00:06:11,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2019-11-16 00:06:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 2196. [2019-11-16 00:06:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-11-16 00:06:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2825 transitions. [2019-11-16 00:06:11,322 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2825 transitions. Word has length 88 [2019-11-16 00:06:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:11,323 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 2825 transitions. [2019-11-16 00:06:11,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2825 transitions. [2019-11-16 00:06:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:06:11,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:11,324 INFO L380 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-11-16 00:06:11,325 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1691546109, now seen corresponding path program 1 times [2019-11-16 00:06:11,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:11,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572164575] [2019-11-16 00:06:11,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:11,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:11,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:11,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572164575] [2019-11-16 00:06:11,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:11,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:11,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013948726] [2019-11-16 00:06:11,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:11,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:11,509 INFO L87 Difference]: Start difference. First operand 2196 states and 2825 transitions. Second operand 6 states. [2019-11-16 00:06:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:12,204 INFO L93 Difference]: Finished difference Result 4265 states and 5487 transitions. [2019-11-16 00:06:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:12,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-11-16 00:06:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:12,215 INFO L225 Difference]: With dead ends: 4265 [2019-11-16 00:06:12,216 INFO L226 Difference]: Without dead ends: 4175 [2019-11-16 00:06:12,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-11-16 00:06:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 2205. [2019-11-16 00:06:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-16 00:06:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2835 transitions. [2019-11-16 00:06:12,495 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2835 transitions. Word has length 88 [2019-11-16 00:06:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:12,495 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 2835 transitions. [2019-11-16 00:06:12,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2835 transitions. [2019-11-16 00:06:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:06:12,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:12,499 INFO L380 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-11-16 00:06:12,500 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash -780207748, now seen corresponding path program 1 times [2019-11-16 00:06:12,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:12,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517842063] [2019-11-16 00:06:12,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:12,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:12,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:12,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517842063] [2019-11-16 00:06:12,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:12,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:12,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243808841] [2019-11-16 00:06:12,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:12,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:12,666 INFO L87 Difference]: Start difference. First operand 2205 states and 2835 transitions. Second operand 3 states. [2019-11-16 00:06:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:13,003 INFO L93 Difference]: Finished difference Result 4059 states and 5214 transitions. [2019-11-16 00:06:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:13,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-16 00:06:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:13,009 INFO L225 Difference]: With dead ends: 4059 [2019-11-16 00:06:13,010 INFO L226 Difference]: Without dead ends: 2147 [2019-11-16 00:06:13,015 INFO L600 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-11-16 00:06:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-11-16 00:06:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2140. [2019-11-16 00:06:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-11-16 00:06:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2737 transitions. [2019-11-16 00:06:13,217 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2737 transitions. Word has length 93 [2019-11-16 00:06:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:13,217 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 2737 transitions. [2019-11-16 00:06:13,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2737 transitions. [2019-11-16 00:06:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:06:13,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:13,220 INFO L380 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-11-16 00:06:13,220 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1138102706, now seen corresponding path program 1 times [2019-11-16 00:06:13,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:13,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099782143] [2019-11-16 00:06:13,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:13,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:13,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:13,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099782143] [2019-11-16 00:06:13,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:13,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:13,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862064580] [2019-11-16 00:06:13,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:13,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:13,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:13,396 INFO L87 Difference]: Start difference. First operand 2140 states and 2737 transitions. Second operand 5 states. [2019-11-16 00:06:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,380 INFO L93 Difference]: Finished difference Result 2150 states and 2744 transitions. [2019-11-16 00:06:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:16,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:06:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,386 INFO L225 Difference]: With dead ends: 2150 [2019-11-16 00:06:16,387 INFO L226 Difference]: Without dead ends: 2116 [2019-11-16 00:06:16,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-11-16 00:06:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2112. [2019-11-16 00:06:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-11-16 00:06:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2707 transitions. [2019-11-16 00:06:16,551 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2707 transitions. Word has length 94 [2019-11-16 00:06:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:16,551 INFO L462 AbstractCegarLoop]: Abstraction has 2112 states and 2707 transitions. [2019-11-16 00:06:16,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2707 transitions. [2019-11-16 00:06:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:06:16,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:16,554 INFO L380 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-11-16 00:06:16,554 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2024173775, now seen corresponding path program 1 times [2019-11-16 00:06:16,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:16,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202912673] [2019-11-16 00:06:16,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:16,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:16,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202912673] [2019-11-16 00:06:16,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:16,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:16,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336201889] [2019-11-16 00:06:16,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:16,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:16,780 INFO L87 Difference]: Start difference. First operand 2112 states and 2707 transitions. Second operand 4 states. [2019-11-16 00:06:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,992 INFO L93 Difference]: Finished difference Result 2120 states and 2713 transitions. [2019-11-16 00:06:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:16,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-16 00:06:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,995 INFO L225 Difference]: With dead ends: 2120 [2019-11-16 00:06:16,995 INFO L226 Difference]: Without dead ends: 2116 [2019-11-16 00:06:16,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-11-16 00:06:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2112. [2019-11-16 00:06:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-11-16 00:06:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2705 transitions. [2019-11-16 00:06:17,239 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2705 transitions. Word has length 121 [2019-11-16 00:06:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:17,240 INFO L462 AbstractCegarLoop]: Abstraction has 2112 states and 2705 transitions. [2019-11-16 00:06:17,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2705 transitions. [2019-11-16 00:06:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:06:17,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:17,242 INFO L380 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-11-16 00:06:17,242 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532314, now seen corresponding path program 1 times [2019-11-16 00:06:17,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:17,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589681] [2019-11-16 00:06:17,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:17,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589681] [2019-11-16 00:06:17,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:17,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:17,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373156513] [2019-11-16 00:06:17,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:17,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:17,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:17,443 INFO L87 Difference]: Start difference. First operand 2112 states and 2705 transitions. Second operand 5 states. [2019-11-16 00:06:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:19,596 INFO L93 Difference]: Finished difference Result 3988 states and 5085 transitions. [2019-11-16 00:06:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:19,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-11-16 00:06:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:19,598 INFO L225 Difference]: With dead ends: 3988 [2019-11-16 00:06:19,598 INFO L226 Difference]: Without dead ends: 2164 [2019-11-16 00:06:19,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-16 00:06:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2117. [2019-11-16 00:06:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2019-11-16 00:06:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2711 transitions. [2019-11-16 00:06:19,703 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2711 transitions. Word has length 126 [2019-11-16 00:06:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:19,703 INFO L462 AbstractCegarLoop]: Abstraction has 2117 states and 2711 transitions. [2019-11-16 00:06:19,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2711 transitions. [2019-11-16 00:06:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:06:19,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:19,705 INFO L380 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-11-16 00:06:19,706 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1453260060, now seen corresponding path program 1 times [2019-11-16 00:06:19,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:19,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778380693] [2019-11-16 00:06:19,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:19,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:19,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:19,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778380693] [2019-11-16 00:06:19,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:19,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:19,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791076697] [2019-11-16 00:06:19,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:19,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:19,872 INFO L87 Difference]: Start difference. First operand 2117 states and 2711 transitions. Second operand 3 states. [2019-11-16 00:06:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:20,146 INFO L93 Difference]: Finished difference Result 4000 states and 5105 transitions. [2019-11-16 00:06:20,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:20,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-16 00:06:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:20,149 INFO L225 Difference]: With dead ends: 4000 [2019-11-16 00:06:20,149 INFO L226 Difference]: Without dead ends: 2176 [2019-11-16 00:06:20,152 INFO L600 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-11-16 00:06:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-11-16 00:06:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2087. [2019-11-16 00:06:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-16 00:06:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2651 transitions. [2019-11-16 00:06:20,312 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2651 transitions. Word has length 126 [2019-11-16 00:06:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:20,313 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 2651 transitions. [2019-11-16 00:06:20,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2651 transitions. [2019-11-16 00:06:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:06:20,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:20,316 INFO L380 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-11-16 00:06:20,316 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash 958456292, now seen corresponding path program 1 times [2019-11-16 00:06:20,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:20,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247929760] [2019-11-16 00:06:20,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:20,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247929760] [2019-11-16 00:06:20,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467716335] [2019-11-16 00:06:20,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:21,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 2149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:06:21,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:21,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:21,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-16 00:06:21,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624400570] [2019-11-16 00:06:21,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:21,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:21,372 INFO L87 Difference]: Start difference. First operand 2087 states and 2651 transitions. Second operand 4 states. [2019-11-16 00:06:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:21,610 INFO L93 Difference]: Finished difference Result 3885 states and 4919 transitions. [2019-11-16 00:06:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:21,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-11-16 00:06:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:21,619 INFO L225 Difference]: With dead ends: 3885 [2019-11-16 00:06:21,619 INFO L226 Difference]: Without dead ends: 2091 [2019-11-16 00:06:21,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-11-16 00:06:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2087. [2019-11-16 00:06:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-16 00:06:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2647 transitions. [2019-11-16 00:06:21,810 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2647 transitions. Word has length 126 [2019-11-16 00:06:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:21,810 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 2647 transitions. [2019-11-16 00:06:21,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2647 transitions. [2019-11-16 00:06:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:06:21,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:21,814 INFO L380 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-11-16 00:06:22,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:22,029 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 879370106, now seen corresponding path program 1 times [2019-11-16 00:06:22,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:22,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296380566] [2019-11-16 00:06:22,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:22,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296380566] [2019-11-16 00:06:22,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:22,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:22,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099959911] [2019-11-16 00:06:22,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:22,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:22,516 INFO L87 Difference]: Start difference. First operand 2087 states and 2647 transitions. Second operand 5 states. [2019-11-16 00:06:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:26,411 INFO L93 Difference]: Finished difference Result 3897 states and 4926 transitions. [2019-11-16 00:06:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:26,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-11-16 00:06:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:26,415 INFO L225 Difference]: With dead ends: 3897 [2019-11-16 00:06:26,416 INFO L226 Difference]: Without dead ends: 2103 [2019-11-16 00:06:26,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-11-16 00:06:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2093. [2019-11-16 00:06:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-16 00:06:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2653 transitions. [2019-11-16 00:06:26,590 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2653 transitions. Word has length 134 [2019-11-16 00:06:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2653 transitions. [2019-11-16 00:06:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2653 transitions. [2019-11-16 00:06:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:06:26,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:26,593 INFO L380 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-11-16 00:06:26,593 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1013383612, now seen corresponding path program 1 times [2019-11-16 00:06:26,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:26,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237693582] [2019-11-16 00:06:26,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:35,820 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:35,821 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:06:36,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:06:36 BoogieIcfgContainer [2019-11-16 00:06:36,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:06:36,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:36,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:36,307 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:36,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:37" (3/4) ... [2019-11-16 00:06:36,311 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:06:36,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:36,319 INFO L168 Benchmark]: Toolchain (without parser) took 66954.93 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,319 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:36,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2364.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 173.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,321 INFO L168 Benchmark]: Boogie Preprocessor took 197.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,322 INFO L168 Benchmark]: RCFGBuilder took 5399.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.5 MB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,323 INFO L168 Benchmark]: TraceAbstraction took 58799.82 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,325 INFO L168 Benchmark]: Witness Printer took 9.57 ms. Allocated memory is still 2.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:36,328 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2364.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 173.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 197.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5399.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.5 MB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58799.82 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 9.57 ms. Allocated memory is still 2.5 GB. Free memory is still 1.1 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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6309] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6315] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6332] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6338] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6355] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5137] urb->start_frame = -1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] EXPR catc->is_f5u011 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6601] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6616] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] catc->is_f5u011 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6935] __VERIFIER_error() VAL [__key___10={-36:0}, __key___11={-5:0}, __key___9={-4:0}, __this_module={4294967314:4294967374}, catc_driver={2:0}, catc_id_table={-16:0}, catc_netdev_ops={-35:0}, driver_name={-9:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-32: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. Result: UNSAFE, OverallTime: 58.7s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 40.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 23421 SDtfs, 20472 SDslu, 38029 SDs, 0 SdLazy, 5376 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s 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 DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 13782 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1926 NumberOfCodeBlocks, 1926 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1770 ConstructedInterpolants, 0 QuantifiedInterpolants, 494828 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2149 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 28/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:38,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:38,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:38,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:38,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:38,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:38,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:38,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:38,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:38,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:38,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:38,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:38,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:38,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:38,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:38,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:38,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:38,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:38,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:38,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:38,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:38,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:38,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:38,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:38,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:38,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:38,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:38,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:38,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:38,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:38,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:38,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:38,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:38,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:38,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:38,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:38,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:38,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:38,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:38,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:38,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:38,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-11-16 00:06:38,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:38,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:38,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:38,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:38,786 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:38,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:38,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:38,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:38,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:38,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:38,788 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:06:38,788 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:06:38,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:38,789 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:38,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:38,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:38,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:38,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:38,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:38,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:38,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:38,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:38,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:38,792 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:06:38,792 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:06:38,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:38,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:06:38,793 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-16 00:06:38,793 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer 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 -> 15a252f1c7ca431b6a743c06b5657c2785328dc7 [2019-11-16 00:06:38,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:38,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:38,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:38,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:38,858 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:38,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-16 00:06:38,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/58e598fab/46ce8cad459f4a3aa837ab78912e9deb/FLAGc6a80c200 [2019-11-16 00:06:39,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:39,659 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-16 00:06:39,717 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/58e598fab/46ce8cad459f4a3aa837ab78912e9deb/FLAGc6a80c200 [2019-11-16 00:06:39,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b25ab6c-7bcf-4925-b215-e8ef8813e383/bin/uautomizer/data/58e598fab/46ce8cad459f4a3aa837ab78912e9deb [2019-11-16 00:06:39,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:39,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:39,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:39,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:39,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:39,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:39" (1/1) ... [2019-11-16 00:06:39,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7cb114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:39, skipping insertion in model container [2019-11-16 00:06:39,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:39" (1/1) ... [2019-11-16 00:06:39,782 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:39,926 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:40,970 FATAL L? ?]: 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:1249) 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.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:172) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:641) 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:1269) 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:1213) 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:906) 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:906) 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:906) 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:1284) 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:3361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2176) 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:187) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:114) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) 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-11-16 00:06:40,977 INFO L168 Benchmark]: Toolchain (without parser) took 1220.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:40,978 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:40,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1209.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:40,981 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1209.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 51.5 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...