./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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 f38d20c464d5958b65577d8826699a53d6bf9130 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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 f38d20c464d5958b65577d8826699a53d6bf9130 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:32:35,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:32:35,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:32:35,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:32:35,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:32:35,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:32:35,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:32:35,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:32:35,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:32:35,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:32:35,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:32:35,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:32:35,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:32:35,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:32:35,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:32:35,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:32:35,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:32:35,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:32:35,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:32:35,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:32:35,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:32:35,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:32:35,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:32:35,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:32:35,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:32:35,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:32:35,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:32:35,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:32:35,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:32:35,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:32:35,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:32:35,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:32:35,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:32:35,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:32:35,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:32:35,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:32:35,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:32:35,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:32:35,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:32:35,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:32:35,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:32:35,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-12-07 12:32:35,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:32:35,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:32:35,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:32:35,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:32:35,555 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:32:35,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:32:35,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:32:35,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:32:35,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:32:35,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:32:35,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:32:35,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:32:35,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:32:35,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:32:35,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:32:35,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:32:35,559 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_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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 -> f38d20c464d5958b65577d8826699a53d6bf9130 [2019-12-07 12:32:35,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:32:35,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:32:35,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:32:35,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:32:35,681 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:32:35,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:35,728 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/45599c9f8/179a06233d8f433ebb882442b9831281/FLAGdf79196df [2019-12-07 12:32:36,249 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:32:36,249 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:36,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/45599c9f8/179a06233d8f433ebb882442b9831281/FLAGdf79196df [2019-12-07 12:32:36,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/45599c9f8/179a06233d8f433ebb882442b9831281 [2019-12-07 12:32:36,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:32:36,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:32:36,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:36,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:32:36,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:32:36,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:36" (1/1) ... [2019-12-07 12:32:36,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5046e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:36, skipping insertion in model container [2019-12-07 12:32:36,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:36" (1/1) ... [2019-12-07 12:32:36,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:32:36,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:32:37,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:37,482 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:32:37,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:37,761 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:32:37,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37 WrapperNode [2019-12-07 12:32:37,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:37,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:32:37,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:32:37,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:32:37,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:37,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:37,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:32:37,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:32:37,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:32:37,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:32:37,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:37,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:37,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:37,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:38,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:38,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:38,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... [2019-12-07 12:32:38,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:32:38,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:32:38,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:32:38,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:32:38,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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-12-07 12:32:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-12-07 12:32:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-12-07 12:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 12:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 12:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-12-07 12:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:32:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:32:41,256 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:32:41,256 INFO L287 CfgBuilder]: Removed 942 assume(true) statements. [2019-12-07 12:32:41,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:41 BoogieIcfgContainer [2019-12-07 12:32:41,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:32:41,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:32:41,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:32:41,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:32:41,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:36" (1/3) ... [2019-12-07 12:32:41,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:41, skipping insertion in model container [2019-12-07 12:32:41,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:37" (2/3) ... [2019-12-07 12:32:41,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:41, skipping insertion in model container [2019-12-07 12:32:41,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:41" (3/3) ... [2019-12-07 12:32:41,262 INFO L109 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:41,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:32:41,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:32:41,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:32:41,306 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:32:41,306 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:32:41,306 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:32:41,306 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:32:41,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:32:41,306 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:32:41,306 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:32:41,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:32:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-07 12:32:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:32:41,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:41,339 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] [2019-12-07 12:32:41,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash 717736179, now seen corresponding path program 1 times [2019-12-07 12:32:41,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:41,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192115891] [2019-12-07 12:32:41,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:41,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192115891] [2019-12-07 12:32:41,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:41,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:32:41,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002797645] [2019-12-07 12:32:41,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:32:41,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:32:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:32:41,598 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 3 states. [2019-12-07 12:32:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:41,706 INFO L93 Difference]: Finished difference Result 2022 states and 3019 transitions. [2019-12-07 12:32:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:41,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:32:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:41,727 INFO L225 Difference]: With dead ends: 2022 [2019-12-07 12:32:41,727 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 12:32:41,733 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-12-07 12:32:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 12:32:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-12-07 12:32:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 12:32:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1462 transitions. [2019-12-07 12:32:41,811 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1462 transitions. Word has length 33 [2019-12-07 12:32:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:41,811 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1462 transitions. [2019-12-07 12:32:41,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1462 transitions. [2019-12-07 12:32:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:32:41,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:41,813 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] [2019-12-07 12:32:41,813 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash 740368433, now seen corresponding path program 1 times [2019-12-07 12:32:41,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:41,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803201038] [2019-12-07 12:32:41,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:41,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803201038] [2019-12-07 12:32:41,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:41,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:32:41,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618139432] [2019-12-07 12:32:41,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:41,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:41,884 INFO L87 Difference]: Start difference. First operand 982 states and 1462 transitions. Second operand 4 states. [2019-12-07 12:32:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:41,931 INFO L93 Difference]: Finished difference Result 1949 states and 2906 transitions. [2019-12-07 12:32:41,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:41,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:32:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:41,936 INFO L225 Difference]: With dead ends: 1949 [2019-12-07 12:32:41,936 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 12:32:41,938 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-12-07 12:32:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 12:32:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-12-07 12:32:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 12:32:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1461 transitions. [2019-12-07 12:32:41,961 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1461 transitions. Word has length 33 [2019-12-07 12:32:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:41,961 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1461 transitions. [2019-12-07 12:32:41,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1461 transitions. [2019-12-07 12:32:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:32:41,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:41,963 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] [2019-12-07 12:32:41,963 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash 912553216, now seen corresponding path program 1 times [2019-12-07 12:32:41,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:41,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621375493] [2019-12-07 12:32:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:42,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621375493] [2019-12-07 12:32:42,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:42,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:32:42,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224380300] [2019-12-07 12:32:42,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:42,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:42,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:42,048 INFO L87 Difference]: Start difference. First operand 982 states and 1461 transitions. Second operand 4 states. [2019-12-07 12:32:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:42,176 INFO L93 Difference]: Finished difference Result 1949 states and 2905 transitions. [2019-12-07 12:32:42,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:42,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 12:32:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:42,185 INFO L225 Difference]: With dead ends: 1949 [2019-12-07 12:32:42,185 INFO L226 Difference]: Without dead ends: 1947 [2019-12-07 12:32:42,185 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-12-07 12:32:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-07 12:32:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 984. [2019-12-07 12:32:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-12-07 12:32:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1463 transitions. [2019-12-07 12:32:42,217 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1463 transitions. Word has length 36 [2019-12-07 12:32:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:42,218 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1463 transitions. [2019-12-07 12:32:42,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1463 transitions. [2019-12-07 12:32:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:32:42,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:42,219 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] [2019-12-07 12:32:42,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1899101571, now seen corresponding path program 1 times [2019-12-07 12:32:42,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:42,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149425911] [2019-12-07 12:32:42,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:42,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149425911] [2019-12-07 12:32:42,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:42,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:32:42,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918206370] [2019-12-07 12:32:42,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:42,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:42,294 INFO L87 Difference]: Start difference. First operand 984 states and 1463 transitions. Second operand 5 states. [2019-12-07 12:32:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:42,523 INFO L93 Difference]: Finished difference Result 3562 states and 5316 transitions. [2019-12-07 12:32:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:32:42,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 12:32:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:42,538 INFO L225 Difference]: With dead ends: 3562 [2019-12-07 12:32:42,538 INFO L226 Difference]: Without dead ends: 3560 [2019-12-07 12:32:42,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:32:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-12-07 12:32:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 985. [2019-12-07 12:32:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-07 12:32:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1464 transitions. [2019-12-07 12:32:42,589 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1464 transitions. Word has length 43 [2019-12-07 12:32:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:42,589 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1464 transitions. [2019-12-07 12:32:42,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1464 transitions. [2019-12-07 12:32:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:32:42,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:42,591 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] [2019-12-07 12:32:42,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1034505017, now seen corresponding path program 1 times [2019-12-07 12:32:42,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:42,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544319871] [2019-12-07 12:32:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:42,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544319871] [2019-12-07 12:32:42,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:42,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:42,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618523396] [2019-12-07 12:32:42,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:32:42,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:42,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:32:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:32:42,676 INFO L87 Difference]: Start difference. First operand 985 states and 1464 transitions. Second operand 3 states. [2019-12-07 12:32:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:42,797 INFO L93 Difference]: Finished difference Result 1953 states and 2909 transitions. [2019-12-07 12:32:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:42,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 12:32:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:42,805 INFO L225 Difference]: With dead ends: 1953 [2019-12-07 12:32:42,805 INFO L226 Difference]: Without dead ends: 985 [2019-12-07 12:32:42,807 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-12-07 12:32:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-12-07 12:32:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2019-12-07 12:32:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-07 12:32:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1463 transitions. [2019-12-07 12:32:42,866 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1463 transitions. Word has length 57 [2019-12-07 12:32:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:42,867 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1463 transitions. [2019-12-07 12:32:42,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1463 transitions. [2019-12-07 12:32:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:32:42,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:42,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] [2019-12-07 12:32:42,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 407451725, now seen corresponding path program 1 times [2019-12-07 12:32:42,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:42,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675207699] [2019-12-07 12:32:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:42,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675207699] [2019-12-07 12:32:42,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:42,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:42,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022910588] [2019-12-07 12:32:42,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:32:42,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:32:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:32:42,932 INFO L87 Difference]: Start difference. First operand 985 states and 1463 transitions. Second operand 3 states. [2019-12-07 12:32:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:43,082 INFO L93 Difference]: Finished difference Result 1962 states and 2916 transitions. [2019-12-07 12:32:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:43,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 12:32:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:43,088 INFO L225 Difference]: With dead ends: 1962 [2019-12-07 12:32:43,088 INFO L226 Difference]: Without dead ends: 994 [2019-12-07 12:32:43,090 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-12-07 12:32:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-12-07 12:32:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 985. [2019-12-07 12:32:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-07 12:32:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1436 transitions. [2019-12-07 12:32:43,136 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1436 transitions. Word has length 59 [2019-12-07 12:32:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:43,136 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1436 transitions. [2019-12-07 12:32:43,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1436 transitions. [2019-12-07 12:32:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:32:43,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:43,138 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] [2019-12-07 12:32:43,138 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1111841153, now seen corresponding path program 1 times [2019-12-07 12:32:43,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:43,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643587508] [2019-12-07 12:32:43,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:43,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643587508] [2019-12-07 12:32:43,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:32:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566770819] [2019-12-07 12:32:43,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:32:43,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:32:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:32:43,289 INFO L87 Difference]: Start difference. First operand 985 states and 1436 transitions. Second operand 7 states. [2019-12-07 12:32:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:43,790 INFO L93 Difference]: Finished difference Result 4687 states and 6851 transitions. [2019-12-07 12:32:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:32:43,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 12:32:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:43,805 INFO L225 Difference]: With dead ends: 4687 [2019-12-07 12:32:43,805 INFO L226 Difference]: Without dead ends: 3709 [2019-12-07 12:32:43,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:32:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2019-12-07 12:32:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 985. [2019-12-07 12:32:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-07 12:32:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1435 transitions. [2019-12-07 12:32:43,864 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1435 transitions. Word has length 62 [2019-12-07 12:32:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:43,864 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1435 transitions. [2019-12-07 12:32:43,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:32:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1435 transitions. [2019-12-07 12:32:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:32:43,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:43,866 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] [2019-12-07 12:32:43,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:43,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash 998747286, now seen corresponding path program 1 times [2019-12-07 12:32:43,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:43,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556963405] [2019-12-07 12:32:43,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:43,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556963405] [2019-12-07 12:32:43,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:43,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:32:43,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516731249] [2019-12-07 12:32:43,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:43,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:43,952 INFO L87 Difference]: Start difference. First operand 985 states and 1435 transitions. Second operand 4 states. [2019-12-07 12:32:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:44,177 INFO L93 Difference]: Finished difference Result 3568 states and 5223 transitions. [2019-12-07 12:32:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:44,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 12:32:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:44,190 INFO L225 Difference]: With dead ends: 3568 [2019-12-07 12:32:44,191 INFO L226 Difference]: Without dead ends: 2600 [2019-12-07 12:32:44,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2019-12-07 12:32:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 987. [2019-12-07 12:32:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-07 12:32:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1437 transitions. [2019-12-07 12:32:44,255 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1437 transitions. Word has length 63 [2019-12-07 12:32:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:44,255 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 1437 transitions. [2019-12-07 12:32:44,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1437 transitions. [2019-12-07 12:32:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:32:44,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:44,257 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] [2019-12-07 12:32:44,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1114036280, now seen corresponding path program 1 times [2019-12-07 12:32:44,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:44,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864917727] [2019-12-07 12:32:44,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:44,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864917727] [2019-12-07 12:32:44,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:44,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:44,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38465916] [2019-12-07 12:32:44,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:32:44,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:32:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:32:44,309 INFO L87 Difference]: Start difference. First operand 987 states and 1437 transitions. Second operand 3 states. [2019-12-07 12:32:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:44,514 INFO L93 Difference]: Finished difference Result 2775 states and 4057 transitions. [2019-12-07 12:32:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:44,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 12:32:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:44,523 INFO L225 Difference]: With dead ends: 2775 [2019-12-07 12:32:44,523 INFO L226 Difference]: Without dead ends: 1805 [2019-12-07 12:32:44,525 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-12-07 12:32:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-12-07 12:32:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-12-07 12:32:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-07 12:32:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1438 transitions. [2019-12-07 12:32:44,586 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1438 transitions. Word has length 71 [2019-12-07 12:32:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1438 transitions. [2019-12-07 12:32:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1438 transitions. [2019-12-07 12:32:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:32:44,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:44,588 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-12-07 12:32:44,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:44,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1360184679, now seen corresponding path program 1 times [2019-12-07 12:32:44,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:44,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368972706] [2019-12-07 12:32:44,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368972706] [2019-12-07 12:32:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:44,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:44,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32029046] [2019-12-07 12:32:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:32:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:32:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:32:44,642 INFO L87 Difference]: Start difference. First operand 988 states and 1438 transitions. Second operand 3 states. [2019-12-07 12:32:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:44,766 INFO L93 Difference]: Finished difference Result 2775 states and 4056 transitions. [2019-12-07 12:32:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:44,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 12:32:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:44,774 INFO L225 Difference]: With dead ends: 2775 [2019-12-07 12:32:44,774 INFO L226 Difference]: Without dead ends: 1804 [2019-12-07 12:32:44,775 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-12-07 12:32:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-07 12:32:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 984. [2019-12-07 12:32:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-12-07 12:32:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1431 transitions. [2019-12-07 12:32:44,831 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1431 transitions. Word has length 73 [2019-12-07 12:32:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:44,831 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1431 transitions. [2019-12-07 12:32:44,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1431 transitions. [2019-12-07 12:32:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 12:32:44,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:44,833 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] [2019-12-07 12:32:44,833 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:44,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:44,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1859788412, now seen corresponding path program 1 times [2019-12-07 12:32:44,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:44,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584550380] [2019-12-07 12:32:44,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:44,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584550380] [2019-12-07 12:32:44,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:44,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:32:44,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064452026] [2019-12-07 12:32:44,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:44,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:44,920 INFO L87 Difference]: Start difference. First operand 984 states and 1431 transitions. Second operand 5 states. [2019-12-07 12:32:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:45,617 INFO L93 Difference]: Finished difference Result 7777 states and 11388 transitions. [2019-12-07 12:32:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:32:45,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-07 12:32:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:45,641 INFO L225 Difference]: With dead ends: 7777 [2019-12-07 12:32:45,641 INFO L226 Difference]: Without dead ends: 6810 [2019-12-07 12:32:45,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:32:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2019-12-07 12:32:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 987. [2019-12-07 12:32:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-07 12:32:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1434 transitions. [2019-12-07 12:32:45,725 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1434 transitions. Word has length 77 [2019-12-07 12:32:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:45,725 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 1434 transitions. [2019-12-07 12:32:45,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1434 transitions. [2019-12-07 12:32:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 12:32:45,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:45,726 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] [2019-12-07 12:32:45,726 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1166535893, now seen corresponding path program 1 times [2019-12-07 12:32:45,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:45,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938290424] [2019-12-07 12:32:45,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:45,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938290424] [2019-12-07 12:32:45,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:45,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430293357] [2019-12-07 12:32:45,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:45,797 INFO L87 Difference]: Start difference. First operand 987 states and 1434 transitions. Second operand 4 states. [2019-12-07 12:32:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:45,998 INFO L93 Difference]: Finished difference Result 2927 states and 4266 transitions. [2019-12-07 12:32:45,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:45,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 12:32:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:46,001 INFO L225 Difference]: With dead ends: 2927 [2019-12-07 12:32:46,002 INFO L226 Difference]: Without dead ends: 1957 [2019-12-07 12:32:46,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-12-07 12:32:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 988. [2019-12-07 12:32:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-07 12:32:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1435 transitions. [2019-12-07 12:32:46,071 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1435 transitions. Word has length 78 [2019-12-07 12:32:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:46,071 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1435 transitions. [2019-12-07 12:32:46,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1435 transitions. [2019-12-07 12:32:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 12:32:46,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:46,073 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-12-07 12:32:46,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2116689686, now seen corresponding path program 1 times [2019-12-07 12:32:46,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:46,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475195448] [2019-12-07 12:32:46,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:46,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475195448] [2019-12-07 12:32:46,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:46,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:32:46,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108945386] [2019-12-07 12:32:46,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:46,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:46,224 INFO L87 Difference]: Start difference. First operand 988 states and 1435 transitions. Second operand 5 states. [2019-12-07 12:32:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:46,329 INFO L93 Difference]: Finished difference Result 1962 states and 2855 transitions. [2019-12-07 12:32:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:46,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-07 12:32:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:46,332 INFO L225 Difference]: With dead ends: 1962 [2019-12-07 12:32:46,332 INFO L226 Difference]: Without dead ends: 988 [2019-12-07 12:32:46,333 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-12-07 12:32:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-07 12:32:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2019-12-07 12:32:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-07 12:32:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1434 transitions. [2019-12-07 12:32:46,408 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1434 transitions. Word has length 80 [2019-12-07 12:32:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:46,408 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1434 transitions. [2019-12-07 12:32:46,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1434 transitions. [2019-12-07 12:32:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 12:32:46,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:46,409 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-12-07 12:32:46,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash 354047021, now seen corresponding path program 1 times [2019-12-07 12:32:46,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:46,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701317281] [2019-12-07 12:32:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:46,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:32:46,966 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:32:47,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:47 BoogieIcfgContainer [2019-12-07 12:32:47,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:32:47,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:32:47,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:32:47,081 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:32:47,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:41" (3/4) ... [2019-12-07 12:32:47,083 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:32:47,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:32:47,085 INFO L168 Benchmark]: Toolchain (without parser) took 10568.42 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 588.8 MB). Free memory was 932.8 MB in the beginning and 1.3 GB in the end (delta: -416.7 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,085 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:47,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1243.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 932.8 MB in the beginning and 923.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.48 ms. Allocated memory is still 1.1 GB. Free memory was 923.4 MB in the beginning and 891.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,086 INFO L168 Benchmark]: Boogie Preprocessor took 183.09 ms. Allocated memory is still 1.1 GB. Free memory was 891.2 MB in the beginning and 864.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,087 INFO L168 Benchmark]: RCFGBuilder took 3151.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 864.3 MB in the beginning and 909.1 MB in the end (delta: -44.8 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,087 INFO L168 Benchmark]: TraceAbstraction took 5822.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 409.5 MB). Free memory was 909.1 MB in the beginning and 1.3 GB in the end (delta: -440.4 MB). Peak memory consumption was 542.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:47,087 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:47,089 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1243.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 932.8 MB in the beginning and 923.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.48 ms. Allocated memory is still 1.1 GB. Free memory was 923.4 MB in the beginning and 891.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 183.09 ms. Allocated memory is still 1.1 GB. Free memory was 891.2 MB in the beginning and 864.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3151.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 864.3 MB in the beginning and 909.1 MB in the end (delta: -44.8 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5822.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 409.5 MB). Free memory was 909.1 MB in the beginning and 1.3 GB in the end (delta: -440.4 MB). Peak memory consumption was 542.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7115]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 4859, overapproximation of bitwiseAnd at line 4724. Possible FailurePath: [L5020] static struct net_device **slip_devs ; [L5021] static int slip_maxdev = 256; [L5836-L5839] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6709-L6712] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6896] int LDV_IN_INTERRUPT ; VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=0, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L6899] struct net_device *var_group1 ; [L6900] int res_sl_init_14 ; [L6901] int res_sl_open_11 ; [L6902] int res_sl_close_10 ; [L6903] struct sk_buff *var_group2 ; [L6904] struct rtnl_link_stats64 *var_group3 ; [L6905] int var_sl_change_mtu_12_p1 ; [L6906] struct ifreq *var_group4 ; [L6907] int var_sl_ioctl_30_p2 ; [L6908] struct tty_struct *var_group5 ; [L6909] int res_slip_open_21 ; [L6910] struct file *var_group6 ; [L6911] unsigned int var_slip_ioctl_28_p2 ; [L6912] unsigned long var_slip_ioctl_28_p3 ; [L6913] unsigned int var_slip_compat_ioctl_29_p2 ; [L6914] unsigned long var_slip_compat_ioctl_29_p3 ; [L6915] unsigned char const *var_slip_receive_buf_18_p1 ; [L6916] char *var_slip_receive_buf_18_p2 ; [L6917] int var_slip_receive_buf_18_p3 ; [L6918] unsigned long var_sl_keepalive_34_p0 ; [L6919] unsigned long var_sl_outfill_33_p0 ; [L6920] int ldv_s_sl_netdev_ops_net_device_ops ; [L6921] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6922] int tmp ; [L6923] int tmp___0 ; [L6924] int tmp___1 ; [L6926] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6927] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6928] LDV_IN_INTERRUPT = 1 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L6715] int status ; [L6716] void *tmp ; VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L6718] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] void *tmp ; [L4848] void *tmp___2 ; [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L4836] return res; VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L4843] return ldv_malloc(size); [L4850] tmp___2 = __kmalloc(size, flags) [L4851] return (tmp___2); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L4859] tmp = kmalloc(size, flags | 32768U) [L4860] return (tmp); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={0:0}, slip_maxdev=256] [L6726] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6727] slip_devs = (struct net_device **)tmp VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6728] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7273] return __VERIFIER_nondet_int(); [L6733] status = tty_register_ldisc(1, & sl_ldisc) [L6734] COND FALSE !(status != 0) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6739] return (status); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6931] tmp = slip_init() [L6932] COND FALSE !(tmp != 0) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7062] tmp___1 = __VERIFIER_nondet_int() [L7063] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6938] tmp___0 = __VERIFIER_nondet_int() [L6940] case 0: [L6953] case 1: [L6966] case 2: [L6979] case 3: [L6987] case 4: [L6991] case 5: [L6995] case 6: [L6999] case 7: [L7003] case 8: [L7007] case 9: VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7008] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7103] ldv_func_ret_type___1 ldv_func_res ; [L7104] int tmp ; [L6023] struct slip *sl ; [L6024] int err ; [L6025] int tmp ; [L6026] dev_t tmp___0 ; [L6027] struct task_struct *tmp___1 ; [L6028] int tmp___2 ; [L7158] return __VERIFIER_nondet_int(); [L6030] tmp = capable(12) [L6031] COND FALSE !(tmp == 0) [L6035] EXPR tty->ops [L6035] EXPR (tty->ops)->write VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6035-L6037] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5911] int i ; [L5912] struct net_device *dev ; [L5913] struct slip *sl ; [L5914] void *tmp ; [L5916] i = 0 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5937] COND TRUE i < slip_maxdev VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5919] EXPR slip_devs + (unsigned long )i [L5919] dev = *(slip_devs + (unsigned long )i) [L5920] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6043] EXPR tty->disc_data [L6043] sl = (struct slip *)tty->disc_data [L6044] err = -17 [L6045] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6045] EXPR sl->magic [L6045] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6045] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6049] err = -23 [L7262] return __VERIFIER_nondet_uint(); [L6050] tmp___0 = tty_devnum(tty) [L5947] int i ; [L5948] struct net_device *dev ; [L5949] struct slip *sl ; [L5950] void *tmp ; [L5951] int tmp___0 ; [L5952] char name[16U] ; [L5953] void *tmp___1 ; [L5954] struct lock_class_key __key ; [L5955] struct lock_class_key __key___0 ; [L5956] struct lock_class_key __key___1 ; [L5958] dev = 0 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5959] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5963] i = 0 VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5973] COND TRUE i < slip_maxdev VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5966] EXPR slip_devs + (unsigned long )i [L5966] dev = *(slip_devs + (unsigned long )i) [L5967] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5978] COND FALSE !(i >= slip_maxdev) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5982] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5994] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L4836] return res; VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7154] return ldv_malloc(sizeof(struct net_device)); [L5996] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L5997] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6001] dev->base_addr = (unsigned long )i VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L4889] return ((void *)dev + 2496U); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6004] tmp___1 = netdev_priv((struct net_device const *)dev) [L6005] sl = (struct slip *)tmp___1 [L6006] sl->magic = 21250 [L6007] sl->dev = dev [L4767] return (& lock->ldv_5934.rlock); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6010] sl->mode = 8U [L6012] sl->keepalive_timer.data = (unsigned long )sl [L6013] sl->keepalive_timer.function = & sl_keepalive [L6015] sl->outfill_timer.data = (unsigned long )sl [L6016] sl->outfill_timer.function = & sl_outfill [L6017] *(slip_devs + (unsigned long )i) = dev [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6051] sl = sl_alloc(tmp___0) [L6052] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6056] sl->tty = tty [L6057] tty->disc_data = (void *)sl [L7262] return __VERIFIER_nondet_uint(); [L6058] sl->line = tty_devnum(tty) [L4735] struct task_struct *pfo_ret__ ; [L4738] case 1UL: [L4741] case 2UL: [L4744] case 4UL: [L4747] case 8UL: VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L4754] return (pfo_ret__); VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6059] tmp___1 = get_current() [L6060] EXPR tmp___1->pid [L6060] sl->pid = tmp___1->pid [L4724] EXPR addr + (unsigned long )(nr / 64U) [L4724] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6061] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6062] COND FALSE !(tmp___2 == 0) VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6076] EXPR sl->keepalive VAL [__this_module={2147483664:2147483679}, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6076] COND TRUE (unsigned int )sl->keepalive != 0U [L6077] EXPR sl->keepalive [L6077] sl->keepalive_timer.expires = (unsigned long )((int )sl->keepalive * 250) + (unsigned long )jiffies [L6081] EXPR sl->outfill VAL [__this_module={2147483664:2147483679}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6081] COND TRUE (unsigned int )sl->outfill != 0U [L6082] EXPR sl->outfill [L6082] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6087] tty->receive_room = 65536U [L6088] EXPR sl->dev [L6088] EXPR (sl->dev)->base_addr [L6088] return ((int )(sl->dev)->base_addr); [L7106] tmp = slip_open(tty) [L7107] ldv_func_res = tmp [L7121] COND FALSE !(ret_val <= 0) VAL [__this_module={2147483664:2147483679}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7115] __VERIFIER_error() VAL [__this_module={2147483664:2147483679}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={127:0}, sl_netdev_ops={134:0}, slip_devs={-4095:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1013 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 32325 SDtfs, 35016 SDslu, 53568 SDs, 0 SdLazy, 609 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 16313 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 81228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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.25-f470102 [2019-12-07 12:32:48,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:32:48,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:32:48,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:32:48,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:32:48,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:32:48,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:32:48,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:32:48,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:32:48,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:32:48,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:32:48,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:32:48,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:32:48,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:32:48,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:32:48,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:32:48,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:32:48,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:32:48,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:32:48,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:32:48,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:32:48,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:32:48,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:32:48,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:32:48,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:32:48,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:32:48,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:32:48,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:32:48,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:32:48,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:32:48,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:32:48,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:32:48,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:32:48,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:32:48,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:32:48,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:32:48,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:32:48,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:32:48,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:32:48,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:32:48,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:32:48,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-12-07 12:32:48,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:32:48,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:32:48,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:32:48,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:32:48,479 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:32:48,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:32:48,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:32:48,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:32:48,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:32:48,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:32:48,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:32:48,483 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-07 12:32:48,483 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_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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 -> f38d20c464d5958b65577d8826699a53d6bf9130 [2019-12-07 12:32:48,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:32:48,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:32:48,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:32:48,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:32:48,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:32:48,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:48,711 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/d15448a81/2d367bf66f09499fbd2fe7d05d7ed614/FLAG36c4689a2 [2019-12-07 12:32:49,273 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:32:49,273 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:49,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/d15448a81/2d367bf66f09499fbd2fe7d05d7ed614/FLAG36c4689a2 [2019-12-07 12:32:49,475 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/data/d15448a81/2d367bf66f09499fbd2fe7d05d7ed614 [2019-12-07 12:32:49,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:32:49,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:32:49,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:49,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:32:49,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:32:49,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:49" (1/1) ... [2019-12-07 12:32:49,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12116f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:49, skipping insertion in model container [2019-12-07 12:32:49,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:49" (1/1) ... [2019-12-07 12:32:49,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:32:49,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:32:50,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:50,402 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:32:50,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:32:50,693 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:32:50,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50 WrapperNode [2019-12-07 12:32:50,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:32:50,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:32:50,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:32:50,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:32:50,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:32:50,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:32:50,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:32:50,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:32:50,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... [2019-12-07 12:32:50,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:32:50,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:32:50,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:32:50,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:32:50,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/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-12-07 12:32:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 12:32:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-07 12:32:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-12-07 12:32:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2019-12-07 12:32:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2019-12-07 12:32:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:32:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 12:32:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-12-07 12:32:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 12:32:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2019-12-07 12:32:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:32:51,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:32:59,018 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:32:59,018 INFO L287 CfgBuilder]: Removed 942 assume(true) statements. [2019-12-07 12:32:59,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:59 BoogieIcfgContainer [2019-12-07 12:32:59,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:32:59,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:32:59,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:32:59,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:32:59,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:49" (1/3) ... [2019-12-07 12:32:59,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68558911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:59, skipping insertion in model container [2019-12-07 12:32:59,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:50" (2/3) ... [2019-12-07 12:32:59,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68558911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:59, skipping insertion in model container [2019-12-07 12:32:59,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:59" (3/3) ... [2019-12-07 12:32:59,026 INFO L109 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-12-07 12:32:59,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:32:59,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:32:59,051 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:32:59,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:32:59,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:32:59,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:32:59,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:32:59,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:32:59,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:32:59,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:32:59,074 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:32:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-07 12:32:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:32:59,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:59,103 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] [2019-12-07 12:32:59,103 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash 717736179, now seen corresponding path program 1 times [2019-12-07 12:32:59,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:59,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420907047] [2019-12-07 12:32:59,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:32:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:59,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:32:59,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:59,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:32:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:32:59,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420907047] [2019-12-07 12:32:59,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:59,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:32:59,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085370531] [2019-12-07 12:32:59,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:59,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:32:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:59,482 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 4 states. [2019-12-07 12:32:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:59,625 INFO L93 Difference]: Finished difference Result 2022 states and 3019 transitions. [2019-12-07 12:32:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:59,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:32:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:59,641 INFO L225 Difference]: With dead ends: 2022 [2019-12-07 12:32:59,642 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 12:32:59,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 12:32:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-12-07 12:32:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 12:32:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1462 transitions. [2019-12-07 12:32:59,714 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1462 transitions. Word has length 33 [2019-12-07 12:32:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:59,715 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1462 transitions. [2019-12-07 12:32:59,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1462 transitions. [2019-12-07 12:32:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:32:59,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:59,716 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] [2019-12-07 12:32:59,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:32:59,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 740368433, now seen corresponding path program 1 times [2019-12-07 12:32:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:32:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395180547] [2019-12-07 12:32:59,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:00,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:33:00,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:00,175 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:00,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395180547] [2019-12-07 12:33:00,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:00,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:33:00,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17408044] [2019-12-07 12:33:00,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:33:00,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:33:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:00,191 INFO L87 Difference]: Start difference. First operand 982 states and 1462 transitions. Second operand 6 states. [2019-12-07 12:33:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:00,260 INFO L93 Difference]: Finished difference Result 1949 states and 2906 transitions. [2019-12-07 12:33:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:33:00,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 12:33:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:00,267 INFO L225 Difference]: With dead ends: 1949 [2019-12-07 12:33:00,267 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 12:33:00,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:33:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 12:33:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-12-07 12:33:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 12:33:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1461 transitions. [2019-12-07 12:33:00,303 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1461 transitions. Word has length 33 [2019-12-07 12:33:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:00,303 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1461 transitions. [2019-12-07 12:33:00,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1461 transitions. [2019-12-07 12:33:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:33:00,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:00,305 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] [2019-12-07 12:33:00,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:33:00,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 912553216, now seen corresponding path program 1 times [2019-12-07 12:33:00,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:00,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403407790] [2019-12-07 12:33:00,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:00,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 12:33:00,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:00,929 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:01,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403407790] [2019-12-07 12:33:01,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:01,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 12:33:01,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151749775] [2019-12-07 12:33:01,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:33:01,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:33:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:33:01,047 INFO L87 Difference]: Start difference. First operand 982 states and 1461 transitions. Second operand 12 states. [2019-12-07 12:33:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:04,045 INFO L93 Difference]: Finished difference Result 8272 states and 12370 transitions. [2019-12-07 12:33:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:33:04,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-12-07 12:33:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:04,075 INFO L225 Difference]: With dead ends: 8272 [2019-12-07 12:33:04,075 INFO L226 Difference]: Without dead ends: 7297 [2019-12-07 12:33:04,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:33:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7297 states. [2019-12-07 12:33:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7297 to 1924. [2019-12-07 12:33:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-12-07 12:33:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2871 transitions. [2019-12-07 12:33:04,178 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2871 transitions. Word has length 36 [2019-12-07 12:33:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:04,178 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2871 transitions. [2019-12-07 12:33:04,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:33:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2871 transitions. [2019-12-07 12:33:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:33:04,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:04,179 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] [2019-12-07 12:33:04,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:33:04,380 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1025862103, now seen corresponding path program 1 times [2019-12-07 12:33:04,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:04,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322251819] [2019-12-07 12:33:04,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:04,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:33:04,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:04,651 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:04,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322251819] [2019-12-07 12:33:04,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:04,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:33:04,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286143968] [2019-12-07 12:33:04,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:33:04,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:33:04,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:33:04,654 INFO L87 Difference]: Start difference. First operand 1924 states and 2871 transitions. Second operand 5 states. [2019-12-07 12:33:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:04,769 INFO L93 Difference]: Finished difference Result 3834 states and 5727 transitions. [2019-12-07 12:33:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:33:04,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 12:33:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:04,777 INFO L225 Difference]: With dead ends: 3834 [2019-12-07 12:33:04,777 INFO L226 Difference]: Without dead ends: 1924 [2019-12-07 12:33:04,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 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-12-07 12:33:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-12-07 12:33:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1924. [2019-12-07 12:33:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-12-07 12:33:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2870 transitions. [2019-12-07 12:33:04,847 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2870 transitions. Word has length 37 [2019-12-07 12:33:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:04,847 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2870 transitions. [2019-12-07 12:33:04,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:33:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2870 transitions. [2019-12-07 12:33:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:33:04,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:04,848 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] [2019-12-07 12:33:05,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:33:05,049 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash 824841844, now seen corresponding path program 1 times [2019-12-07 12:33:05,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:05,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528631805] [2019-12-07 12:33:05,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:05,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:33:05,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:05,315 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:05,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528631805] [2019-12-07 12:33:05,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:05,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:33:05,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943366229] [2019-12-07 12:33:05,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:33:05,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:05,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:33:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:05,331 INFO L87 Difference]: Start difference. First operand 1924 states and 2870 transitions. Second operand 6 states. [2019-12-07 12:33:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:05,596 INFO L93 Difference]: Finished difference Result 6520 states and 9747 transitions. [2019-12-07 12:33:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:33:05,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 12:33:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:05,622 INFO L225 Difference]: With dead ends: 6520 [2019-12-07 12:33:05,622 INFO L226 Difference]: Without dead ends: 6518 [2019-12-07 12:33:05,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:33:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6518 states. [2019-12-07 12:33:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6518 to 1928. [2019-12-07 12:33:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-12-07 12:33:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2874 transitions. [2019-12-07 12:33:05,724 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2874 transitions. Word has length 37 [2019-12-07 12:33:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:05,724 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2874 transitions. [2019-12-07 12:33:05,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2874 transitions. [2019-12-07 12:33:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:33:05,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:05,725 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] [2019-12-07 12:33:05,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:33:05,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1846382991, now seen corresponding path program 1 times [2019-12-07 12:33:05,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:05,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527910831] [2019-12-07 12:33:05,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:06,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:33:06,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:06,195 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:06,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527910831] [2019-12-07 12:33:06,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:06,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:33:06,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339102407] [2019-12-07 12:33:06,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:33:06,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:33:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:06,213 INFO L87 Difference]: Start difference. First operand 1928 states and 2874 transitions. Second operand 6 states. [2019-12-07 12:33:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:06,642 INFO L93 Difference]: Finished difference Result 7645 states and 11421 transitions. [2019-12-07 12:33:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:33:06,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 12:33:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:06,662 INFO L225 Difference]: With dead ends: 7645 [2019-12-07 12:33:06,663 INFO L226 Difference]: Without dead ends: 5734 [2019-12-07 12:33:06,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:33:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2019-12-07 12:33:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 1948. [2019-12-07 12:33:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2019-12-07 12:33:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2902 transitions. [2019-12-07 12:33:06,772 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2902 transitions. Word has length 44 [2019-12-07 12:33:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:06,772 INFO L462 AbstractCegarLoop]: Abstraction has 1948 states and 2902 transitions. [2019-12-07 12:33:06,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2902 transitions. [2019-12-07 12:33:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 12:33:06,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:06,773 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] [2019-12-07 12:33:06,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:33:06,974 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 627857998, now seen corresponding path program 1 times [2019-12-07 12:33:06,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:06,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038656519] [2019-12-07 12:33:06,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:07,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:33:07,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:07,273 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:07,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038656519] [2019-12-07 12:33:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 12:33:07,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495567073] [2019-12-07 12:33:07,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:33:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:33:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:33:07,296 INFO L87 Difference]: Start difference. First operand 1948 states and 2902 transitions. Second operand 8 states. [2019-12-07 12:33:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:08,034 INFO L93 Difference]: Finished difference Result 9779 states and 14615 transitions. [2019-12-07 12:33:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:33:08,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-12-07 12:33:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:08,055 INFO L225 Difference]: With dead ends: 9779 [2019-12-07 12:33:08,055 INFO L226 Difference]: Without dead ends: 9777 [2019-12-07 12:33:08,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:33:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9777 states. [2019-12-07 12:33:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9777 to 1950. [2019-12-07 12:33:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-07 12:33:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2904 transitions. [2019-12-07 12:33:08,194 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2904 transitions. Word has length 46 [2019-12-07 12:33:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:08,194 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 2904 transitions. [2019-12-07 12:33:08,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:33:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2904 transitions. [2019-12-07 12:33:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:33:08,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:08,196 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] [2019-12-07 12:33:08,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:33:08,397 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1539485102, now seen corresponding path program 1 times [2019-12-07 12:33:08,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:08,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604009949] [2019-12-07 12:33:08,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:08,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:33:08,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:08,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:08,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604009949] [2019-12-07 12:33:08,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:08,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:33:08,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027716540] [2019-12-07 12:33:08,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:33:08,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:33:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:33:08,779 INFO L87 Difference]: Start difference. First operand 1950 states and 2904 transitions. Second operand 3 states. [2019-12-07 12:33:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:09,058 INFO L93 Difference]: Finished difference Result 1952 states and 2905 transitions. [2019-12-07 12:33:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:33:09,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 12:33:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:09,066 INFO L225 Difference]: With dead ends: 1952 [2019-12-07 12:33:09,066 INFO L226 Difference]: Without dead ends: 995 [2019-12-07 12:33:09,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 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-12-07 12:33:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-12-07 12:33:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2019-12-07 12:33:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-07 12:33:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1475 transitions. [2019-12-07 12:33:09,173 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1475 transitions. Word has length 60 [2019-12-07 12:33:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:09,174 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 1475 transitions. [2019-12-07 12:33:09,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:33:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1475 transitions. [2019-12-07 12:33:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:33:09,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:09,175 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] [2019-12-07 12:33:09,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:33:09,377 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash 452894488, now seen corresponding path program 1 times [2019-12-07 12:33:09,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:09,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089521510] [2019-12-07 12:33:09,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:09,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:33:09,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:09,730 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:09,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089521510] [2019-12-07 12:33:09,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:09,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:33:09,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870235212] [2019-12-07 12:33:09,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:33:09,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:33:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:09,747 INFO L87 Difference]: Start difference. First operand 995 states and 1475 transitions. Second operand 6 states. [2019-12-07 12:33:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:10,671 INFO L93 Difference]: Finished difference Result 3908 states and 5822 transitions. [2019-12-07 12:33:10,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:33:10,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 12:33:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:10,675 INFO L225 Difference]: With dead ends: 3908 [2019-12-07 12:33:10,675 INFO L226 Difference]: Without dead ends: 2930 [2019-12-07 12:33:10,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:33:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-12-07 12:33:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1000. [2019-12-07 12:33:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-07 12:33:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1481 transitions. [2019-12-07 12:33:10,746 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1481 transitions. Word has length 62 [2019-12-07 12:33:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:10,746 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1481 transitions. [2019-12-07 12:33:10,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1481 transitions. [2019-12-07 12:33:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 12:33:10,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:10,748 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 12:33:10,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 12:33:10,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 725764728, now seen corresponding path program 1 times [2019-12-07 12:33:10,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:10,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205781059] [2019-12-07 12:33:10,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:11,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:33:11,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:11,259 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:11,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205781059] [2019-12-07 12:33:11,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:33:11,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-07 12:33:11,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22103113] [2019-12-07 12:33:11,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:33:11,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:33:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:33:11,329 INFO L87 Difference]: Start difference. First operand 1000 states and 1481 transitions. Second operand 10 states. [2019-12-07 12:33:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:14,599 INFO L93 Difference]: Finished difference Result 7821 states and 11648 transitions. [2019-12-07 12:33:14,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:33:14,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-07 12:33:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:14,610 INFO L225 Difference]: With dead ends: 7821 [2019-12-07 12:33:14,610 INFO L226 Difference]: Without dead ends: 6838 [2019-12-07 12:33:14,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:33:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2019-12-07 12:33:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 1012. [2019-12-07 12:33:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-12-07 12:33:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2019-12-07 12:33:14,711 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 68 [2019-12-07 12:33:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:14,711 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2019-12-07 12:33:14,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:33:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2019-12-07 12:33:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 12:33:14,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:14,713 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] [2019-12-07 12:33:14,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:33:14,914 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash -587498206, now seen corresponding path program 1 times [2019-12-07 12:33:14,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:14,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950850291] [2019-12-07 12:33:14,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:15,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:33:15,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:15,291 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:15,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950850291] [2019-12-07 12:33:15,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:15,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:33:15,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317324156] [2019-12-07 12:33:15,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:33:15,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:33:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:33:15,312 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand 6 states. [2019-12-07 12:33:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:16,326 INFO L93 Difference]: Finished difference Result 4430 states and 6605 transitions. [2019-12-07 12:33:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:33:16,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 12:33:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:16,329 INFO L225 Difference]: With dead ends: 4430 [2019-12-07 12:33:16,329 INFO L226 Difference]: Without dead ends: 3435 [2019-12-07 12:33:16,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:33:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-12-07 12:33:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 1014. [2019-12-07 12:33:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-07 12:33:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2019-12-07 12:33:16,427 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 70 [2019-12-07 12:33:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:16,428 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2019-12-07 12:33:16,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:33:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2019-12-07 12:33:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 12:33:16,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:16,430 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-12-07 12:33:16,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 12:33:16,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1668870795, now seen corresponding path program 1 times [2019-12-07 12:33:16,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:16,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79438591] [2019-12-07 12:33:16,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:16,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:33:16,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:16,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:17,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79438591] [2019-12-07 12:33:17,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:17,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:33:17,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60339810] [2019-12-07 12:33:17,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:33:17,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:33:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:33:17,001 INFO L87 Difference]: Start difference. First operand 1014 states and 1499 transitions. Second operand 3 states. [2019-12-07 12:33:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:17,303 INFO L93 Difference]: Finished difference Result 2840 states and 4222 transitions. [2019-12-07 12:33:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:33:17,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 12:33:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:17,305 INFO L225 Difference]: With dead ends: 2840 [2019-12-07 12:33:17,305 INFO L226 Difference]: Without dead ends: 1843 [2019-12-07 12:33:17,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-12-07 12:33:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-12-07 12:33:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1016. [2019-12-07 12:33:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-12-07 12:33:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1501 transitions. [2019-12-07 12:33:17,403 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1501 transitions. Word has length 72 [2019-12-07 12:33:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:17,403 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1501 transitions. [2019-12-07 12:33:17,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:33:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1501 transitions. [2019-12-07 12:33:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:33:17,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:17,404 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] [2019-12-07 12:33:17,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 12:33:17,605 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1169519978, now seen corresponding path program 1 times [2019-12-07 12:33:17,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:17,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220671629] [2019-12-07 12:33:17,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:17,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:33:17,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:18,012 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:18,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220671629] [2019-12-07 12:33:18,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:18,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 12:33:18,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87276055] [2019-12-07 12:33:18,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:33:18,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:33:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:33:18,051 INFO L87 Difference]: Start difference. First operand 1016 states and 1501 transitions. Second operand 8 states. [2019-12-07 12:33:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:20,799 INFO L93 Difference]: Finished difference Result 8258 states and 12291 transitions. [2019-12-07 12:33:20,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:33:20,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-12-07 12:33:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:20,806 INFO L225 Difference]: With dead ends: 8258 [2019-12-07 12:33:20,806 INFO L226 Difference]: Without dead ends: 7259 [2019-12-07 12:33:20,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:33:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2019-12-07 12:33:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 1019. [2019-12-07 12:33:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-07 12:33:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1504 transitions. [2019-12-07 12:33:20,949 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1504 transitions. Word has length 76 [2019-12-07 12:33:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:20,949 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1504 transitions. [2019-12-07 12:33:20,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:33:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1504 transitions. [2019-12-07 12:33:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 12:33:20,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:20,951 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] [2019-12-07 12:33:21,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 12:33:21,152 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1094326623, now seen corresponding path program 1 times [2019-12-07 12:33:21,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:21,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679318630] [2019-12-07 12:33:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:33:21,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:33:21,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:33:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:21,588 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:33:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:33:21,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679318630] [2019-12-07 12:33:21,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:33:21,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:33:21,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739910892] [2019-12-07 12:33:21,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:33:21,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:33:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:33:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:33:21,596 INFO L87 Difference]: Start difference. First operand 1019 states and 1504 transitions. Second operand 3 states. [2019-12-07 12:33:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:33:21,782 INFO L93 Difference]: Finished difference Result 2030 states and 3000 transitions. [2019-12-07 12:33:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:33:21,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 12:33:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:33:21,784 INFO L225 Difference]: With dead ends: 2030 [2019-12-07 12:33:21,784 INFO L226 Difference]: Without dead ends: 1028 [2019-12-07 12:33:21,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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-12-07 12:33:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-12-07 12:33:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-12-07 12:33:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-07 12:33:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1477 transitions. [2019-12-07 12:33:21,894 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1477 transitions. Word has length 77 [2019-12-07 12:33:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:33:21,894 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1477 transitions. [2019-12-07 12:33:21,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:33:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1477 transitions. [2019-12-07 12:33:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 12:33:21,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:33:21,895 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-12-07 12:33:22,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 12:33:22,096 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:33:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:33:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash 354047021, now seen corresponding path program 1 times [2019-12-07 12:33:22,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:33:22,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244795334] [2019-12-07 12:33:22,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 12:33:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:33:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:33:34,071 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 12:33:34,071 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:33:34,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 12:33:34,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:33:34 BoogieIcfgContainer [2019-12-07 12:33:34,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:33:34,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:33:34,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:33:34,425 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:33:34,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:59" (3/4) ... [2019-12-07 12:33:34,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:33:34,524 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a2d1e9fd-c94c-4d01-8b18-ff8193c726f4/bin/uautomizer/witness.graphml [2019-12-07 12:33:34,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:33:34,525 INFO L168 Benchmark]: Toolchain (without parser) took 45046.19 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 900.2 MB). Free memory was 941.6 MB in the beginning and 1.2 GB in the end (delta: -278.8 MB). Peak memory consumption was 621.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,525 INFO L168 Benchmark]: CDTParser took 0.16 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-12-07 12:33:34,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1214.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 941.6 MB in the beginning and 989.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.81 ms. Allocated memory is still 1.2 GB. Free memory was 989.0 MB in the beginning and 962.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,526 INFO L168 Benchmark]: Boogie Preprocessor took 138.68 ms. Allocated memory is still 1.2 GB. Free memory was 962.8 MB in the beginning and 936.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,526 INFO L168 Benchmark]: RCFGBuilder took 8029.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -304.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,526 INFO L168 Benchmark]: TraceAbstraction took 35404.73 ms. Allocated memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: 535.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -19.2 MB). Peak memory consumption was 516.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,527 INFO L168 Benchmark]: Witness Printer took 98.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:33:34,528 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.16 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 1214.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 941.6 MB in the beginning and 989.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.81 ms. Allocated memory is still 1.2 GB. Free memory was 989.0 MB in the beginning and 962.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.68 ms. Allocated memory is still 1.2 GB. Free memory was 962.8 MB in the beginning and 936.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8029.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -304.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35404.73 ms. Allocated memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: 535.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -19.2 MB). Peak memory consumption was 516.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7115]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5020] static struct net_device **slip_devs ; [L5021] static int slip_maxdev = 256; [L5836-L5839] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6709-L6712] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6896] int LDV_IN_INTERRUPT ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=0, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L6899] struct net_device *var_group1 ; [L6900] int res_sl_init_14 ; [L6901] int res_sl_open_11 ; [L6902] int res_sl_close_10 ; [L6903] struct sk_buff *var_group2 ; [L6904] struct rtnl_link_stats64 *var_group3 ; [L6905] int var_sl_change_mtu_12_p1 ; [L6906] struct ifreq *var_group4 ; [L6907] int var_sl_ioctl_30_p2 ; [L6908] struct tty_struct *var_group5 ; [L6909] int res_slip_open_21 ; [L6910] struct file *var_group6 ; [L6911] unsigned int var_slip_ioctl_28_p2 ; [L6912] unsigned long var_slip_ioctl_28_p3 ; [L6913] unsigned int var_slip_compat_ioctl_29_p2 ; [L6914] unsigned long var_slip_compat_ioctl_29_p3 ; [L6915] unsigned char const *var_slip_receive_buf_18_p1 ; [L6916] char *var_slip_receive_buf_18_p2 ; [L6917] int var_slip_receive_buf_18_p3 ; [L6918] unsigned long var_sl_keepalive_34_p0 ; [L6919] unsigned long var_sl_outfill_33_p0 ; [L6920] int ldv_s_sl_netdev_ops_net_device_ops ; [L6921] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6922] int tmp ; [L6923] int tmp___0 ; [L6924] int tmp___1 ; [L6926] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6927] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6928] LDV_IN_INTERRUPT = 1 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L6715] int status ; [L6716] void *tmp ; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L6718] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] void *tmp ; [L4848] void *tmp___2 ; [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L4836] return res; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L4843] return ldv_malloc(size); [L4850] tmp___2 = __kmalloc(size, flags) [L4851] return (tmp___2); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L4859] tmp = kmalloc(size, flags | 32768U) [L4860] return (tmp); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={0:0}, slip_maxdev=256] [L6726] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6727] slip_devs = (struct net_device **)tmp VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6728] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7273] return __VERIFIER_nondet_int(); [L6733] status = tty_register_ldisc(1, & sl_ldisc) [L6734] COND FALSE !(status != 0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6739] return (status); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6931] tmp = slip_init() [L6932] COND FALSE !(tmp != 0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L7062] tmp___1 = __VERIFIER_nondet_int() [L7063] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6938] tmp___0 = __VERIFIER_nondet_int() [L6940] case 0: [L6953] case 1: [L6966] case 2: [L6979] case 3: [L6987] case 4: [L6991] case 5: [L6995] case 6: [L6999] case 7: [L7003] case 8: [L7007] case 9: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L7008] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L7103] ldv_func_ret_type___1 ldv_func_res ; [L7104] int tmp ; [L6023] struct slip *sl ; [L6024] int err ; [L6025] int tmp ; [L6026] dev_t tmp___0 ; [L6027] struct task_struct *tmp___1 ; [L6028] int tmp___2 ; [L7158] return __VERIFIER_nondet_int(); [L6030] tmp = capable(12) [L6031] COND FALSE !(tmp == 0) [L6035] EXPR tty->ops [L6035] EXPR (tty->ops)->write VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6035-L6037] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5911] int i ; [L5912] struct net_device *dev ; [L5913] struct slip *sl ; [L5914] void *tmp ; [L5916] i = 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5937] COND TRUE i < slip_maxdev VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5919] EXPR slip_devs + (unsigned long )i [L5919] dev = *(slip_devs + (unsigned long )i) [L5920] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6043] EXPR tty->disc_data [L6043] sl = (struct slip *)tty->disc_data [L6044] err = -17 [L6045] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6045] EXPR sl->magic [L6045] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6045] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6049] err = -23 [L7262] return __VERIFIER_nondet_uint(); [L6050] tmp___0 = tty_devnum(tty) [L5947] int i ; [L5948] struct net_device *dev ; [L5949] struct slip *sl ; [L5950] void *tmp ; [L5951] int tmp___0 ; [L5952] char name[16U] ; [L5953] void *tmp___1 ; [L5954] struct lock_class_key __key ; [L5955] struct lock_class_key __key___0 ; [L5956] struct lock_class_key __key___1 ; [L5958] dev = 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5959] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5963] i = 0 VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5973] COND TRUE i < slip_maxdev VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5966] EXPR slip_devs + (unsigned long )i [L5966] dev = *(slip_devs + (unsigned long )i) [L5967] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5978] COND FALSE !(i >= slip_maxdev) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5982] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L5994] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L4836] return res; VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L7154] return ldv_malloc(sizeof(struct net_device)); [L5996] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L5997] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6001] dev->base_addr = (unsigned long )i VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L4889] return ((void *)dev + 2496U); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6004] tmp___1 = netdev_priv((struct net_device const *)dev) [L6005] sl = (struct slip *)tmp___1 [L6006] sl->magic = 21250 [L6007] sl->dev = dev [L4767] return (& lock->ldv_5934.rlock); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6010] sl->mode = 8U [L6012] sl->keepalive_timer.data = (unsigned long )sl [L6013] sl->keepalive_timer.function = & sl_keepalive [L6015] sl->outfill_timer.data = (unsigned long )sl [L6016] sl->outfill_timer.function = & sl_outfill [L6017] *(slip_devs + (unsigned long )i) = dev [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6051] sl = sl_alloc(tmp___0) [L6052] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6056] sl->tty = tty [L6057] tty->disc_data = (void *)sl [L7262] return __VERIFIER_nondet_uint(); [L6058] sl->line = tty_devnum(tty) [L4735] struct task_struct *pfo_ret__ ; [L4738] case 1UL: [L4741] case 2UL: [L4744] case 4UL: [L4747] case 8UL: VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L4754] return (pfo_ret__); VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6059] tmp___1 = get_current() [L6060] EXPR tmp___1->pid [L6060] sl->pid = tmp___1->pid [L4724] EXPR addr + (unsigned long )(nr / 64U) [L4724] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6061] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6062] COND FALSE !(tmp___2 == 0) VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6076] EXPR sl->keepalive VAL [__this_module={0:0}, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6076] COND TRUE (unsigned int )sl->keepalive != 0U [L6077] EXPR sl->keepalive [L6077] sl->keepalive_timer.expires = (unsigned long )((int )sl->keepalive * 250) + (unsigned long )jiffies [L6081] EXPR sl->outfill VAL [__this_module={0:0}, jiffies=262272, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L6081] COND TRUE (unsigned int )sl->outfill != 0U [L6082] EXPR sl->outfill [L6082] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6087] tty->receive_room = 65536U [L6088] EXPR sl->dev [L6088] EXPR (sl->dev)->base_addr [L6088] return ((int )(sl->dev)->base_addr); [L7106] tmp = slip_open(tty) [L7107] ldv_func_res = tmp [L7121] COND FALSE !(ret_val <= 0) VAL [__this_module={0:0}, jiffies=262272, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] [L7115] __VERIFIER_error() VAL [__this_module={0:0}, jiffies=262272, LDV_IN_INTERRUPT=1, sl_ldisc={-641724406:0}, sl_netdev_ops={-633354636:0}, slip_devs={440387188:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1013 locations, 1 error locations. Result: UNSAFE, OverallTime: 35.2s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 40123 SDtfs, 89618 SDslu, 141499 SDs, 0 SdLazy, 1340 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1950occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 38829 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 155055 SizeOfPredicates, 47 NumberOfNonLiveVariables, 5820 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 0/10 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 proved your program to be incorrect! Received shutdown request...