./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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 2519bb942ec97108414dce6daaf678954280b02e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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 2519bb942ec97108414dce6daaf678954280b02e ................................................................................................................................................................... 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-678e011 [2019-11-20 11:18:54,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:18:54,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:18:54,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:18:54,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:18:54,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:18:54,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:18:54,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:18:54,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:18:54,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:18:54,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:18:54,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:18:54,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:18:54,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:18:54,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:18:54,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:18:54,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:18:54,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:18:54,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:18:54,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:18:54,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:18:54,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:18:54,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:18:54,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:18:54,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:18:54,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:18:54,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:18:54,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:18:54,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:18:54,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:18:54,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:18:54,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:18:54,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:18:54,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:18:54,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:18:54,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:18:54,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:18:54,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:18:54,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:18:54,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:18:54,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:18:54,239 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-20 11:18:54,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:18:54,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:18:54,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:18:54,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:18:54,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:18:54,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:18:54,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:18:54,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:18:54,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:18:54,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:18:54,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:18:54,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:18:54,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:18:54,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:18:54,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:18:54,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:18:54,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:18:54,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:18:54,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:18:54,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:18:54,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:18:54,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:18:54,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:18:54,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:18:54,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:18:54,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:18:54,268 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_61039dad-1290-4b63-a4eb-54f69392385f/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 -> 2519bb942ec97108414dce6daaf678954280b02e [2019-11-20 11:18:54,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:18:54,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:18:54,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:18:54,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:18:54,469 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:18:54,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-20 11:18:54,531 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/49f5339bb/be73b04e33df4ef2a96890866d50c83a/FLAG62e34f789 [2019-11-20 11:18:55,229 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:18:55,229 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-20 11:18:55,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/49f5339bb/be73b04e33df4ef2a96890866d50c83a/FLAG62e34f789 [2019-11-20 11:18:55,354 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/49f5339bb/be73b04e33df4ef2a96890866d50c83a [2019-11-20 11:18:55,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:18:55,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:18:55,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:18:55,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:18:55,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:18:55,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:18:55" (1/1) ... [2019-11-20 11:18:55,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d2024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:55, skipping insertion in model container [2019-11-20 11:18:55,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:18:55" (1/1) ... [2019-11-20 11:18:55,376 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:18:55,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:18:56,864 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-20 11:18:56,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:18:56,953 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:18:57,147 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-20 11:18:57,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:18:57,595 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:18:57,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57 WrapperNode [2019-11-20 11:18:57,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:18:57,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:18:57,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:18:57,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:18:57,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:57,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:57,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:18:57,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:18:57,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:18:57,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:18:57,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:57,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:57,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:57,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:58,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:58,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:58,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... [2019-11-20 11:18:58,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:18:58,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:18:58,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:18:58,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:18:58,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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-20 11:18:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-20 11:18:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 11:18:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 11:18:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:18:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 11:18:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:18:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:18:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:18:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:18:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:18:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:18:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 11:18:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-20 11:18:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-20 11:18:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:18:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:18:58,926 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:18:58,981 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:19:03,937 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##511: assume false; [2019-11-20 11:19:03,937 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !false; [2019-11-20 11:19:03,937 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2019-11-20 11:19:03,937 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2019-11-20 11:19:03,938 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:19:03,939 INFO L285 CfgBuilder]: Removed 645 assume(true) statements. [2019-11-20 11:19:03,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:03 BoogieIcfgContainer [2019-11-20 11:19:03,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:19:03,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:19:03,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:19:03,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:19:03,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:18:55" (1/3) ... [2019-11-20 11:19:03,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58640f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:03, skipping insertion in model container [2019-11-20 11:19:03,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:18:57" (2/3) ... [2019-11-20 11:19:03,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58640f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:03, skipping insertion in model container [2019-11-20 11:19:03,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:03" (3/3) ... [2019-11-20 11:19:03,947 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-20 11:19:03,957 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:19:03,964 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-20 11:19:03,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-20 11:19:04,003 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:19:04,003 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:19:04,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:19:04,004 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:19:04,004 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:19:04,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:19:04,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:19:04,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:19:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states. [2019-11-20 11:19:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 11:19:04,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:04,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:04,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1802577388, now seen corresponding path program 1 times [2019-11-20 11:19:04,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:04,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313912083] [2019-11-20 11:19:04,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:04,582 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-20 11:19:04,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313912083] [2019-11-20 11:19:04,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:04,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:04,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902134453] [2019-11-20 11:19:04,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:04,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:04,606 INFO L87 Difference]: Start difference. First operand 682 states. Second operand 5 states. [2019-11-20 11:19:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:04,816 INFO L93 Difference]: Finished difference Result 2033 states and 2967 transitions. [2019-11-20 11:19:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:19:04,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-20 11:19:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:04,838 INFO L225 Difference]: With dead ends: 2033 [2019-11-20 11:19:04,839 INFO L226 Difference]: Without dead ends: 1324 [2019-11-20 11:19:04,845 INFO L630 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-20 11:19:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-11-20 11:19:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 665. [2019-11-20 11:19:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-20 11:19:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 837 transitions. [2019-11-20 11:19:04,934 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 837 transitions. Word has length 11 [2019-11-20 11:19:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:04,934 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 837 transitions. [2019-11-20 11:19:04,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 837 transitions. [2019-11-20 11:19:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 11:19:04,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:04,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:04,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1859835690, now seen corresponding path program 1 times [2019-11-20 11:19:04,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:04,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527981275] [2019-11-20 11:19:04,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:05,082 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-20 11:19:05,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527981275] [2019-11-20 11:19:05,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:05,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:19:05,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665093748] [2019-11-20 11:19:05,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:19:05,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:05,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:19:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:19:05,085 INFO L87 Difference]: Start difference. First operand 665 states and 837 transitions. Second operand 3 states. [2019-11-20 11:19:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:05,290 INFO L93 Difference]: Finished difference Result 1954 states and 2468 transitions. [2019-11-20 11:19:05,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:19:05,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 11:19:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:05,302 INFO L225 Difference]: With dead ends: 1954 [2019-11-20 11:19:05,302 INFO L226 Difference]: Without dead ends: 1301 [2019-11-20 11:19:05,304 INFO L630 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-20 11:19:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-11-20 11:19:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1277. [2019-11-20 11:19:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-11-20 11:19:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1620 transitions. [2019-11-20 11:19:05,379 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1620 transitions. Word has length 11 [2019-11-20 11:19:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:05,380 INFO L462 AbstractCegarLoop]: Abstraction has 1277 states and 1620 transitions. [2019-11-20 11:19:05,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:19:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1620 transitions. [2019-11-20 11:19:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 11:19:05,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:05,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:05,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1820332490, now seen corresponding path program 1 times [2019-11-20 11:19:05,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:05,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107911784] [2019-11-20 11:19:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:05,518 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-20 11:19:05,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107911784] [2019-11-20 11:19:05,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:05,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:19:05,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364826285] [2019-11-20 11:19:05,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:19:05,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:19:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:19:05,520 INFO L87 Difference]: Start difference. First operand 1277 states and 1620 transitions. Second operand 3 states. [2019-11-20 11:19:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:05,576 INFO L93 Difference]: Finished difference Result 1277 states and 1620 transitions. [2019-11-20 11:19:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:19:05,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 11:19:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:05,583 INFO L225 Difference]: With dead ends: 1277 [2019-11-20 11:19:05,583 INFO L226 Difference]: Without dead ends: 1272 [2019-11-20 11:19:05,584 INFO L630 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-20 11:19:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-20 11:19:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1269. [2019-11-20 11:19:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-11-20 11:19:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1607 transitions. [2019-11-20 11:19:05,647 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1607 transitions. Word has length 12 [2019-11-20 11:19:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:05,647 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 1607 transitions. [2019-11-20 11:19:05,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:19:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1607 transitions. [2019-11-20 11:19:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 11:19:05,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:05,651 INFO L410 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-20 11:19:05,651 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1162761244, now seen corresponding path program 1 times [2019-11-20 11:19:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:05,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995241596] [2019-11-20 11:19:05,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:05,792 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-20 11:19:05,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995241596] [2019-11-20 11:19:05,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:05,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:19:05,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43052274] [2019-11-20 11:19:05,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:19:05,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:19:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:19:05,794 INFO L87 Difference]: Start difference. First operand 1269 states and 1607 transitions. Second operand 3 states. [2019-11-20 11:19:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:05,912 INFO L93 Difference]: Finished difference Result 3091 states and 3958 transitions. [2019-11-20 11:19:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:19:05,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-20 11:19:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:05,922 INFO L225 Difference]: With dead ends: 3091 [2019-11-20 11:19:05,923 INFO L226 Difference]: Without dead ends: 1830 [2019-11-20 11:19:05,925 INFO L630 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-20 11:19:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-11-20 11:19:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1826. [2019-11-20 11:19:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-11-20 11:19:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2351 transitions. [2019-11-20 11:19:06,014 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2351 transitions. Word has length 34 [2019-11-20 11:19:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 2351 transitions. [2019-11-20 11:19:06,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:19:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2351 transitions. [2019-11-20 11:19:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 11:19:06,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:06,024 INFO L410 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-20 11:19:06,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 680230391, now seen corresponding path program 1 times [2019-11-20 11:19:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:06,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134501402] [2019-11-20 11:19:06,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:06,157 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-20 11:19:06,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134501402] [2019-11-20 11:19:06,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:06,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:19:06,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719363921] [2019-11-20 11:19:06,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:19:06,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:19:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:19:06,159 INFO L87 Difference]: Start difference. First operand 1826 states and 2351 transitions. Second operand 4 states. [2019-11-20 11:19:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:06,495 INFO L93 Difference]: Finished difference Result 3651 states and 4700 transitions. [2019-11-20 11:19:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:19:06,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 11:19:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:06,506 INFO L225 Difference]: With dead ends: 3651 [2019-11-20 11:19:06,506 INFO L226 Difference]: Without dead ends: 1828 [2019-11-20 11:19:06,509 INFO L630 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-20 11:19:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2019-11-20 11:19:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1824. [2019-11-20 11:19:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-11-20 11:19:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2345 transitions. [2019-11-20 11:19:06,597 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2345 transitions. Word has length 52 [2019-11-20 11:19:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:06,597 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 2345 transitions. [2019-11-20 11:19:06,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:19:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2345 transitions. [2019-11-20 11:19:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 11:19:06,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:06,599 INFO L410 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] [2019-11-20 11:19:06,600 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1158336911, now seen corresponding path program 1 times [2019-11-20 11:19:06,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:06,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635569208] [2019-11-20 11:19:06,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:06,770 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-20 11:19:06,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635569208] [2019-11-20 11:19:06,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:06,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:06,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172166664] [2019-11-20 11:19:06,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:06,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:06,773 INFO L87 Difference]: Start difference. First operand 1824 states and 2345 transitions. Second operand 5 states. [2019-11-20 11:19:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:13,900 INFO L93 Difference]: Finished difference Result 3558 states and 4583 transitions. [2019-11-20 11:19:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:13,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-20 11:19:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:13,928 INFO L225 Difference]: With dead ends: 3558 [2019-11-20 11:19:13,928 INFO L226 Difference]: Without dead ends: 3496 [2019-11-20 11:19:13,930 INFO L630 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-20 11:19:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2019-11-20 11:19:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 1824. [2019-11-20 11:19:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-11-20 11:19:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2343 transitions. [2019-11-20 11:19:14,033 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2343 transitions. Word has length 72 [2019-11-20 11:19:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:14,034 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 2343 transitions. [2019-11-20 11:19:14,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2343 transitions. [2019-11-20 11:19:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 11:19:14,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:14,036 INFO L410 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-20 11:19:14,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1585000122, now seen corresponding path program 1 times [2019-11-20 11:19:14,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:14,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587983197] [2019-11-20 11:19:14,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:14,304 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-20 11:19:14,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587983197] [2019-11-20 11:19:14,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:14,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:19:14,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980059003] [2019-11-20 11:19:14,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:19:14,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:19:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:19:14,310 INFO L87 Difference]: Start difference. First operand 1824 states and 2343 transitions. Second operand 4 states. [2019-11-20 11:19:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:14,820 INFO L93 Difference]: Finished difference Result 2767 states and 3538 transitions. [2019-11-20 11:19:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:19:14,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 11:19:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:14,837 INFO L225 Difference]: With dead ends: 2767 [2019-11-20 11:19:14,837 INFO L226 Difference]: Without dead ends: 2743 [2019-11-20 11:19:14,839 INFO L630 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-20 11:19:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2019-11-20 11:19:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2708. [2019-11-20 11:19:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-11-20 11:19:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3492 transitions. [2019-11-20 11:19:14,970 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3492 transitions. Word has length 73 [2019-11-20 11:19:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:14,970 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 3492 transitions. [2019-11-20 11:19:14,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:19:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3492 transitions. [2019-11-20 11:19:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 11:19:14,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:14,972 INFO L410 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-20 11:19:14,972 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash -563931768, now seen corresponding path program 1 times [2019-11-20 11:19:14,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:14,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081761941] [2019-11-20 11:19:14,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:15,200 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-20 11:19:15,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081761941] [2019-11-20 11:19:15,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:15,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:15,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112740014] [2019-11-20 11:19:15,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:15,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:15,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:15,206 INFO L87 Difference]: Start difference. First operand 2708 states and 3492 transitions. Second operand 5 states. [2019-11-20 11:19:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:17,895 INFO L93 Difference]: Finished difference Result 6666 states and 8602 transitions. [2019-11-20 11:19:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:17,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-20 11:19:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:17,917 INFO L225 Difference]: With dead ends: 6666 [2019-11-20 11:19:17,917 INFO L226 Difference]: Without dead ends: 3899 [2019-11-20 11:19:17,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:19:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-11-20 11:19:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 2107. [2019-11-20 11:19:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-20 11:19:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2727 transitions. [2019-11-20 11:19:18,047 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2727 transitions. Word has length 73 [2019-11-20 11:19:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 2727 transitions. [2019-11-20 11:19:18,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2727 transitions. [2019-11-20 11:19:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 11:19:18,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:18,049 INFO L410 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] [2019-11-20 11:19:18,049 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2126282873, now seen corresponding path program 1 times [2019-11-20 11:19:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:18,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224098683] [2019-11-20 11:19:18,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:18,208 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-20 11:19:18,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224098683] [2019-11-20 11:19:18,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:18,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:18,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750484707] [2019-11-20 11:19:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:18,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:18,214 INFO L87 Difference]: Start difference. First operand 2107 states and 2727 transitions. Second operand 5 states. [2019-11-20 11:19:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:23,719 INFO L93 Difference]: Finished difference Result 3842 states and 4972 transitions. [2019-11-20 11:19:23,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:23,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-20 11:19:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:23,736 INFO L225 Difference]: With dead ends: 3842 [2019-11-20 11:19:23,736 INFO L226 Difference]: Without dead ends: 3787 [2019-11-20 11:19:23,738 INFO L630 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-20 11:19:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2019-11-20 11:19:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 2112. [2019-11-20 11:19:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-11-20 11:19:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2731 transitions. [2019-11-20 11:19:23,860 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2731 transitions. Word has length 79 [2019-11-20 11:19:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:23,860 INFO L462 AbstractCegarLoop]: Abstraction has 2112 states and 2731 transitions. [2019-11-20 11:19:23,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2731 transitions. [2019-11-20 11:19:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 11:19:23,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:23,869 INFO L410 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-20 11:19:23,871 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1148466005, now seen corresponding path program 1 times [2019-11-20 11:19:23,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:23,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596320350] [2019-11-20 11:19:23,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:19:24,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596320350] [2019-11-20 11:19:24,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:24,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:24,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573087003] [2019-11-20 11:19:24,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:24,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:24,101 INFO L87 Difference]: Start difference. First operand 2112 states and 2731 transitions. Second operand 5 states. [2019-11-20 11:19:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:27,353 INFO L93 Difference]: Finished difference Result 4142 states and 5326 transitions. [2019-11-20 11:19:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:27,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-20 11:19:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:27,371 INFO L225 Difference]: With dead ends: 4142 [2019-11-20 11:19:27,371 INFO L226 Difference]: Without dead ends: 4082 [2019-11-20 11:19:27,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:19:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2019-11-20 11:19:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 2132. [2019-11-20 11:19:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-20 11:19:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2754 transitions. [2019-11-20 11:19:27,509 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2754 transitions. Word has length 80 [2019-11-20 11:19:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:27,509 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2754 transitions. [2019-11-20 11:19:27,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2754 transitions. [2019-11-20 11:19:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 11:19:27,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:27,511 INFO L410 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-20 11:19:27,511 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 656972329, now seen corresponding path program 1 times [2019-11-20 11:19:27,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:27,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166973570] [2019-11-20 11:19:27,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:27,713 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-20 11:19:27,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166973570] [2019-11-20 11:19:27,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:27,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:27,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984541020] [2019-11-20 11:19:27,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:27,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:27,716 INFO L87 Difference]: Start difference. First operand 2132 states and 2754 transitions. Second operand 5 states. [2019-11-20 11:19:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:30,312 INFO L93 Difference]: Finished difference Result 5828 states and 7508 transitions. [2019-11-20 11:19:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:30,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-20 11:19:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:30,329 INFO L225 Difference]: With dead ends: 5828 [2019-11-20 11:19:30,329 INFO L226 Difference]: Without dead ends: 3958 [2019-11-20 11:19:30,332 INFO L630 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-20 11:19:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2019-11-20 11:19:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 2147. [2019-11-20 11:19:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-11-20 11:19:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2770 transitions. [2019-11-20 11:19:30,453 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2770 transitions. Word has length 80 [2019-11-20 11:19:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:30,454 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 2770 transitions. [2019-11-20 11:19:30,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2770 transitions. [2019-11-20 11:19:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 11:19:30,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:30,456 INFO L410 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-20 11:19:30,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2043175723, now seen corresponding path program 1 times [2019-11-20 11:19:30,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:30,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472184056] [2019-11-20 11:19:30,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:30,623 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-20 11:19:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472184056] [2019-11-20 11:19:30,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:30,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:19:30,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567473324] [2019-11-20 11:19:30,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:30,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:30,625 INFO L87 Difference]: Start difference. First operand 2147 states and 2770 transitions. Second operand 5 states. [2019-11-20 11:19:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:31,252 INFO L93 Difference]: Finished difference Result 3494 states and 4498 transitions. [2019-11-20 11:19:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:19:31,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-20 11:19:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:31,270 INFO L225 Difference]: With dead ends: 3494 [2019-11-20 11:19:31,270 INFO L226 Difference]: Without dead ends: 3450 [2019-11-20 11:19:31,272 INFO L630 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-20 11:19:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-11-20 11:19:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2192. [2019-11-20 11:19:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-11-20 11:19:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2822 transitions. [2019-11-20 11:19:31,422 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2822 transitions. Word has length 80 [2019-11-20 11:19:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:31,422 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 2822 transitions. [2019-11-20 11:19:31,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2822 transitions. [2019-11-20 11:19:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 11:19:31,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:31,424 INFO L410 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] [2019-11-20 11:19:31,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash -431640320, now seen corresponding path program 1 times [2019-11-20 11:19:31,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:31,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062666426] [2019-11-20 11:19:31,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:31,586 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-20 11:19:31,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062666426] [2019-11-20 11:19:31,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:31,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:31,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351945589] [2019-11-20 11:19:31,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:31,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:31,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:31,589 INFO L87 Difference]: Start difference. First operand 2192 states and 2822 transitions. Second operand 5 states. [2019-11-20 11:19:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:36,662 INFO L93 Difference]: Finished difference Result 3986 states and 5131 transitions. [2019-11-20 11:19:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:36,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-20 11:19:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:36,669 INFO L225 Difference]: With dead ends: 3986 [2019-11-20 11:19:36,669 INFO L226 Difference]: Without dead ends: 3925 [2019-11-20 11:19:36,670 INFO L630 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-20 11:19:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2019-11-20 11:19:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 2193. [2019-11-20 11:19:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-11-20 11:19:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 2823 transitions. [2019-11-20 11:19:36,788 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 2823 transitions. Word has length 86 [2019-11-20 11:19:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:36,788 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 2823 transitions. [2019-11-20 11:19:36,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2823 transitions. [2019-11-20 11:19:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 11:19:36,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:36,790 INFO L410 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-20 11:19:36,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 128207761, now seen corresponding path program 1 times [2019-11-20 11:19:36,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:36,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542585151] [2019-11-20 11:19:36,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:36,958 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-20 11:19:36,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542585151] [2019-11-20 11:19:36,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:36,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:36,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532909594] [2019-11-20 11:19:36,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:19:36,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:19:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:19:36,960 INFO L87 Difference]: Start difference. First operand 2193 states and 2823 transitions. Second operand 6 states. [2019-11-20 11:19:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:37,694 INFO L93 Difference]: Finished difference Result 5181 states and 6672 transitions. [2019-11-20 11:19:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:19:37,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-20 11:19:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:37,705 INFO L225 Difference]: With dead ends: 5181 [2019-11-20 11:19:37,705 INFO L226 Difference]: Without dead ends: 5101 [2019-11-20 11:19:37,707 INFO L630 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-20 11:19:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2019-11-20 11:19:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 2773. [2019-11-20 11:19:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2019-11-20 11:19:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3562 transitions. [2019-11-20 11:19:37,921 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3562 transitions. Word has length 87 [2019-11-20 11:19:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:37,922 INFO L462 AbstractCegarLoop]: Abstraction has 2773 states and 3562 transitions. [2019-11-20 11:19:37,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:19:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3562 transitions. [2019-11-20 11:19:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 11:19:37,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:37,927 INFO L410 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-20 11:19:37,927 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash 105575507, now seen corresponding path program 1 times [2019-11-20 11:19:37,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:37,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514451447] [2019-11-20 11:19:37,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:38,101 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-20 11:19:38,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514451447] [2019-11-20 11:19:38,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:38,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:38,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691501543] [2019-11-20 11:19:38,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:38,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:38,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:38,103 INFO L87 Difference]: Start difference. First operand 2773 states and 3562 transitions. Second operand 5 states. [2019-11-20 11:19:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:40,628 INFO L93 Difference]: Finished difference Result 6573 states and 8428 transitions. [2019-11-20 11:19:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:19:40,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-20 11:19:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:40,636 INFO L225 Difference]: With dead ends: 6573 [2019-11-20 11:19:40,637 INFO L226 Difference]: Without dead ends: 4109 [2019-11-20 11:19:40,641 INFO L630 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-20 11:19:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2019-11-20 11:19:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 2202. [2019-11-20 11:19:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2019-11-20 11:19:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2831 transitions. [2019-11-20 11:19:40,941 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2831 transitions. Word has length 87 [2019-11-20 11:19:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:40,942 INFO L462 AbstractCegarLoop]: Abstraction has 2202 states and 2831 transitions. [2019-11-20 11:19:40,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2831 transitions. [2019-11-20 11:19:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 11:19:40,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:40,944 INFO L410 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] [2019-11-20 11:19:40,944 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 621632742, now seen corresponding path program 1 times [2019-11-20 11:19:40,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:40,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485454732] [2019-11-20 11:19:40,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:41,086 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-20 11:19:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485454732] [2019-11-20 11:19:41,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:41,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:19:41,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698835054] [2019-11-20 11:19:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:19:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:19:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:19:41,090 INFO L87 Difference]: Start difference. First operand 2202 states and 2831 transitions. Second operand 3 states. [2019-11-20 11:19:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:41,377 INFO L93 Difference]: Finished difference Result 4054 states and 5207 transitions. [2019-11-20 11:19:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:19:41,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-20 11:19:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:41,380 INFO L225 Difference]: With dead ends: 4054 [2019-11-20 11:19:41,380 INFO L226 Difference]: Without dead ends: 2144 [2019-11-20 11:19:41,383 INFO L630 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-20 11:19:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2019-11-20 11:19:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2137. [2019-11-20 11:19:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-11-20 11:19:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2733 transitions. [2019-11-20 11:19:41,501 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2733 transitions. Word has length 92 [2019-11-20 11:19:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:41,501 INFO L462 AbstractCegarLoop]: Abstraction has 2137 states and 2733 transitions. [2019-11-20 11:19:41,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:19:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2733 transitions. [2019-11-20 11:19:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 11:19:41,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:41,503 INFO L410 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-20 11:19:41,503 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1645484934, now seen corresponding path program 1 times [2019-11-20 11:19:41,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:41,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131080859] [2019-11-20 11:19:41,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:41,636 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-20 11:19:41,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131080859] [2019-11-20 11:19:41,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:41,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:41,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769419389] [2019-11-20 11:19:41,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:41,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:41,638 INFO L87 Difference]: Start difference. First operand 2137 states and 2733 transitions. Second operand 5 states. [2019-11-20 11:19:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:44,309 INFO L93 Difference]: Finished difference Result 2147 states and 2740 transitions. [2019-11-20 11:19:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:19:44,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-20 11:19:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:44,312 INFO L225 Difference]: With dead ends: 2147 [2019-11-20 11:19:44,313 INFO L226 Difference]: Without dead ends: 2113 [2019-11-20 11:19:44,314 INFO L630 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-20 11:19:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-11-20 11:19:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2109. [2019-11-20 11:19:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-11-20 11:19:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2703 transitions. [2019-11-20 11:19:44,475 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2703 transitions. Word has length 93 [2019-11-20 11:19:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:44,476 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 2703 transitions. [2019-11-20 11:19:44,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2703 transitions. [2019-11-20 11:19:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 11:19:44,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:44,478 INFO L410 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] [2019-11-20 11:19:44,478 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -153642759, now seen corresponding path program 1 times [2019-11-20 11:19:44,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:44,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223768296] [2019-11-20 11:19:44,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:44,640 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-20 11:19:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223768296] [2019-11-20 11:19:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:44,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:19:44,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590647248] [2019-11-20 11:19:44,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:19:44,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:19:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:19:44,646 INFO L87 Difference]: Start difference. First operand 2109 states and 2703 transitions. Second operand 4 states. [2019-11-20 11:19:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:44,845 INFO L93 Difference]: Finished difference Result 2117 states and 2709 transitions. [2019-11-20 11:19:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:19:44,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 11:19:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:44,848 INFO L225 Difference]: With dead ends: 2117 [2019-11-20 11:19:44,848 INFO L226 Difference]: Without dead ends: 2113 [2019-11-20 11:19:44,849 INFO L630 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-20 11:19:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-11-20 11:19:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2109. [2019-11-20 11:19:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-11-20 11:19:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2701 transitions. [2019-11-20 11:19:45,035 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2701 transitions. Word has length 120 [2019-11-20 11:19:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:45,035 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 2701 transitions. [2019-11-20 11:19:45,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:19:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2701 transitions. [2019-11-20 11:19:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 11:19:45,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:45,038 INFO L410 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] [2019-11-20 11:19:45,040 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:45,040 INFO L82 PathProgramCache]: Analyzing trace with hash -3145864, now seen corresponding path program 1 times [2019-11-20 11:19:45,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:45,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309352156] [2019-11-20 11:19:45,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:45,219 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-20 11:19:45,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309352156] [2019-11-20 11:19:45,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:45,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:19:45,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750901000] [2019-11-20 11:19:45,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:19:45,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:19:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:19:45,222 INFO L87 Difference]: Start difference. First operand 2109 states and 2701 transitions. Second operand 3 states. [2019-11-20 11:19:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:45,619 INFO L93 Difference]: Finished difference Result 3985 states and 5087 transitions. [2019-11-20 11:19:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:19:45,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-20 11:19:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:45,622 INFO L225 Difference]: With dead ends: 3985 [2019-11-20 11:19:45,622 INFO L226 Difference]: Without dead ends: 2168 [2019-11-20 11:19:45,625 INFO L630 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-20 11:19:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-11-20 11:19:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2079. [2019-11-20 11:19:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-11-20 11:19:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2641 transitions. [2019-11-20 11:19:45,801 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2641 transitions. Word has length 125 [2019-11-20 11:19:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:45,801 INFO L462 AbstractCegarLoop]: Abstraction has 2079 states and 2641 transitions. [2019-11-20 11:19:45,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:19:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2641 transitions. [2019-11-20 11:19:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 11:19:45,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:45,803 INFO L410 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] [2019-11-20 11:19:45,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash 9924344, now seen corresponding path program 1 times [2019-11-20 11:19:45,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:45,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323057204] [2019-11-20 11:19:45,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:46,028 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-20 11:19:46,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323057204] [2019-11-20 11:19:46,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458941656] [2019-11-20 11:19:46,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/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-20 11:19:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:46,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 2150 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:19:46,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:19:46,754 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-20 11:19:46,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:19:46,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-20 11:19:46,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293166145] [2019-11-20 11:19:46,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:19:46,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:19:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:46,758 INFO L87 Difference]: Start difference. First operand 2079 states and 2641 transitions. Second operand 4 states. [2019-11-20 11:19:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:47,034 INFO L93 Difference]: Finished difference Result 3870 states and 4900 transitions. [2019-11-20 11:19:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:19:47,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-20 11:19:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:47,052 INFO L225 Difference]: With dead ends: 3870 [2019-11-20 11:19:47,052 INFO L226 Difference]: Without dead ends: 2083 [2019-11-20 11:19:47,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 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-20 11:19:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-20 11:19:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2079. [2019-11-20 11:19:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-11-20 11:19:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2637 transitions. [2019-11-20 11:19:47,284 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2637 transitions. Word has length 125 [2019-11-20 11:19:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:47,284 INFO L462 AbstractCegarLoop]: Abstraction has 2079 states and 2637 transitions. [2019-11-20 11:19:47,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:19:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2637 transitions. [2019-11-20 11:19:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 11:19:47,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:47,287 INFO L410 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] [2019-11-20 11:19:47,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:19:47,495 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1488882034, now seen corresponding path program 1 times [2019-11-20 11:19:47,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:47,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786566467] [2019-11-20 11:19:47,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:47,687 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-20 11:19:47,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786566467] [2019-11-20 11:19:47,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:47,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:19:47,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450261589] [2019-11-20 11:19:47,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:19:47,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:19:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:19:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:19:47,689 INFO L87 Difference]: Start difference. First operand 2079 states and 2637 transitions. Second operand 5 states. [2019-11-20 11:19:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:50,033 INFO L93 Difference]: Finished difference Result 3923 states and 4949 transitions. [2019-11-20 11:19:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:19:50,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-20 11:19:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:50,037 INFO L225 Difference]: With dead ends: 3923 [2019-11-20 11:19:50,037 INFO L226 Difference]: Without dead ends: 2131 [2019-11-20 11:19:50,040 INFO L630 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-20 11:19:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2019-11-20 11:19:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2084. [2019-11-20 11:19:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-20 11:19:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2642 transitions. [2019-11-20 11:19:50,374 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2642 transitions. Word has length 133 [2019-11-20 11:19:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:50,375 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 2642 transitions. [2019-11-20 11:19:50,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:19:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2642 transitions. [2019-11-20 11:19:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 11:19:50,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:50,377 INFO L410 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] [2019-11-20 11:19:50,377 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash 419575756, now seen corresponding path program 1 times [2019-11-20 11:19:50,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:50,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524943531] [2019-11-20 11:19:50,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:19:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:19:52,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:19:52,524 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 11:19:52,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:19:52 BoogieIcfgContainer [2019-11-20 11:19:52,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:19:52,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:19:52,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:19:52,880 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:19:52,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:03" (3/4) ... [2019-11-20 11:19:52,884 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:19:52,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:19:52,886 INFO L168 Benchmark]: Toolchain (without parser) took 57527.08 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -216.2 MB). Peak memory consumption was 929.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,886 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:52,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2237.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.7 MB in the beginning and 822.8 MB in the end (delta: 117.9 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 281.97 ms. Allocated memory is still 1.2 GB. Free memory was 822.8 MB in the beginning and 802.0 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,887 INFO L168 Benchmark]: Boogie Preprocessor took 311.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 802.0 MB in the beginning and 1.2 GB in the end (delta: -428.6 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,888 INFO L168 Benchmark]: RCFGBuilder took 5749.47 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.1 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 93.0 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,888 INFO L168 Benchmark]: TraceAbstraction took 48938.10 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 835.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -19.3 MB). Peak memory consumption was 816.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:52,888 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 2.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:52,890 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2237.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.7 MB in the beginning and 822.8 MB in the end (delta: 117.9 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 281.97 ms. Allocated memory is still 1.2 GB. Free memory was 822.8 MB in the beginning and 802.0 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 311.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 802.0 MB in the beginning and 1.2 GB in the end (delta: -428.6 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5749.47 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.1 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 93.0 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48938.10 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 835.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -19.3 MB). Peak memory consumption was 816.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 2.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6935]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 6624, overapproximation of bitwiseOr at line 5685, overapproximation of shiftLeft at line 5130, overapproximation of bitwiseAnd at line 4917. Possible FailurePath: [L5159-L5170] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5171-L5186] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5187-L5191] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5192-L5193] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6118-L6165] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6220-L6258] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6259] static struct lock_class_key __key___9 ; [L6260] static struct lock_class_key __key___10 ; [L6261] static struct lock_class_key __key___11 ; [L6673-L6681] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6684-L6699] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6752] int LDV_IN_INTERRUPT ; [L6753] static int res_catc_open_15 ; [L6754] static int res_catc_stop_16 ; [L6755] static int res_catc_probe_17 ; [L6948] int ldv_urb_state = 0; [L6949] int ldv_coherent_state = 0; VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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)) [L7099] return ldv_malloc(sizeof(struct net_device)); [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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6309] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6315] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6332] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6338] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6355] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7146] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7146] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7146] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7213] return __VERIFIER_nondet_pointer(); [L7146] return (void *)external_alloc(); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5137] urb->start_frame = -1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] EXPR catc->is_f5u011 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6601] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6616] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] catc->is_f5u011 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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 [L7122] return __VERIFIER_nondet_int(); [L6632] netdev->dev.parent = & intf->dev [L7172] 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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6935] __VERIFIER_error() VAL [__key___10={123:0}, __key___11={79:0}, __key___9={94:0}, __this_module={4294967314:4294967366}, catc_driver={55:0}, catc_id_table={113:0}, catc_netdev_ops={90:0}, driver_name={125:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={126: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, 682 locations, 14 error locations. Result: UNSAFE, OverallTime: 48.8s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 24966 SDtfs, 20531 SDslu, 41082 SDs, 0 SdLazy, 5591 SolverSat, 292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 170 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2773occurred 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 17009 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1863 NumberOfCodeBlocks, 1863 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1708 ConstructedInterpolants, 0 QuantifiedInterpolants, 412108 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2150 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 25/28 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-678e011 [2019-11-20 11:19:54,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:19:54,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:19:54,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:19:54,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:19:54,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:19:54,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:19:54,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:19:54,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:19:54,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:19:54,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:19:54,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:19:54,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:19:54,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:19:55,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:19:55,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:19:55,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:19:55,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:19:55,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:19:55,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:19:55,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:19:55,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:19:55,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:19:55,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:19:55,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:19:55,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:19:55,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:19:55,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:19:55,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:19:55,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:19:55,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:19:55,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:19:55,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:19:55,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:19:55,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:19:55,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:19:55,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:19:55,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:19:55,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:19:55,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:19:55,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:19:55,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-11-20 11:19:55,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:19:55,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:19:55,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:19:55,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:19:55,073 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:19:55,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:19:55,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:19:55,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:19:55,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:19:55,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:19:55,076 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:19:55,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:19:55,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:19:55,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:19:55,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:19:55,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:19:55,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:19:55,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:19:55,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:19:55,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:19:55,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:19:55,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:19:55,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:19:55,079 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:19:55,079 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:19:55,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:19:55,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:19:55,080 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-20 11:19:55,080 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_61039dad-1290-4b63-a4eb-54f69392385f/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 -> 2519bb942ec97108414dce6daaf678954280b02e [2019-11-20 11:19:55,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:19:55,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:19:55,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:19:55,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:19:55,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:19:55,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-20 11:19:55,435 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/3c44fa526/195059feaf9847359bfc908897e111e5/FLAG5258f9155 [2019-11-20 11:19:56,125 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:19:56,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-11-20 11:19:56,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/3c44fa526/195059feaf9847359bfc908897e111e5/FLAG5258f9155 [2019-11-20 11:19:56,259 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_61039dad-1290-4b63-a4eb-54f69392385f/bin/uautomizer/data/3c44fa526/195059feaf9847359bfc908897e111e5 [2019-11-20 11:19:56,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:19:56,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:19:56,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:19:56,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:19:56,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:19:56,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:56" (1/1) ... [2019-11-20 11:19:56,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321d0b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:56, skipping insertion in model container [2019-11-20 11:19:56,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:56" (1/1) ... [2019-11-20 11:19:56,285 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:19:56,394 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:19:57,386 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-20 11:19:57,395 INFO L168 Benchmark]: Toolchain (without parser) took 1130.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:57,396 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:57,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1126.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:57,399 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1126.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 47.9 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...