./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.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_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 5446a6bcb7b41f40bef72cbbdd61d96122ada54f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 5446a6bcb7b41f40bef72cbbdd61d96122ada54f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:26:34,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:26:34,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:26:34,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:26:34,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:26:34,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:26:34,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:26:34,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:26:34,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:26:34,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:26:34,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:26:34,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:26:34,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:26:34,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:26:34,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:26:34,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:26:34,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:26:34,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:26:34,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:26:34,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:26:34,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:26:34,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:26:34,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:26:34,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:26:34,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:26:34,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:26:34,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:26:34,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:26:34,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:26:34,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:26:34,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:26:34,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:26:34,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:26:34,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:26:34,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:26:34,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:26:34,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:26:34,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:26:34,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:26:34,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:26:34,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:26:34,188 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-12-07 18:26:34,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:26:34,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:26:34,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:26:34,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:26:34,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:26:34,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:26:34,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:26:34,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:26:34,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:26:34,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:26:34,201 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_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 -> 5446a6bcb7b41f40bef72cbbdd61d96122ada54f [2019-12-07 18:26:34,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:26:34,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:26:34,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:26:34,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:26:34,310 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:26:34,311 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:26:34,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/22b722ffe/0a3f77fa7baf475ab67e7b7d465263af/FLAG8513e4dc2 [2019-12-07 18:26:34,822 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:26:34,823 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:26:34,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/22b722ffe/0a3f77fa7baf475ab67e7b7d465263af/FLAG8513e4dc2 [2019-12-07 18:26:34,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/22b722ffe/0a3f77fa7baf475ab67e7b7d465263af [2019-12-07 18:26:34,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:26:34,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:26:34,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:26:34,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:26:34,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:26:34,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:26:34" (1/1) ... [2019-12-07 18:26:34,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f98182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:34, skipping insertion in model container [2019-12-07 18:26:34,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:26:34" (1/1) ... [2019-12-07 18:26:34,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:26:34,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:26:35,657 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 18:26:35,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:26:35,686 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:26:35,829 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 18:26:35,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:26:36,011 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:26:36,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36 WrapperNode [2019-12-07 18:26:36,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:26:36,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:26:36,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:26:36,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:26:36,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:26:36,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:26:36,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:26:36,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:26:36,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... [2019-12-07 18:26:36,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:26:36,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:26:36,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:26:36,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:26:36,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:26:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-12-07 18:26:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:26:36,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:26:36,654 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:26:55,909 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2019-12-07 18:26:55,909 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2019-12-07 18:26:55,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:26:55,910 INFO L287 CfgBuilder]: Removed 416 assume(true) statements. [2019-12-07 18:26:55,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:55 BoogieIcfgContainer [2019-12-07 18:26:55,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:26:55,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:26:55,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:26:55,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:26:55,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:26:34" (1/3) ... [2019-12-07 18:26:55,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607eb0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:26:55, skipping insertion in model container [2019-12-07 18:26:55,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:26:36" (2/3) ... [2019-12-07 18:26:55,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607eb0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:26:55, skipping insertion in model container [2019-12-07 18:26:55,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:55" (3/3) ... [2019-12-07 18:26:55,916 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:26:55,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:26:55,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-07 18:26:55,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-12-07 18:26:55,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:26:55,954 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:26:55,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:26:55,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:26:55,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:26:55,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:26:55,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:26:55,955 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:26:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states. [2019-12-07 18:26:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:26:55,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:55,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:55,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1465827731, now seen corresponding path program 1 times [2019-12-07 18:26:55,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:55,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86693163] [2019-12-07 18:26:55,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,263 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 18:26:56,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86693163] [2019-12-07 18:26:56,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:56,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:26:56,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656681447] [2019-12-07 18:26:56,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:56,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:56,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:56,282 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 3 states. [2019-12-07 18:26:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:56,400 INFO L93 Difference]: Finished difference Result 1135 states and 1668 transitions. [2019-12-07 18:26:56,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:56,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 18:26:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:56,415 INFO L225 Difference]: With dead ends: 1135 [2019-12-07 18:26:56,415 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 18:26:56,420 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 18:26:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 18:26:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 711. [2019-12-07 18:26:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-12-07 18:26:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2019-12-07 18:26:56,477 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 10 [2019-12-07 18:26:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:56,477 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2019-12-07 18:26:56,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2019-12-07 18:26:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:26:56,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:56,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:56,478 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1803980421, now seen corresponding path program 1 times [2019-12-07 18:26:56,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934594815] [2019-12-07 18:26:56,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,541 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 18:26:56,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934594815] [2019-12-07 18:26:56,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:56,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:26:56,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25649244] [2019-12-07 18:26:56,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:56,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:56,543 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 3 states. [2019-12-07 18:26:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:56,602 INFO L93 Difference]: Finished difference Result 2109 states and 2742 transitions. [2019-12-07 18:26:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:56,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 18:26:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:56,610 INFO L225 Difference]: With dead ends: 2109 [2019-12-07 18:26:56,610 INFO L226 Difference]: Without dead ends: 1403 [2019-12-07 18:26:56,612 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 18:26:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2019-12-07 18:26:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1374. [2019-12-07 18:26:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-07 18:26:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1795 transitions. [2019-12-07 18:26:56,647 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1795 transitions. Word has length 11 [2019-12-07 18:26:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:56,647 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 1795 transitions. [2019-12-07 18:26:56,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1795 transitions. [2019-12-07 18:26:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:26:56,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:56,649 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 18:26:56,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1767256092, now seen corresponding path program 1 times [2019-12-07 18:26:56,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397017258] [2019-12-07 18:26:56,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,732 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 18:26:56,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397017258] [2019-12-07 18:26:56,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:56,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:56,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375258579] [2019-12-07 18:26:56,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:56,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:56,733 INFO L87 Difference]: Start difference. First operand 1374 states and 1795 transitions. Second operand 3 states. [2019-12-07 18:26:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:56,811 INFO L93 Difference]: Finished difference Result 3748 states and 4944 transitions. [2019-12-07 18:26:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:56,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 18:26:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:56,822 INFO L225 Difference]: With dead ends: 3748 [2019-12-07 18:26:56,822 INFO L226 Difference]: Without dead ends: 2381 [2019-12-07 18:26:56,825 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 18:26:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-12-07 18:26:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2349. [2019-12-07 18:26:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-12-07 18:26:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3121 transitions. [2019-12-07 18:26:56,882 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3121 transitions. Word has length 36 [2019-12-07 18:26:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:56,882 INFO L462 AbstractCegarLoop]: Abstraction has 2349 states and 3121 transitions. [2019-12-07 18:26:56,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3121 transitions. [2019-12-07 18:26:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:26:56,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:56,885 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] [2019-12-07 18:26:56,886 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1213017797, now seen corresponding path program 1 times [2019-12-07 18:26:56,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:56,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378908047] [2019-12-07 18:26:56,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:56,965 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 18:26:56,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378908047] [2019-12-07 18:26:56,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:56,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:56,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246013100] [2019-12-07 18:26:56,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:56,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:56,966 INFO L87 Difference]: Start difference. First operand 2349 states and 3121 transitions. Second operand 4 states. [2019-12-07 18:26:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:57,089 INFO L93 Difference]: Finished difference Result 7015 states and 9313 transitions. [2019-12-07 18:26:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:26:57,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 18:26:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:57,107 INFO L225 Difference]: With dead ends: 7015 [2019-12-07 18:26:57,107 INFO L226 Difference]: Without dead ends: 4674 [2019-12-07 18:26:57,111 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 18:26:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2019-12-07 18:26:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 2365. [2019-12-07 18:26:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2019-12-07 18:26:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3137 transitions. [2019-12-07 18:26:57,184 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3137 transitions. Word has length 39 [2019-12-07 18:26:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:57,185 INFO L462 AbstractCegarLoop]: Abstraction has 2365 states and 3137 transitions. [2019-12-07 18:26:57,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3137 transitions. [2019-12-07 18:26:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:57,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:57,186 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] [2019-12-07 18:26:57,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash -65732313, now seen corresponding path program 1 times [2019-12-07 18:26:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:57,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563869612] [2019-12-07 18:26:57,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,258 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 18:26:57,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563869612] [2019-12-07 18:26:57,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:57,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:57,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526121399] [2019-12-07 18:26:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:57,259 INFO L87 Difference]: Start difference. First operand 2365 states and 3137 transitions. Second operand 4 states. [2019-12-07 18:26:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:57,391 INFO L93 Difference]: Finished difference Result 6427 states and 8521 transitions. [2019-12-07 18:26:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:26:57,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 18:26:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:57,406 INFO L225 Difference]: With dead ends: 6427 [2019-12-07 18:26:57,406 INFO L226 Difference]: Without dead ends: 4070 [2019-12-07 18:26:57,410 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 18:26:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4070 states. [2019-12-07 18:26:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4070 to 2381. [2019-12-07 18:26:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-07 18:26:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3153 transitions. [2019-12-07 18:26:57,484 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3153 transitions. Word has length 40 [2019-12-07 18:26:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:57,485 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 3153 transitions. [2019-12-07 18:26:57,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3153 transitions. [2019-12-07 18:26:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:57,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:57,486 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] [2019-12-07 18:26:57,486 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash 753240742, now seen corresponding path program 1 times [2019-12-07 18:26:57,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:57,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860487965] [2019-12-07 18:26:57,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:57,554 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 18:26:57,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860487965] [2019-12-07 18:26:57,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:57,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:57,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614536269] [2019-12-07 18:26:57,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:57,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:57,555 INFO L87 Difference]: Start difference. First operand 2381 states and 3153 transitions. Second operand 4 states. [2019-12-07 18:26:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:57,813 INFO L93 Difference]: Finished difference Result 8250 states and 10920 transitions. [2019-12-07 18:26:57,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:26:57,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 18:26:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:57,835 INFO L225 Difference]: With dead ends: 8250 [2019-12-07 18:26:57,835 INFO L226 Difference]: Without dead ends: 5877 [2019-12-07 18:26:57,839 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 18:26:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2019-12-07 18:26:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 2135. [2019-12-07 18:26:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-07 18:26:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2815 transitions. [2019-12-07 18:26:57,930 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2815 transitions. Word has length 40 [2019-12-07 18:26:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:57,930 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2815 transitions. [2019-12-07 18:26:57,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2815 transitions. [2019-12-07 18:26:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:57,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:57,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:57,932 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1778989503, now seen corresponding path program 1 times [2019-12-07 18:26:57,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:57,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956844555] [2019-12-07 18:26:57,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:26:58,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956844555] [2019-12-07 18:26:58,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:58,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:58,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047394754] [2019-12-07 18:26:58,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:58,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:58,123 INFO L87 Difference]: Start difference. First operand 2135 states and 2815 transitions. Second operand 4 states. [2019-12-07 18:26:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:58,220 INFO L93 Difference]: Finished difference Result 4264 states and 5623 transitions. [2019-12-07 18:26:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:26:58,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 18:26:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:58,228 INFO L225 Difference]: With dead ends: 4264 [2019-12-07 18:26:58,228 INFO L226 Difference]: Without dead ends: 2135 [2019-12-07 18:26:58,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 18:26:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-12-07 18:26:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2135. [2019-12-07 18:26:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-07 18:26:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2814 transitions. [2019-12-07 18:26:58,302 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2814 transitions. Word has length 40 [2019-12-07 18:26:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:58,302 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2814 transitions. [2019-12-07 18:26:58,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2814 transitions. [2019-12-07 18:26:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:58,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:58,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:58,304 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1671972291, now seen corresponding path program 1 times [2019-12-07 18:26:58,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:58,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413087995] [2019-12-07 18:26:58,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413087995] [2019-12-07 18:26:58,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:58,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:26:58,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108444992] [2019-12-07 18:26:58,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:26:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:26:58,462 INFO L87 Difference]: Start difference. First operand 2135 states and 2814 transitions. Second operand 6 states. [2019-12-07 18:26:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:58,933 INFO L93 Difference]: Finished difference Result 6282 states and 8300 transitions. [2019-12-07 18:26:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:26:58,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:26:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:58,951 INFO L225 Difference]: With dead ends: 6282 [2019-12-07 18:26:58,951 INFO L226 Difference]: Without dead ends: 5056 [2019-12-07 18:26:58,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:26:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2019-12-07 18:26:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 2135. [2019-12-07 18:26:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-07 18:26:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2810 transitions. [2019-12-07 18:26:59,063 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2810 transitions. Word has length 40 [2019-12-07 18:26:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:59,063 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2810 transitions. [2019-12-07 18:26:59,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:26:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2810 transitions. [2019-12-07 18:26:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:59,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:59,064 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] [2019-12-07 18:26:59,064 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1101882010, now seen corresponding path program 1 times [2019-12-07 18:26:59,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:59,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82673052] [2019-12-07 18:26:59,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,137 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 18:26:59,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82673052] [2019-12-07 18:26:59,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:59,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:26:59,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713391135] [2019-12-07 18:26:59,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:26:59,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:26:59,139 INFO L87 Difference]: Start difference. First operand 2135 states and 2810 transitions. Second operand 6 states. [2019-12-07 18:26:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:59,617 INFO L93 Difference]: Finished difference Result 5819 states and 7651 transitions. [2019-12-07 18:26:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:26:59,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:26:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:59,627 INFO L225 Difference]: With dead ends: 5819 [2019-12-07 18:26:59,627 INFO L226 Difference]: Without dead ends: 5190 [2019-12-07 18:26:59,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:26:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-07 18:26:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 2139. [2019-12-07 18:26:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-12-07 18:26:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2814 transitions. [2019-12-07 18:26:59,742 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2814 transitions. Word has length 40 [2019-12-07 18:26:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:59,742 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 2814 transitions. [2019-12-07 18:26:59,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:26:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2814 transitions. [2019-12-07 18:26:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:26:59,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:59,743 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] [2019-12-07 18:26:59,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash -292535384, now seen corresponding path program 1 times [2019-12-07 18:26:59,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:59,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405268950] [2019-12-07 18:26:59,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:59,820 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 18:26:59,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405268950] [2019-12-07 18:26:59,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:59,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:59,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887484015] [2019-12-07 18:26:59,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:59,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:59,821 INFO L87 Difference]: Start difference. First operand 2139 states and 2814 transitions. Second operand 4 states. [2019-12-07 18:27:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:00,179 INFO L93 Difference]: Finished difference Result 3360 states and 4420 transitions. [2019-12-07 18:27:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:27:00,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 18:27:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:00,184 INFO L225 Difference]: With dead ends: 3360 [2019-12-07 18:27:00,184 INFO L226 Difference]: Without dead ends: 3345 [2019-12-07 18:27:00,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2019-12-07 18:27:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3317. [2019-12-07 18:27:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2019-12-07 18:27:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4372 transitions. [2019-12-07 18:27:00,340 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4372 transitions. Word has length 40 [2019-12-07 18:27:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:00,340 INFO L462 AbstractCegarLoop]: Abstraction has 3317 states and 4372 transitions. [2019-12-07 18:27:00,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4372 transitions. [2019-12-07 18:27:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:27:00,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:00,341 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] [2019-12-07 18:27:00,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1795406353, now seen corresponding path program 1 times [2019-12-07 18:27:00,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:00,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814853184] [2019-12-07 18:27:00,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:00,404 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 18:27:00,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814853184] [2019-12-07 18:27:00,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:00,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:27:00,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052090574] [2019-12-07 18:27:00,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:00,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:00,405 INFO L87 Difference]: Start difference. First operand 3317 states and 4372 transitions. Second operand 4 states. [2019-12-07 18:27:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:00,900 INFO L93 Difference]: Finished difference Result 12602 states and 16488 transitions. [2019-12-07 18:27:00,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:00,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 18:27:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:00,913 INFO L225 Difference]: With dead ends: 12602 [2019-12-07 18:27:00,913 INFO L226 Difference]: Without dead ends: 9293 [2019-12-07 18:27:00,920 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 18:27:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2019-12-07 18:27:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 3341. [2019-12-07 18:27:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3341 states. [2019-12-07 18:27:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 4396 transitions. [2019-12-07 18:27:01,116 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 4396 transitions. Word has length 45 [2019-12-07 18:27:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:01,116 INFO L462 AbstractCegarLoop]: Abstraction has 3341 states and 4396 transitions. [2019-12-07 18:27:01,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 4396 transitions. [2019-12-07 18:27:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:27:01,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:01,117 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 18:27:01,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 185160005, now seen corresponding path program 1 times [2019-12-07 18:27:01,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:01,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687698716] [2019-12-07 18:27:01,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:01,185 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 18:27:01,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687698716] [2019-12-07 18:27:01,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:01,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:27:01,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324868736] [2019-12-07 18:27:01,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:27:01,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:27:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:27:01,187 INFO L87 Difference]: Start difference. First operand 3341 states and 4396 transitions. Second operand 6 states. [2019-12-07 18:27:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:01,886 INFO L93 Difference]: Finished difference Result 10916 states and 14396 transitions. [2019-12-07 18:27:01,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:27:01,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 18:27:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:01,899 INFO L225 Difference]: With dead ends: 10916 [2019-12-07 18:27:01,899 INFO L226 Difference]: Without dead ends: 8492 [2019-12-07 18:27:01,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:27:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-12-07 18:27:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 3357. [2019-12-07 18:27:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2019-12-07 18:27:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4412 transitions. [2019-12-07 18:27:02,117 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4412 transitions. Word has length 46 [2019-12-07 18:27:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:02,117 INFO L462 AbstractCegarLoop]: Abstraction has 3357 states and 4412 transitions. [2019-12-07 18:27:02,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:27:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4412 transitions. [2019-12-07 18:27:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:27:02,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:02,118 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] [2019-12-07 18:27:02,118 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash -115675543, now seen corresponding path program 1 times [2019-12-07 18:27:02,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:02,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218843377] [2019-12-07 18:27:02,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:02,178 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 18:27:02,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218843377] [2019-12-07 18:27:02,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:02,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:27:02,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011651936] [2019-12-07 18:27:02,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:02,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:02,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:02,180 INFO L87 Difference]: Start difference. First operand 3357 states and 4412 transitions. Second operand 4 states. [2019-12-07 18:27:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:02,801 INFO L93 Difference]: Finished difference Result 10813 states and 14215 transitions. [2019-12-07 18:27:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:02,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 18:27:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:02,809 INFO L225 Difference]: With dead ends: 10813 [2019-12-07 18:27:02,809 INFO L226 Difference]: Without dead ends: 7464 [2019-12-07 18:27:02,813 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 18:27:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-12-07 18:27:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 2845. [2019-12-07 18:27:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-12-07 18:27:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3729 transitions. [2019-12-07 18:27:03,038 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3729 transitions. Word has length 47 [2019-12-07 18:27:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:03,038 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 3729 transitions. [2019-12-07 18:27:03,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3729 transitions. [2019-12-07 18:27:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:27:03,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:03,039 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] [2019-12-07 18:27:03,039 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:03,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1842249347, now seen corresponding path program 1 times [2019-12-07 18:27:03,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:03,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788218278] [2019-12-07 18:27:03,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:03,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788218278] [2019-12-07 18:27:03,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:03,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:27:03,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823691344] [2019-12-07 18:27:03,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:27:03,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:27:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:27:03,097 INFO L87 Difference]: Start difference. First operand 2845 states and 3729 transitions. Second operand 3 states. [2019-12-07 18:27:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:03,464 INFO L93 Difference]: Finished difference Result 7415 states and 9732 transitions. [2019-12-07 18:27:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:27:03,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 18:27:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:03,469 INFO L225 Difference]: With dead ends: 7415 [2019-12-07 18:27:03,469 INFO L226 Difference]: Without dead ends: 4975 [2019-12-07 18:27:03,472 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 18:27:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4975 states. [2019-12-07 18:27:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4975 to 2861. [2019-12-07 18:27:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2019-12-07 18:27:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3745 transitions. [2019-12-07 18:27:03,678 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3745 transitions. Word has length 48 [2019-12-07 18:27:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:03,679 INFO L462 AbstractCegarLoop]: Abstraction has 2861 states and 3745 transitions. [2019-12-07 18:27:03,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:27:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3745 transitions. [2019-12-07 18:27:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:27:03,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:03,680 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:03,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1283816922, now seen corresponding path program 1 times [2019-12-07 18:27:03,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:03,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385540728] [2019-12-07 18:27:03,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:03,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385540728] [2019-12-07 18:27:03,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:03,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:27:03,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681638392] [2019-12-07 18:27:03,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:27:03,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:27:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:27:03,764 INFO L87 Difference]: Start difference. First operand 2861 states and 3745 transitions. Second operand 7 states. [2019-12-07 18:27:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:05,101 INFO L93 Difference]: Finished difference Result 13518 states and 17851 transitions. [2019-12-07 18:27:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:27:05,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 18:27:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:05,109 INFO L225 Difference]: With dead ends: 13518 [2019-12-07 18:27:05,109 INFO L226 Difference]: Without dead ends: 11062 [2019-12-07 18:27:05,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:27:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11062 states. [2019-12-07 18:27:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11062 to 2857. [2019-12-07 18:27:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2019-12-07 18:27:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3725 transitions. [2019-12-07 18:27:05,354 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3725 transitions. Word has length 49 [2019-12-07 18:27:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:05,354 INFO L462 AbstractCegarLoop]: Abstraction has 2857 states and 3725 transitions. [2019-12-07 18:27:05,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:27:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3725 transitions. [2019-12-07 18:27:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:27:05,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:05,355 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:05,356 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 663634229, now seen corresponding path program 1 times [2019-12-07 18:27:05,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:05,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36467063] [2019-12-07 18:27:05,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:05,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36467063] [2019-12-07 18:27:05,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:05,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:27:05,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018309373] [2019-12-07 18:27:05,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:05,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:05,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:05,403 INFO L87 Difference]: Start difference. First operand 2857 states and 3725 transitions. Second operand 4 states. [2019-12-07 18:27:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:05,729 INFO L93 Difference]: Finished difference Result 5734 states and 7472 transitions. [2019-12-07 18:27:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:05,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:27:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:05,731 INFO L225 Difference]: With dead ends: 5734 [2019-12-07 18:27:05,731 INFO L226 Difference]: Without dead ends: 2883 [2019-12-07 18:27:05,734 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 18:27:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-12-07 18:27:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2861. [2019-12-07 18:27:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2019-12-07 18:27:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3728 transitions. [2019-12-07 18:27:05,947 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3728 transitions. Word has length 49 [2019-12-07 18:27:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:05,947 INFO L462 AbstractCegarLoop]: Abstraction has 2861 states and 3728 transitions. [2019-12-07 18:27:05,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3728 transitions. [2019-12-07 18:27:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:27:05,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:05,948 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] [2019-12-07 18:27:05,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2080942146, now seen corresponding path program 1 times [2019-12-07 18:27:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:05,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952089939] [2019-12-07 18:27:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,013 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 18:27:06,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952089939] [2019-12-07 18:27:06,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:06,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:27:06,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54679292] [2019-12-07 18:27:06,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:06,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:06,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:06,014 INFO L87 Difference]: Start difference. First operand 2861 states and 3728 transitions. Second operand 4 states. [2019-12-07 18:27:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:06,479 INFO L93 Difference]: Finished difference Result 4133 states and 5364 transitions. [2019-12-07 18:27:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:27:06,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:27:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:06,483 INFO L225 Difference]: With dead ends: 4133 [2019-12-07 18:27:06,483 INFO L226 Difference]: Without dead ends: 4127 [2019-12-07 18:27:06,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-12-07 18:27:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4075. [2019-12-07 18:27:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4075 states. [2019-12-07 18:27:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 5314 transitions. [2019-12-07 18:27:06,796 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 5314 transitions. Word has length 50 [2019-12-07 18:27:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:06,796 INFO L462 AbstractCegarLoop]: Abstraction has 4075 states and 5314 transitions. [2019-12-07 18:27:06,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 5314 transitions. [2019-12-07 18:27:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:27:06,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:06,797 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] [2019-12-07 18:27:06,797 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -219880444, now seen corresponding path program 1 times [2019-12-07 18:27:06,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:06,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208848202] [2019-12-07 18:27:06,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:06,848 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 18:27:06,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208848202] [2019-12-07 18:27:06,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:06,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:27:06,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065000584] [2019-12-07 18:27:06,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:06,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:06,849 INFO L87 Difference]: Start difference. First operand 4075 states and 5314 transitions. Second operand 4 states. [2019-12-07 18:27:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:07,716 INFO L93 Difference]: Finished difference Result 12379 states and 16183 transitions. [2019-12-07 18:27:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:07,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:27:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:07,723 INFO L225 Difference]: With dead ends: 12379 [2019-12-07 18:27:07,723 INFO L226 Difference]: Without dead ends: 8709 [2019-12-07 18:27:07,727 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 18:27:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2019-12-07 18:27:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 3853. [2019-12-07 18:27:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-12-07 18:27:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5010 transitions. [2019-12-07 18:27:08,068 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5010 transitions. Word has length 50 [2019-12-07 18:27:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:08,068 INFO L462 AbstractCegarLoop]: Abstraction has 3853 states and 5010 transitions. [2019-12-07 18:27:08,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5010 transitions. [2019-12-07 18:27:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:27:08,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:08,069 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:08,069 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1887324469, now seen corresponding path program 1 times [2019-12-07 18:27:08,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:08,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883712370] [2019-12-07 18:27:08,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:27:08,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883712370] [2019-12-07 18:27:08,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:08,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:27:08,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854656714] [2019-12-07 18:27:08,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:08,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:08,206 INFO L87 Difference]: Start difference. First operand 3853 states and 5010 transitions. Second operand 4 states. [2019-12-07 18:27:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:09,124 INFO L93 Difference]: Finished difference Result 10040 states and 13101 transitions. [2019-12-07 18:27:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:27:09,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 18:27:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:09,130 INFO L225 Difference]: With dead ends: 10040 [2019-12-07 18:27:09,130 INFO L226 Difference]: Without dead ends: 8278 [2019-12-07 18:27:09,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2019-12-07 18:27:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 8141. [2019-12-07 18:27:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8141 states. [2019-12-07 18:27:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8141 states to 8141 states and 10617 transitions. [2019-12-07 18:27:09,900 INFO L78 Accepts]: Start accepts. Automaton has 8141 states and 10617 transitions. Word has length 51 [2019-12-07 18:27:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:09,900 INFO L462 AbstractCegarLoop]: Abstraction has 8141 states and 10617 transitions. [2019-12-07 18:27:09,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8141 states and 10617 transitions. [2019-12-07 18:27:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 18:27:09,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:09,901 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] [2019-12-07 18:27:09,901 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1762719395, now seen corresponding path program 1 times [2019-12-07 18:27:09,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:09,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661864484] [2019-12-07 18:27:09,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:09,945 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 18:27:09,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661864484] [2019-12-07 18:27:09,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:27:09,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969293895] [2019-12-07 18:27:09,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:27:09,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:27:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:27:09,946 INFO L87 Difference]: Start difference. First operand 8141 states and 10617 transitions. Second operand 3 states. [2019-12-07 18:27:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:10,718 INFO L93 Difference]: Finished difference Result 16322 states and 21290 transitions. [2019-12-07 18:27:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:27:10,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 18:27:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:10,725 INFO L225 Difference]: With dead ends: 16322 [2019-12-07 18:27:10,725 INFO L226 Difference]: Without dead ends: 8189 [2019-12-07 18:27:10,731 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 18:27:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2019-12-07 18:27:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 8173. [2019-12-07 18:27:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8173 states. [2019-12-07 18:27:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 10649 transitions. [2019-12-07 18:27:11,516 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 10649 transitions. Word has length 54 [2019-12-07 18:27:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:11,517 INFO L462 AbstractCegarLoop]: Abstraction has 8173 states and 10649 transitions. [2019-12-07 18:27:11,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:27:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 10649 transitions. [2019-12-07 18:27:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:27:11,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:11,518 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] [2019-12-07 18:27:11,518 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1229027600, now seen corresponding path program 1 times [2019-12-07 18:27:11,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:11,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896811469] [2019-12-07 18:27:11,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:11,579 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 18:27:11,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896811469] [2019-12-07 18:27:11,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:11,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:27:11,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917465152] [2019-12-07 18:27:11,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:27:11,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:27:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:27:11,580 INFO L87 Difference]: Start difference. First operand 8173 states and 10649 transitions. Second operand 4 states. [2019-12-07 18:27:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:13,912 INFO L93 Difference]: Finished difference Result 28812 states and 37487 transitions. [2019-12-07 18:27:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:13,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 18:27:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:13,929 INFO L225 Difference]: With dead ends: 28812 [2019-12-07 18:27:13,929 INFO L226 Difference]: Without dead ends: 21982 [2019-12-07 18:27:13,936 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 18:27:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21982 states. [2019-12-07 18:27:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21982 to 8048. [2019-12-07 18:27:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8048 states. [2019-12-07 18:27:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 10482 transitions. [2019-12-07 18:27:14,782 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 10482 transitions. Word has length 55 [2019-12-07 18:27:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:14,782 INFO L462 AbstractCegarLoop]: Abstraction has 8048 states and 10482 transitions. [2019-12-07 18:27:14,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:27:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 10482 transitions. [2019-12-07 18:27:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:27:14,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:14,783 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] [2019-12-07 18:27:14,783 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -987110372, now seen corresponding path program 1 times [2019-12-07 18:27:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607044891] [2019-12-07 18:27:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:14,870 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 18:27:14,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607044891] [2019-12-07 18:27:14,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:14,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:27:14,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215326264] [2019-12-07 18:27:14,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:27:14,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:27:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:27:14,871 INFO L87 Difference]: Start difference. First operand 8048 states and 10482 transitions. Second operand 8 states. [2019-12-07 18:27:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:18,702 INFO L93 Difference]: Finished difference Result 36280 states and 47269 transitions. [2019-12-07 18:27:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:27:18,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-07 18:27:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:18,726 INFO L225 Difference]: With dead ends: 36280 [2019-12-07 18:27:18,726 INFO L226 Difference]: Without dead ends: 29172 [2019-12-07 18:27:18,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:27:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29172 states. [2019-12-07 18:27:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29172 to 8000. [2019-12-07 18:27:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2019-12-07 18:27:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 10398 transitions. [2019-12-07 18:27:19,688 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 10398 transitions. Word has length 56 [2019-12-07 18:27:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:19,688 INFO L462 AbstractCegarLoop]: Abstraction has 8000 states and 10398 transitions. [2019-12-07 18:27:19,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:27:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 10398 transitions. [2019-12-07 18:27:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:27:19,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:19,689 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:19,689 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -781521097, now seen corresponding path program 1 times [2019-12-07 18:27:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26318591] [2019-12-07 18:27:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:19,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26318591] [2019-12-07 18:27:19,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306278694] [2019-12-07 18:27:19,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:19,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:27:19,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:20,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 18:27:20,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697849581] [2019-12-07 18:27:20,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:27:20,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:27:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:27:20,015 INFO L87 Difference]: Start difference. First operand 8000 states and 10398 transitions. Second operand 5 states. [2019-12-07 18:27:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:21,027 INFO L93 Difference]: Finished difference Result 16056 states and 20868 transitions. [2019-12-07 18:27:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:27:21,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 18:27:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:21,045 INFO L225 Difference]: With dead ends: 16056 [2019-12-07 18:27:21,045 INFO L226 Difference]: Without dead ends: 8064 [2019-12-07 18:27:21,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:27:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2019-12-07 18:27:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 8048. [2019-12-07 18:27:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8048 states. [2019-12-07 18:27:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 10446 transitions. [2019-12-07 18:27:21,983 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 10446 transitions. Word has length 57 [2019-12-07 18:27:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:21,983 INFO L462 AbstractCegarLoop]: Abstraction has 8048 states and 10446 transitions. [2019-12-07 18:27:21,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:27:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 10446 transitions. [2019-12-07 18:27:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:27:21,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:21,984 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:22,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:22,186 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 440334967, now seen corresponding path program 1 times [2019-12-07 18:27:22,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:22,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348811372] [2019-12-07 18:27:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:22,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348811372] [2019-12-07 18:27:22,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:22,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:27:22,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070694965] [2019-12-07 18:27:22,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:27:22,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:27:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:27:22,341 INFO L87 Difference]: Start difference. First operand 8048 states and 10446 transitions. Second operand 8 states. [2019-12-07 18:27:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:26,267 INFO L93 Difference]: Finished difference Result 29869 states and 38809 transitions. [2019-12-07 18:27:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:27:26,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 18:27:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:26,290 INFO L225 Difference]: With dead ends: 29869 [2019-12-07 18:27:26,290 INFO L226 Difference]: Without dead ends: 24909 [2019-12-07 18:27:26,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:27:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2019-12-07 18:27:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 8022. [2019-12-07 18:27:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8022 states. [2019-12-07 18:27:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8022 states to 8022 states and 10388 transitions. [2019-12-07 18:27:27,398 INFO L78 Accepts]: Start accepts. Automaton has 8022 states and 10388 transitions. Word has length 58 [2019-12-07 18:27:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:27,398 INFO L462 AbstractCegarLoop]: Abstraction has 8022 states and 10388 transitions. [2019-12-07 18:27:27,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:27:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8022 states and 10388 transitions. [2019-12-07 18:27:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:27:27,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:27,399 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 18:27:27,399 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2064056081, now seen corresponding path program 1 times [2019-12-07 18:27:27,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:27,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960889925] [2019-12-07 18:27:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:27,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 18:27:27,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960889925] [2019-12-07 18:27:27,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:27,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:27:27,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317586388] [2019-12-07 18:27:27,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:27:27,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:27:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:27:27,461 INFO L87 Difference]: Start difference. First operand 8022 states and 10388 transitions. Second operand 6 states. [2019-12-07 18:27:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:30,128 INFO L93 Difference]: Finished difference Result 21515 states and 27957 transitions. [2019-12-07 18:27:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:27:30,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 18:27:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:30,142 INFO L225 Difference]: With dead ends: 21515 [2019-12-07 18:27:30,142 INFO L226 Difference]: Without dead ends: 18175 [2019-12-07 18:27:30,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:27:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18175 states. [2019-12-07 18:27:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18175 to 8022. [2019-12-07 18:27:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8022 states. [2019-12-07 18:27:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8022 states to 8022 states and 10374 transitions. [2019-12-07 18:27:31,197 INFO L78 Accepts]: Start accepts. Automaton has 8022 states and 10374 transitions. Word has length 59 [2019-12-07 18:27:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 8022 states and 10374 transitions. [2019-12-07 18:27:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:27:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 8022 states and 10374 transitions. [2019-12-07 18:27:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 18:27:31,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:31,198 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:31,199 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -178533166, now seen corresponding path program 1 times [2019-12-07 18:27:31,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:31,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621105306] [2019-12-07 18:27:31,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:31,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:27:31,526 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:27:31,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:27:31 BoogieIcfgContainer [2019-12-07 18:27:31,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:27:31,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:27:31,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:27:31,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:27:31,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:26:55" (3/4) ... [2019-12-07 18:27:31,666 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:27:31,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:27:31,668 INFO L168 Benchmark]: Toolchain (without parser) took 56810.24 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 923.2 MB in the beginning and 1.9 GB in the end (delta: -952.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,668 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:31,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 923.2 MB in the beginning and 890.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.03 ms. Allocated memory is still 1.2 GB. Free memory was 890.6 MB in the beginning and 874.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,669 INFO L168 Benchmark]: Boogie Preprocessor took 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 874.5 MB in the beginning and 858.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,669 INFO L168 Benchmark]: RCFGBuilder took 19623.60 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 858.4 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,669 INFO L168 Benchmark]: TraceAbstraction took 35751.34 ms. Allocated memory was 2.6 GB in the beginning and 3.4 GB in the end (delta: 855.6 MB). Free memory was 2.5 GB in the beginning and 1.9 GB in the end (delta: 579.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 18:27:31,669 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 3.4 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:31,671 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 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1154.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 923.2 MB in the beginning and 890.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.03 ms. Allocated memory is still 1.2 GB. Free memory was 890.6 MB in the beginning and 874.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 874.5 MB in the beginning and 858.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 19623.60 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 858.4 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * TraceAbstraction took 35751.34 ms. Allocated memory was 2.6 GB in the beginning and 3.4 GB in the end (delta: 855.6 MB). Free memory was 2.5 GB in the beginning and 1.9 GB in the end (delta: 579.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 3.4 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6743]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 5132, overapproximation of bitwiseAnd at line 6093. Possible FailurePath: [L5138] static struct lock_class_key __key___7 ; [L5139] static struct lock_class_key __key___8 ; [L5279-L5292] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5293-L5312] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5313-L5318] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5319-L5321] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6236-L6276] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6277-L6281] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6532-L6550] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6603] int LDV_IN_INTERRUPT ; [L6604] static int res_ems_usb_open_10 ; [L6605] static int res_ems_usb_close_12 ; [L6606] static int res_ems_usb_probe_16 ; [L6756] int ldv_urb_state = 0; [L6757] int ldv_coherent_state = 0; VAL [__key___7={130:0}, __key___8={123:0}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6608] struct net_device *var_group1 ; [L6609] struct sk_buff *var_group2 ; [L6610] struct usb_interface *var_group3 ; [L6611] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6612] int tmp___7 ; [L6613] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6614] int ldv_s_ems_usb_driver_usb_driver ; [L6615] int tmp___8 ; [L6616] int tmp___9 ; [L6619] LDV_IN_INTERRUPT = 1 VAL [__key___7={130:0}, __key___8={123:0}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6554] int err ; [L5129] int tmp___7 ; [L5132] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7007] return __VERIFIER_nondet_int(); [L5132] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5134] return (tmp___7); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6558] err = usb_register(& ems_usb_driver) [L6560] COND FALSE !(\read(err)) [L6567] return (0); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6621] tmp___7 = ems_usb_init() [L6623] COND FALSE !(\read(tmp___7)) [L6627] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6628] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND TRUE \read(tmp___9) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___8 = __VERIFIER_nondet_int() [L6646] COND FALSE !(tmp___8 == 0) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6649] COND FALSE !(tmp___8 == 1) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6652] COND TRUE tmp___8 == 2 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6037] struct ems_usb *dev ; [L6038] void *tmp___7 ; [L6039] struct ems_tx_urb_context *context ; [L6040] struct net_device_stats *stats ; [L6041] struct can_frame *cf ; [L6042] struct ems_cpc_msg *msg ; [L6043] struct urb *urb ; [L6044] u8 *buf ; [L6045] int i ; [L6046] int err ; [L6047] size_t size ; [L6048] int tmp___8 ; [L6049] void *tmp___9 ; [L6050] unsigned int tmp___10 ; [L6051] int tmp___11 ; [L6052] long tmp___12 ; [L4965] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6055] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6056] dev = (struct ems_usb *)tmp___7 [L6057] context = (struct ems_tx_urb_context *)((void *)0) [L6058] stats = & netdev->stats [L6059] EXPR skb->data [L6059] cf = (struct can_frame *)skb->data [L6060] size = 15UL + sizeof(struct cpc_can_msg ) [L5241] struct can_frame const *cf ; [L5242] int tmp___7 ; [L5243] long tmp___8 ; [L5245] EXPR skb->data [L5245] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5246] EXPR skb->len VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5246] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5249] EXPR cf->can_dlc VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5249] COND FALSE !((int const )cf->can_dlc > 8) [L5252] tmp___7 = 0 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5255] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !(\read(tmp___8)) [L5265] return (0); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6061] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6063] COND FALSE !(\read(tmp___8)) [L6819] void *arbitrary_memory ; [L6820] void *tmp___7 ; VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6823] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6826] tmp___7 = ldv_undefined_pointer() [L6827] arbitrary_memory = tmp___7 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6829] COND FALSE !(! arbitrary_memory) [L6833] ldv_urb_state = ldv_urb_state + 1 [L6834] return ((struct urb *)arbitrary_memory); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6068] urb = usb_alloc_urb(0, 32U) [L6070] COND FALSE !(! urb) [L6078] EXPR dev->udev [L6762] void *arbitrary_memory ; [L6763] void *tmp___7 ; VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6766] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6769] tmp___7 = ldv_undefined_pointer() [L6770] arbitrary_memory = tmp___7 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6772] COND FALSE !(! arbitrary_memory) [L6776] ldv_coherent_state = ldv_coherent_state + 1 [L6777] return (arbitrary_memory); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6078] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6079] buf = (u8 *)tmp___9 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6081] COND FALSE !(! buf) [L6089] msg = (struct ems_cpc_msg *)(buf + 4) [L6090] EXPR cf->can_id [L6090] msg->msg.can_msg.id = cf->can_id & 536870911U [L6091] EXPR cf->can_dlc [L6091] msg->msg.can_msg.length = cf->can_dlc [L6092] EXPR cf->can_id VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND TRUE cf->can_id & 1073741824U [L6093] EXPR cf->can_id VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6093] COND TRUE cf->can_id & 2147483648U [L6094] msg->type = (u8 )16 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6098] msg->length = (u8 )5 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6121] EXPR msg->msg.can_msg.id [L6121] msg->msg.can_msg.id = msg->msg.can_msg.id [L6122] i = 0 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6124] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6126] COND TRUE i < 10 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6130] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6130] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6131] context = & dev->tx_contexts[i] VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6140] COND TRUE ! context [L6143] dev->udev [L6143] urb->transfer_dma [L6791] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6793] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6799] COND TRUE \read(*addr) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6800] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6806] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6144] netdev->dev.parent [L6146] return ((netdev_tx_t )16); VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND FALSE !(\read(tmp___9)) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6637] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6639] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6878] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6743] __VERIFIER_error() VAL [__key___7={130:0}, __key___8={123:0}, __this_module={4294967321:4294967310}, ems_usb_bittiming_const={73:0}, ems_usb_driver={129:0}, ems_usb_netdev_ops={139:0}, ems_usb_table={138:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 392 locations, 11 error locations. Result: UNSAFE, OverallTime: 35.5s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 23652 SDtfs, 31756 SDslu, 42304 SDs, 0 SdLazy, 1436 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8173occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 107089 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 89165 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1078 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 23/27 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 18:27:33,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:27:33,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:27:33,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:27:33,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:27:33,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:27:33,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:27:33,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:27:33,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:27:33,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:27:33,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:27:33,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:27:33,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:27:33,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:27:33,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:27:33,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:27:33,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:27:33,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:27:33,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:27:33,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:27:33,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:27:33,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:27:33,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:27:33,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:27:33,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:27:33,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:27:33,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:27:33,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:27:33,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:27:33,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:27:33,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:27:33,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:27:33,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:27:33,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:27:33,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:27:33,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:27:33,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:27:33,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:27:33,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:27:33,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:27:33,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:27:33,157 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-12-07 18:27:33,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:27:33,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:27:33,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:27:33,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:27:33,169 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:27:33,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:27:33,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:27:33,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:27:33,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:27:33,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:27:33,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:27:33,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:27:33,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:27:33,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:27:33,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:27:33,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:27:33,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:27:33,172 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-07 18:27:33,172 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_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 -> 5446a6bcb7b41f40bef72cbbdd61d96122ada54f [2019-12-07 18:27:33,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:27:33,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:27:33,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:27:33,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:27:33,353 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:27:33,354 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:27:33,394 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/32cb0e538/0ede9908e65847ce99ce903abed2e47e/FLAG738bf1458 [2019-12-07 18:27:33,918 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:27:33,919 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:27:33,939 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/32cb0e538/0ede9908e65847ce99ce903abed2e47e/FLAG738bf1458 [2019-12-07 18:27:34,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/data/32cb0e538/0ede9908e65847ce99ce903abed2e47e [2019-12-07 18:27:34,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:27:34,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:27:34,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:27:34,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:27:34,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:27:34,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5258ce92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34, skipping insertion in model container [2019-12-07 18:27:34,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:27:34,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:27:35,232 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 18:27:35,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:27:35,265 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:27:35,446 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 18:27:35,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:27:35,668 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:27:35,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35 WrapperNode [2019-12-07 18:27:35,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:27:35,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:27:35,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:27:35,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:27:35,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:27:35,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:27:35,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:27:35,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:27:35,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... [2019-12-07 18:27:35,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:27:35,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:27:35,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:27:35,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:27:35,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:27:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 18:27:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-07 18:27:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:27:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2019-12-07 18:27:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:27:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-12-07 18:27:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 18:27:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-12-07 18:27:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2019-12-07 18:27:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:27:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:27:36,247 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:28:07,148 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2019-12-07 18:28:07,148 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2019-12-07 18:28:07,149 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:28:07,149 INFO L287 CfgBuilder]: Removed 416 assume(true) statements. [2019-12-07 18:28:07,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:07 BoogieIcfgContainer [2019-12-07 18:28:07,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:28:07,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:28:07,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:28:07,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:28:07,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:27:34" (1/3) ... [2019-12-07 18:28:07,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fadfbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:28:07, skipping insertion in model container [2019-12-07 18:28:07,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:35" (2/3) ... [2019-12-07 18:28:07,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fadfbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:28:07, skipping insertion in model container [2019-12-07 18:28:07,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:07" (3/3) ... [2019-12-07 18:28:07,155 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-07 18:28:07,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:28:07,167 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-07 18:28:07,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-12-07 18:28:07,192 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:28:07,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:28:07,193 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:28:07,193 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:28:07,193 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:28:07,193 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:28:07,193 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:28:07,193 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:28:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states. [2019-12-07 18:28:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:28:07,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:07,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:07,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1465827731, now seen corresponding path program 1 times [2019-12-07 18:28:07,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:07,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114893603] [2019-12-07 18:28:07,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:07,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:28:07,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:07,609 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 18:28:07,610 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:07,612 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 18:28:07,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114893603] [2019-12-07 18:28:07,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:07,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:28:07,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561305968] [2019-12-07 18:28:07,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:07,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:07,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:07,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:07,628 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 3 states. [2019-12-07 18:28:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:07,765 INFO L93 Difference]: Finished difference Result 1135 states and 1668 transitions. [2019-12-07 18:28:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:07,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 18:28:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:07,781 INFO L225 Difference]: With dead ends: 1135 [2019-12-07 18:28:07,781 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 18:28:07,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 18:28:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 18:28:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 711. [2019-12-07 18:28:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-12-07 18:28:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2019-12-07 18:28:07,847 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 10 [2019-12-07 18:28:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:07,848 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2019-12-07 18:28:07,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2019-12-07 18:28:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:28:07,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:07,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:08,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:28:08,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1803980421, now seen corresponding path program 1 times [2019-12-07 18:28:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:08,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100137357] [2019-12-07 18:28:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:08,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:28:08,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:08,607 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 18:28:08,607 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:08,608 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 18:28:08,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100137357] [2019-12-07 18:28:08,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:08,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:28:08,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040464630] [2019-12-07 18:28:08,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:08,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:08,610 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 3 states. [2019-12-07 18:28:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:08,682 INFO L93 Difference]: Finished difference Result 2109 states and 2742 transitions. [2019-12-07 18:28:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:08,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 18:28:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:08,689 INFO L225 Difference]: With dead ends: 2109 [2019-12-07 18:28:08,689 INFO L226 Difference]: Without dead ends: 1403 [2019-12-07 18:28:08,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 18:28:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2019-12-07 18:28:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1374. [2019-12-07 18:28:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-07 18:28:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1795 transitions. [2019-12-07 18:28:08,731 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1795 transitions. Word has length 11 [2019-12-07 18:28:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:08,731 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 1795 transitions. [2019-12-07 18:28:08,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1795 transitions. [2019-12-07 18:28:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:28:08,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:08,734 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 18:28:08,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:28:08,936 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1767256092, now seen corresponding path program 1 times [2019-12-07 18:28:08,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:08,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240925158] [2019-12-07 18:28:08,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:09,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:28:09,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:09,334 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 18:28:09,334 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:09,337 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 18:28:09,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240925158] [2019-12-07 18:28:09,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:09,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:28:09,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069739592] [2019-12-07 18:28:09,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:09,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:09,339 INFO L87 Difference]: Start difference. First operand 1374 states and 1795 transitions. Second operand 4 states. [2019-12-07 18:28:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:09,393 INFO L93 Difference]: Finished difference Result 2742 states and 3583 transitions. [2019-12-07 18:28:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:09,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 18:28:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:09,398 INFO L225 Difference]: With dead ends: 2742 [2019-12-07 18:28:09,399 INFO L226 Difference]: Without dead ends: 1374 [2019-12-07 18:28:09,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 18:28:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-12-07 18:28:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2019-12-07 18:28:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-07 18:28:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1794 transitions. [2019-12-07 18:28:09,432 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1794 transitions. Word has length 36 [2019-12-07 18:28:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:09,432 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 1794 transitions. [2019-12-07 18:28:09,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1794 transitions. [2019-12-07 18:28:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:28:09,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:09,434 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 18:28:09,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:28:09,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1065656218, now seen corresponding path program 1 times [2019-12-07 18:28:09,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:09,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349553970] [2019-12-07 18:28:09,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:09,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:28:09,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:09,983 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 18:28:09,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:09,994 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 18:28:09,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349553970] [2019-12-07 18:28:09,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:09,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:28:09,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077337325] [2019-12-07 18:28:09,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:09,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:09,996 INFO L87 Difference]: Start difference. First operand 1374 states and 1794 transitions. Second operand 4 states. [2019-12-07 18:28:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:10,134 INFO L93 Difference]: Finished difference Result 4756 states and 6306 transitions. [2019-12-07 18:28:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:10,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 18:28:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:10,148 INFO L225 Difference]: With dead ends: 4756 [2019-12-07 18:28:10,148 INFO L226 Difference]: Without dead ends: 3389 [2019-12-07 18:28:10,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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 18:28:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2019-12-07 18:28:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3325. [2019-12-07 18:28:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3325 states. [2019-12-07 18:28:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4455 transitions. [2019-12-07 18:28:10,232 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4455 transitions. Word has length 36 [2019-12-07 18:28:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:10,232 INFO L462 AbstractCegarLoop]: Abstraction has 3325 states and 4455 transitions. [2019-12-07 18:28:10,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4455 transitions. [2019-12-07 18:28:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:28:10,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:10,235 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] [2019-12-07 18:28:10,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:28:10,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 837966201, now seen corresponding path program 1 times [2019-12-07 18:28:10,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:10,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685947707] [2019-12-07 18:28:10,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:10,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:28:10,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:10,764 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 18:28:10,764 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:10,779 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 18:28:10,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685947707] [2019-12-07 18:28:10,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:10,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:28:10,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895639709] [2019-12-07 18:28:10,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:10,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:10,781 INFO L87 Difference]: Start difference. First operand 3325 states and 4455 transitions. Second operand 6 states. [2019-12-07 18:28:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:11,002 INFO L93 Difference]: Finished difference Result 13192 states and 17652 transitions. [2019-12-07 18:28:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:28:11,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 18:28:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:11,040 INFO L225 Difference]: With dead ends: 13192 [2019-12-07 18:28:11,040 INFO L226 Difference]: Without dead ends: 9875 [2019-12-07 18:28:11,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 2 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 18:28:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2019-12-07 18:28:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 3349. [2019-12-07 18:28:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3349 states. [2019-12-07 18:28:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4479 transitions. [2019-12-07 18:28:11,200 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4479 transitions. Word has length 39 [2019-12-07 18:28:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:11,200 INFO L462 AbstractCegarLoop]: Abstraction has 3349 states and 4479 transitions. [2019-12-07 18:28:11,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4479 transitions. [2019-12-07 18:28:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:28:11,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:11,201 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] [2019-12-07 18:28:11,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:28:11,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -909737815, now seen corresponding path program 1 times [2019-12-07 18:28:11,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:11,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197422572] [2019-12-07 18:28:11,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:11,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:28:11,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:11,745 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 18:28:11,745 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:11,756 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 18:28:11,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197422572] [2019-12-07 18:28:11,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:11,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:28:11,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108387307] [2019-12-07 18:28:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:11,757 INFO L87 Difference]: Start difference. First operand 3349 states and 4479 transitions. Second operand 6 states. [2019-12-07 18:28:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:12,023 INFO L93 Difference]: Finished difference Result 11392 states and 15236 transitions. [2019-12-07 18:28:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:28:12,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:28:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:12,052 INFO L225 Difference]: With dead ends: 11392 [2019-12-07 18:28:12,052 INFO L226 Difference]: Without dead ends: 8051 [2019-12-07 18:28:12,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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 18:28:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8051 states. [2019-12-07 18:28:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8051 to 3373. [2019-12-07 18:28:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-12-07 18:28:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4503 transitions. [2019-12-07 18:28:12,212 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 4503 transitions. Word has length 40 [2019-12-07 18:28:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:12,212 INFO L462 AbstractCegarLoop]: Abstraction has 3373 states and 4503 transitions. [2019-12-07 18:28:12,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4503 transitions. [2019-12-07 18:28:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:28:12,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:12,213 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] [2019-12-07 18:28:12,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:28:12,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash -90764760, now seen corresponding path program 1 times [2019-12-07 18:28:12,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:12,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90514305] [2019-12-07 18:28:12,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:12,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:28:12,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:12,829 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 18:28:12,829 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:12,837 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 18:28:12,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90514305] [2019-12-07 18:28:12,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:12,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:28:12,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87106159] [2019-12-07 18:28:12,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:12,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:12,839 INFO L87 Difference]: Start difference. First operand 3373 states and 4503 transitions. Second operand 4 states. [2019-12-07 18:28:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:15,287 INFO L93 Difference]: Finished difference Result 11579 states and 15473 transitions. [2019-12-07 18:28:15,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:28:15,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 18:28:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:15,310 INFO L225 Difference]: With dead ends: 11579 [2019-12-07 18:28:15,310 INFO L226 Difference]: Without dead ends: 8214 [2019-12-07 18:28:15,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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 18:28:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2019-12-07 18:28:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 3005. [2019-12-07 18:28:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-12-07 18:28:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3997 transitions. [2019-12-07 18:28:15,531 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3997 transitions. Word has length 40 [2019-12-07 18:28:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:15,532 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 3997 transitions. [2019-12-07 18:28:15,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3997 transitions. [2019-12-07 18:28:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:28:15,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:15,533 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:15,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:28:15,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1671972291, now seen corresponding path program 1 times [2019-12-07 18:28:15,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:15,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472017197] [2019-12-07 18:28:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:16,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:28:16,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:16,148 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:16,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472017197] [2019-12-07 18:28:16,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:16,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 18:28:16,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453772216] [2019-12-07 18:28:16,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:16,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:16,152 INFO L87 Difference]: Start difference. First operand 3005 states and 3997 transitions. Second operand 6 states. [2019-12-07 18:28:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:18,351 INFO L93 Difference]: Finished difference Result 8803 states and 11750 transitions. [2019-12-07 18:28:18,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:28:18,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:28:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:18,361 INFO L225 Difference]: With dead ends: 8803 [2019-12-07 18:28:18,361 INFO L226 Difference]: Without dead ends: 7069 [2019-12-07 18:28:18,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:28:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7069 states. [2019-12-07 18:28:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7069 to 3005. [2019-12-07 18:28:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-12-07 18:28:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3991 transitions. [2019-12-07 18:28:18,550 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3991 transitions. Word has length 40 [2019-12-07 18:28:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:18,550 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 3991 transitions. [2019-12-07 18:28:18,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3991 transitions. [2019-12-07 18:28:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:28:18,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:18,551 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] [2019-12-07 18:28:18,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:28:18,752 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1101882010, now seen corresponding path program 1 times [2019-12-07 18:28:18,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:18,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746333654] [2019-12-07 18:28:18,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:19,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:28:19,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:19,100 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 18:28:19,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:19,102 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 18:28:19,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746333654] [2019-12-07 18:28:19,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:19,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 18:28:19,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752040966] [2019-12-07 18:28:19,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:19,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:19,104 INFO L87 Difference]: Start difference. First operand 3005 states and 3991 transitions. Second operand 6 states. [2019-12-07 18:28:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:23,070 INFO L93 Difference]: Finished difference Result 8146 states and 10826 transitions. [2019-12-07 18:28:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:28:23,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:28:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:23,083 INFO L225 Difference]: With dead ends: 8146 [2019-12-07 18:28:23,083 INFO L226 Difference]: Without dead ends: 7260 [2019-12-07 18:28:23,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:28:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-12-07 18:28:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 3011. [2019-12-07 18:28:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3011 states. [2019-12-07 18:28:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 3997 transitions. [2019-12-07 18:28:23,296 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 3997 transitions. Word has length 40 [2019-12-07 18:28:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:23,297 INFO L462 AbstractCegarLoop]: Abstraction has 3011 states and 3997 transitions. [2019-12-07 18:28:23,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3997 transitions. [2019-12-07 18:28:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:28:23,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:23,297 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] [2019-12-07 18:28:23,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:28:23,498 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash -292535384, now seen corresponding path program 1 times [2019-12-07 18:28:23,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:23,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303973022] [2019-12-07 18:28:23,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:23,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:28:23,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:23,911 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 18:28:23,911 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:23,934 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 18:28:23,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303973022] [2019-12-07 18:28:23,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:23,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 18:28:23,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678524905] [2019-12-07 18:28:23,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:23,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:23,935 INFO L87 Difference]: Start difference. First operand 3011 states and 3997 transitions. Second operand 6 states. [2019-12-07 18:28:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:27,158 INFO L93 Difference]: Finished difference Result 12480 states and 16653 transitions. [2019-12-07 18:28:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:28:27,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:28:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:27,169 INFO L225 Difference]: With dead ends: 12480 [2019-12-07 18:28:27,169 INFO L226 Difference]: Without dead ends: 10737 [2019-12-07 18:28:27,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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 18:28:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10737 states. [2019-12-07 18:28:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10737 to 9319. [2019-12-07 18:28:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-12-07 18:28:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 12393 transitions. [2019-12-07 18:28:27,807 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 12393 transitions. Word has length 40 [2019-12-07 18:28:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:27,808 INFO L462 AbstractCegarLoop]: Abstraction has 9319 states and 12393 transitions. [2019-12-07 18:28:27,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 12393 transitions. [2019-12-07 18:28:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:28:27,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:27,809 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] [2019-12-07 18:28:28,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:28:28,010 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1795406353, now seen corresponding path program 1 times [2019-12-07 18:28:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:28,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908110947] [2019-12-07 18:28:28,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:28,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:28:28,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:28,407 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 18:28:28,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:28,414 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 18:28:28,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908110947] [2019-12-07 18:28:28,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:28,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:28:28,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235517782] [2019-12-07 18:28:28,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:28,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:28,415 INFO L87 Difference]: Start difference. First operand 9319 states and 12393 transitions. Second operand 4 states. [2019-12-07 18:28:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:29,269 INFO L93 Difference]: Finished difference Result 19086 states and 25690 transitions. [2019-12-07 18:28:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:29,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 18:28:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:29,277 INFO L225 Difference]: With dead ends: 19086 [2019-12-07 18:28:29,277 INFO L226 Difference]: Without dead ends: 9775 [2019-12-07 18:28:29,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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 18:28:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2019-12-07 18:28:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9775. [2019-12-07 18:28:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-12-07 18:28:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 12849 transitions. [2019-12-07 18:28:30,002 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 12849 transitions. Word has length 45 [2019-12-07 18:28:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:30,002 INFO L462 AbstractCegarLoop]: Abstraction has 9775 states and 12849 transitions. [2019-12-07 18:28:30,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 12849 transitions. [2019-12-07 18:28:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:28:30,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:30,003 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:30,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:28:30,204 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1527637585, now seen corresponding path program 1 times [2019-12-07 18:28:30,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:30,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527033416] [2019-12-07 18:28:30,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:30,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:28:30,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:30,667 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:30,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527033416] [2019-12-07 18:28:30,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:28:30,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 18:28:30,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55652565] [2019-12-07 18:28:30,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:28:30,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:30,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:28:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:28:30,723 INFO L87 Difference]: Start difference. First operand 9775 states and 12849 transitions. Second operand 8 states. [2019-12-07 18:28:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:32,019 INFO L93 Difference]: Finished difference Result 19998 states and 26602 transitions. [2019-12-07 18:28:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:28:32,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-07 18:28:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:32,028 INFO L225 Difference]: With dead ends: 19998 [2019-12-07 18:28:32,028 INFO L226 Difference]: Without dead ends: 10231 [2019-12-07 18:28:32,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:28:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2019-12-07 18:28:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 10231. [2019-12-07 18:28:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10231 states. [2019-12-07 18:28:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 13305 transitions. [2019-12-07 18:28:32,795 INFO L78 Accepts]: Start accepts. Automaton has 10231 states and 13305 transitions. Word has length 47 [2019-12-07 18:28:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:32,795 INFO L462 AbstractCegarLoop]: Abstraction has 10231 states and 13305 transitions. [2019-12-07 18:28:32,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:28:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10231 states and 13305 transitions. [2019-12-07 18:28:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:28:32,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:32,796 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] [2019-12-07 18:28:32,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:28:32,997 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1842249347, now seen corresponding path program 1 times [2019-12-07 18:28:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:33,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713967370] [2019-12-07 18:28:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:33,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:28:33,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:33,411 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 18:28:33,411 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:33,418 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 18:28:33,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713967370] [2019-12-07 18:28:33,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:33,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:28:33,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348727216] [2019-12-07 18:28:33,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:33,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:33,419 INFO L87 Difference]: Start difference. First operand 10231 states and 13305 transitions. Second operand 4 states. [2019-12-07 18:28:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:35,823 INFO L93 Difference]: Finished difference Result 38532 states and 50146 transitions. [2019-12-07 18:28:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:35,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 18:28:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:35,849 INFO L225 Difference]: With dead ends: 38532 [2019-12-07 18:28:35,850 INFO L226 Difference]: Without dead ends: 28309 [2019-12-07 18:28:35,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 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 18:28:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28309 states. [2019-12-07 18:28:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28309 to 10375. [2019-12-07 18:28:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10375 states. [2019-12-07 18:28:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10375 states to 10375 states and 13473 transitions. [2019-12-07 18:28:36,812 INFO L78 Accepts]: Start accepts. Automaton has 10375 states and 13473 transitions. Word has length 48 [2019-12-07 18:28:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:36,812 INFO L462 AbstractCegarLoop]: Abstraction has 10375 states and 13473 transitions. [2019-12-07 18:28:36,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 13473 transitions. [2019-12-07 18:28:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:36,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:36,813 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:37,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:28:37,014 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1899889297, now seen corresponding path program 2 times [2019-12-07 18:28:37,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:37,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657075138] [2019-12-07 18:28:37,017 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:37,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:28:37,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:28:37,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:28:37,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:28:37,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:28:37,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657075138] [2019-12-07 18:28:37,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:37,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 18:28:37,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074552436] [2019-12-07 18:28:37,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:37,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:37,432 INFO L87 Difference]: Start difference. First operand 10375 states and 13473 transitions. Second operand 6 states. [2019-12-07 18:28:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:43,789 INFO L93 Difference]: Finished difference Result 41901 states and 54486 transitions. [2019-12-07 18:28:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:28:43,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 18:28:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:43,818 INFO L225 Difference]: With dead ends: 41901 [2019-12-07 18:28:43,818 INFO L226 Difference]: Without dead ends: 31534 [2019-12-07 18:28:43,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:28:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31534 states. [2019-12-07 18:28:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31534 to 10423. [2019-12-07 18:28:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10423 states. [2019-12-07 18:28:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10423 states to 10423 states and 13521 transitions. [2019-12-07 18:28:44,840 INFO L78 Accepts]: Start accepts. Automaton has 10423 states and 13521 transitions. Word has length 49 [2019-12-07 18:28:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:44,840 INFO L462 AbstractCegarLoop]: Abstraction has 10423 states and 13521 transitions. [2019-12-07 18:28:44,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:28:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 10423 states and 13521 transitions. [2019-12-07 18:28:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:44,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:44,841 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:45,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:28:45,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1283816922, now seen corresponding path program 1 times [2019-12-07 18:28:45,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:45,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641018148] [2019-12-07 18:28:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/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 18:28:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:45,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:28:45,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:45,398 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:45,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641018148] [2019-12-07 18:28:45,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:45,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 18:28:45,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135934681] [2019-12-07 18:28:45,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:28:45,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:28:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:28:45,402 INFO L87 Difference]: Start difference. First operand 10423 states and 13521 transitions. Second operand 7 states. [2019-12-07 18:28:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,272 INFO L93 Difference]: Finished difference Result 80209 states and 104468 transitions. [2019-12-07 18:28:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:28:55,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 18:28:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,340 INFO L225 Difference]: With dead ends: 80209 [2019-12-07 18:28:55,340 INFO L226 Difference]: Without dead ends: 69794 [2019-12-07 18:28:55,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:28:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69794 states. [2019-12-07 18:28:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69794 to 10405. [2019-12-07 18:28:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10405 states. [2019-12-07 18:28:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10405 states to 10405 states and 13479 transitions. [2019-12-07 18:28:56,676 INFO L78 Accepts]: Start accepts. Automaton has 10405 states and 13479 transitions. Word has length 49 [2019-12-07 18:28:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:56,676 INFO L462 AbstractCegarLoop]: Abstraction has 10405 states and 13479 transitions. [2019-12-07 18:28:56,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:28:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 10405 states and 13479 transitions. [2019-12-07 18:28:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:56,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:56,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:56,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 18:28:56,878 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash 663634229, now seen corresponding path program 1 times [2019-12-07 18:28:56,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:28:56,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300537984] [2019-12-07 18:28:56,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 18:28:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:57,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:28:57,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:57,252 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:28:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:28:57,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300537984] [2019-12-07 18:28:57,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:57,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:28:57,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843608078] [2019-12-07 18:28:57,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:28:57,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:28:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:28:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:28:57,264 INFO L87 Difference]: Start difference. First operand 10405 states and 13479 transitions. Second operand 6 states. [2019-12-07 18:29:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:00,598 INFO L93 Difference]: Finished difference Result 20848 states and 27005 transitions. [2019-12-07 18:29:00,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:29:00,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 18:29:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:00,606 INFO L225 Difference]: With dead ends: 20848 [2019-12-07 18:29:00,606 INFO L226 Difference]: Without dead ends: 10449 [2019-12-07 18:29:00,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 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 18:29:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10449 states. [2019-12-07 18:29:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10449 to 10411. [2019-12-07 18:29:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10411 states. [2019-12-07 18:29:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 13484 transitions. [2019-12-07 18:29:01,707 INFO L78 Accepts]: Start accepts. Automaton has 10411 states and 13484 transitions. Word has length 49 [2019-12-07 18:29:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:01,707 INFO L462 AbstractCegarLoop]: Abstraction has 10411 states and 13484 transitions. [2019-12-07 18:29:01,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:29:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10411 states and 13484 transitions. [2019-12-07 18:29:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:29:01,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:01,708 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] [2019-12-07 18:29:01,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 18:29:01,909 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2080942146, now seen corresponding path program 1 times [2019-12-07 18:29:01,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:01,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324612255] [2019-12-07 18:29:01,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 18:29:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:02,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:29:02,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:02,298 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 18:29:02,298 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:02,320 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 18:29:02,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324612255] [2019-12-07 18:29:02,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:02,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 18:29:02,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298884083] [2019-12-07 18:29:02,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:29:02,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:29:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:29:02,322 INFO L87 Difference]: Start difference. First operand 10411 states and 13484 transitions. Second operand 6 states. [2019-12-07 18:29:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:10,533 INFO L93 Difference]: Finished difference Result 41859 states and 54294 transitions. [2019-12-07 18:29:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:29:10,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-07 18:29:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:10,569 INFO L225 Difference]: With dead ends: 41859 [2019-12-07 18:29:10,569 INFO L226 Difference]: Without dead ends: 36578 [2019-12-07 18:29:10,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 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 18:29:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36578 states. [2019-12-07 18:29:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36578 to 31109. [2019-12-07 18:29:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31109 states. [2019-12-07 18:29:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31109 states to 31109 states and 40286 transitions. [2019-12-07 18:29:14,298 INFO L78 Accepts]: Start accepts. Automaton has 31109 states and 40286 transitions. Word has length 50 [2019-12-07 18:29:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:14,298 INFO L462 AbstractCegarLoop]: Abstraction has 31109 states and 40286 transitions. [2019-12-07 18:29:14,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:29:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31109 states and 40286 transitions. [2019-12-07 18:29:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:29:14,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:14,299 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] [2019-12-07 18:29:14,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 18:29:14,500 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash -219880444, now seen corresponding path program 1 times [2019-12-07 18:29:14,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:14,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924485743] [2019-12-07 18:29:14,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 18:29:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:14,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:29:14,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:14,862 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 18:29:14,863 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:14,865 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 18:29:14,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924485743] [2019-12-07 18:29:14,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:14,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:29:14,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746778958] [2019-12-07 18:29:14,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:14,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:14,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:14,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:14,866 INFO L87 Difference]: Start difference. First operand 31109 states and 40286 transitions. Second operand 4 states. [2019-12-07 18:29:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:29,692 INFO L93 Difference]: Finished difference Result 131413 states and 170434 transitions. [2019-12-07 18:29:29,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:29:29,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:29:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:29,804 INFO L225 Difference]: With dead ends: 131413 [2019-12-07 18:29:29,804 INFO L226 Difference]: Without dead ends: 100312 [2019-12-07 18:29:29,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 18:29:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100312 states. [2019-12-07 18:29:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100312 to 29895. [2019-12-07 18:29:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29895 states. [2019-12-07 18:29:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29895 states to 29895 states and 38592 transitions. [2019-12-07 18:29:34,369 INFO L78 Accepts]: Start accepts. Automaton has 29895 states and 38592 transitions. Word has length 50 [2019-12-07 18:29:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:34,369 INFO L462 AbstractCegarLoop]: Abstraction has 29895 states and 38592 transitions. [2019-12-07 18:29:34,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 29895 states and 38592 transitions. [2019-12-07 18:29:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:29:34,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:34,370 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:34,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 18:29:34,571 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1508185833, now seen corresponding path program 1 times [2019-12-07 18:29:34,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:34,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701226186] [2019-12-07 18:29:34,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 18:29:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:34,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:29:34,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:29:34,960 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:29:34,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701226186] [2019-12-07 18:29:34,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:34,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:29:34,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106569870] [2019-12-07 18:29:34,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:34,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:34,963 INFO L87 Difference]: Start difference. First operand 29895 states and 38592 transitions. Second operand 4 states. [2019-12-07 18:29:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:48,635 INFO L93 Difference]: Finished difference Result 108464 states and 140542 transitions. [2019-12-07 18:29:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:29:48,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 18:29:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:48,719 INFO L225 Difference]: With dead ends: 108464 [2019-12-07 18:29:48,719 INFO L226 Difference]: Without dead ends: 78577 [2019-12-07 18:29:48,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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 18:29:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78577 states. [2019-12-07 18:29:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78577 to 28963. [2019-12-07 18:29:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28963 states. [2019-12-07 18:29:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28963 states to 28963 states and 37294 transitions. [2019-12-07 18:29:53,259 INFO L78 Accepts]: Start accepts. Automaton has 28963 states and 37294 transitions. Word has length 51 [2019-12-07 18:29:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 28963 states and 37294 transitions. [2019-12-07 18:29:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28963 states and 37294 transitions. [2019-12-07 18:29:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 18:29:53,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:53,260 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] [2019-12-07 18:29:53,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 18:29:53,461 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1762719395, now seen corresponding path program 1 times [2019-12-07 18:29:53,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:53,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020501053] [2019-12-07 18:29:53,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 18:29:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:53,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:29:53,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:53,851 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 18:29:53,851 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:53,858 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 18:29:53,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020501053] [2019-12-07 18:29:53,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:53,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:29:53,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256804109] [2019-12-07 18:29:53,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:53,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:53,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:53,859 INFO L87 Difference]: Start difference. First operand 28963 states and 37294 transitions. Second operand 4 states. [2019-12-07 18:29:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:58,108 INFO L93 Difference]: Finished difference Result 58098 states and 74832 transitions. [2019-12-07 18:29:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:58,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 18:29:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:58,143 INFO L225 Difference]: With dead ends: 58098 [2019-12-07 18:29:58,144 INFO L226 Difference]: Without dead ends: 29143 [2019-12-07 18:29:58,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 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 18:29:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29143 states. [2019-12-07 18:30:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29143 to 29143. [2019-12-07 18:30:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29143 states. [2019-12-07 18:30:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29143 states to 29143 states and 37474 transitions. [2019-12-07 18:30:02,428 INFO L78 Accepts]: Start accepts. Automaton has 29143 states and 37474 transitions. Word has length 54 [2019-12-07 18:30:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:02,428 INFO L462 AbstractCegarLoop]: Abstraction has 29143 states and 37474 transitions. [2019-12-07 18:30:02,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:30:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29143 states and 37474 transitions. [2019-12-07 18:30:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:30:02,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:02,429 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:02,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 18:30:02,630 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:02,631 INFO L82 PathProgramCache]: Analyzing trace with hash 440334967, now seen corresponding path program 1 times [2019-12-07 18:30:02,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:30:02,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925149127] [2019-12-07 18:30:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 18:30:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:03,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:30:03,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:30:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:30:03,050 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:30:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:30:03,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925149127] [2019-12-07 18:30:03,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:03,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 18:30:03,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349357745] [2019-12-07 18:30:03,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:30:03,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:30:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:30:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:30:03,055 INFO L87 Difference]: Start difference. First operand 29143 states and 37474 transitions. Second operand 7 states. [2019-12-07 18:30:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:41,040 INFO L93 Difference]: Finished difference Result 226870 states and 292852 transitions. [2019-12-07 18:30:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:30:41,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-07 18:30:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:41,291 INFO L225 Difference]: With dead ends: 226870 [2019-12-07 18:30:41,291 INFO L226 Difference]: Without dead ends: 197735 [2019-12-07 18:30:41,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:30:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197735 states. [2019-12-07 18:30:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197735 to 28843. [2019-12-07 18:30:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28843 states. [2019-12-07 18:30:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28843 states to 28843 states and 37030 transitions. [2019-12-07 18:30:46,856 INFO L78 Accepts]: Start accepts. Automaton has 28843 states and 37030 transitions. Word has length 58 [2019-12-07 18:30:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:46,857 INFO L462 AbstractCegarLoop]: Abstraction has 28843 states and 37030 transitions. [2019-12-07 18:30:46,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:30:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28843 states and 37030 transitions. [2019-12-07 18:30:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:30:46,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:46,857 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:47,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 18:30:47,059 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:47,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:47,060 INFO L82 PathProgramCache]: Analyzing trace with hash -805070630, now seen corresponding path program 1 times [2019-12-07 18:30:47,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:30:47,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935669644] [2019-12-07 18:30:47,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 18:30:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:47,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:30:47,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:30:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:30:47,540 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:30:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:30:47,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935669644] [2019-12-07 18:30:47,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:47,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 18:30:47,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781580279] [2019-12-07 18:30:47,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:30:47,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:30:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:30:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:30:47,554 INFO L87 Difference]: Start difference. First operand 28843 states and 37030 transitions. Second operand 7 states. [2019-12-07 18:31:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:20,445 INFO L93 Difference]: Finished difference Result 199809 states and 258741 transitions. [2019-12-07 18:31:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:31:20,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-07 18:31:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:20,654 INFO L225 Difference]: With dead ends: 199809 [2019-12-07 18:31:20,654 INFO L226 Difference]: Without dead ends: 170974 [2019-12-07 18:31:20,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:31:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170974 states. [2019-12-07 18:31:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170974 to 28717. [2019-12-07 18:31:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28717 states. [2019-12-07 18:31:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 36832 transitions. [2019-12-07 18:31:26,496 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 36832 transitions. Word has length 59 [2019-12-07 18:31:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:26,496 INFO L462 AbstractCegarLoop]: Abstraction has 28717 states and 36832 transitions. [2019-12-07 18:31:26,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:31:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 36832 transitions. [2019-12-07 18:31:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:31:26,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:26,497 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:26,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 18:31:26,698 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:31:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash 328933776, now seen corresponding path program 1 times [2019-12-07 18:31:26,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:31:26,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690708888] [2019-12-07 18:31:26,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 18:31:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:27,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:31:27,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:31:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:31:27,189 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:31:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:31:27,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690708888] [2019-12-07 18:31:27,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:31:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:31:27,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981013270] [2019-12-07 18:31:27,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:31:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:31:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:31:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:31:27,193 INFO L87 Difference]: Start difference. First operand 28717 states and 36832 transitions. Second operand 4 states. [2019-12-07 18:31:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:45,144 INFO L93 Difference]: Finished difference Result 111825 states and 143638 transitions. [2019-12-07 18:31:45,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:31:45,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 18:31:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:45,228 INFO L225 Difference]: With dead ends: 111825 [2019-12-07 18:31:45,228 INFO L226 Difference]: Without dead ends: 83116 [2019-12-07 18:31:45,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 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 18:31:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83116 states. [2019-12-07 18:31:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83116 to 19903. [2019-12-07 18:31:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19903 states. [2019-12-07 18:31:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19903 states to 19903 states and 25479 transitions. [2019-12-07 18:31:49,745 INFO L78 Accepts]: Start accepts. Automaton has 19903 states and 25479 transitions. Word has length 59 [2019-12-07 18:31:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:49,745 INFO L462 AbstractCegarLoop]: Abstraction has 19903 states and 25479 transitions. [2019-12-07 18:31:49,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:31:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19903 states and 25479 transitions. [2019-12-07 18:31:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 18:31:49,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:49,746 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:31:49,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 18:31:49,947 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:31:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash -178533166, now seen corresponding path program 1 times [2019-12-07 18:31:49,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:31:49,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589104790] [2019-12-07 18:31:49,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c14e9a2-1865-4573-8ce2-d869c4f7d0cb/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 18:31:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:32:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:32:08,475 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:32:08,476 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:32:08,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 18:32:08,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:32:08 BoogieIcfgContainer [2019-12-07 18:32:08,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:32:08,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:32:08,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:32:08,840 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:32:08,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:07" (3/4) ... [2019-12-07 18:32:08,843 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:32:08,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:32:08,844 INFO L168 Benchmark]: Toolchain (without parser) took 274417.68 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 942.9 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,844 INFO L168 Benchmark]: CDTParser took 0.17 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 18:32:08,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1241.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.9 MB in the beginning and 879.1 MB in the end (delta: 63.8 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.35 ms. Allocated memory is still 1.2 GB. Free memory was 879.1 MB in the beginning and 859.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,845 INFO L168 Benchmark]: Boogie Preprocessor took 108.01 ms. Allocated memory is still 1.2 GB. Free memory was 859.0 MB in the beginning and 845.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,845 INFO L168 Benchmark]: RCFGBuilder took 31255.90 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 845.7 MB in the beginning and 1.5 GB in the end (delta: -661.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,846 INFO L168 Benchmark]: TraceAbstraction took 241688.53 ms. Allocated memory was 3.4 GB in the beginning and 4.7 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -872.9 MB). Peak memory consumption was 391.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:32:08,846 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 4.7 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:32:08,848 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.17 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 1241.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.9 MB in the beginning and 879.1 MB in the end (delta: 63.8 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.35 ms. Allocated memory is still 1.2 GB. Free memory was 879.1 MB in the beginning and 859.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.01 ms. Allocated memory is still 1.2 GB. Free memory was 859.0 MB in the beginning and 845.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 31255.90 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 845.7 MB in the beginning and 1.5 GB in the end (delta: -661.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * TraceAbstraction took 241688.53 ms. Allocated memory was 3.4 GB in the beginning and 4.7 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -872.9 MB). Peak memory consumption was 391.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 4.7 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6743]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 5132. Possible FailurePath: [L5138] static struct lock_class_key __key___7 ; [L5139] static struct lock_class_key __key___8 ; [L5279-L5292] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5293-L5312] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5313-L5318] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5319-L5321] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6236-L6276] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6277-L6281] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6532-L6550] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6603] int LDV_IN_INTERRUPT ; [L6604] static int res_ems_usb_open_10 ; [L6605] static int res_ems_usb_close_12 ; [L6606] static int res_ems_usb_probe_16 ; [L6756] int ldv_urb_state = 0; [L6757] int ldv_coherent_state = 0; VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6608] struct net_device *var_group1 ; [L6609] struct sk_buff *var_group2 ; [L6610] struct usb_interface *var_group3 ; [L6611] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6612] int tmp___7 ; [L6613] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6614] int ldv_s_ems_usb_driver_usb_driver ; [L6615] int tmp___8 ; [L6616] int tmp___9 ; [L6619] LDV_IN_INTERRUPT = 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6554] int err ; [L5129] int tmp___7 ; [L5132] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7007] return __VERIFIER_nondet_int(); [L5132] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5134] return (tmp___7); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6558] err = usb_register(& ems_usb_driver) [L6560] COND FALSE !(\read(err)) [L6567] return (0); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6621] tmp___7 = ems_usb_init() [L6623] COND FALSE !(\read(tmp___7)) [L6627] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6628] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND TRUE \read(tmp___9) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___8 = __VERIFIER_nondet_int() [L6646] COND FALSE !(tmp___8 == 0) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6649] COND FALSE !(tmp___8 == 1) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6652] COND TRUE tmp___8 == 2 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6037] struct ems_usb *dev ; [L6038] void *tmp___7 ; [L6039] struct ems_tx_urb_context *context ; [L6040] struct net_device_stats *stats ; [L6041] struct can_frame *cf ; [L6042] struct ems_cpc_msg *msg ; [L6043] struct urb *urb ; [L6044] u8 *buf ; [L6045] int i ; [L6046] int err ; [L6047] size_t size ; [L6048] int tmp___8 ; [L6049] void *tmp___9 ; [L6050] unsigned int tmp___10 ; [L6051] int tmp___11 ; [L6052] long tmp___12 ; [L4965] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6055] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6056] dev = (struct ems_usb *)tmp___7 [L6057] context = (struct ems_tx_urb_context *)((void *)0) [L6058] stats = & netdev->stats [L6059] EXPR skb->data [L6059] cf = (struct can_frame *)skb->data [L6060] size = 15UL + sizeof(struct cpc_can_msg ) [L5241] struct can_frame const *cf ; [L5242] int tmp___7 ; [L5243] long tmp___8 ; [L5245] EXPR skb->data [L5245] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5246] EXPR skb->len VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5246] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5249] EXPR cf->can_dlc VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5249] COND FALSE !((int const )cf->can_dlc > 8) [L5252] tmp___7 = 0 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5255] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !(\read(tmp___8)) [L5265] return (0); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6061] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6063] COND FALSE !(\read(tmp___8)) [L6819] void *arbitrary_memory ; [L6820] void *tmp___7 ; VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6823] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6826] tmp___7 = ldv_undefined_pointer() [L6827] arbitrary_memory = tmp___7 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6829] COND FALSE !(! arbitrary_memory) [L6833] ldv_urb_state = ldv_urb_state + 1 [L6834] return ((struct urb *)arbitrary_memory); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6068] urb = usb_alloc_urb(0, 32U) [L6070] COND FALSE !(! urb) [L6078] EXPR dev->udev [L6762] void *arbitrary_memory ; [L6763] void *tmp___7 ; VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6766] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6769] tmp___7 = ldv_undefined_pointer() [L6770] arbitrary_memory = tmp___7 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6772] COND FALSE !(! arbitrary_memory) [L6776] ldv_coherent_state = ldv_coherent_state + 1 [L6777] return (arbitrary_memory); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6078] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6079] buf = (u8 *)tmp___9 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6081] COND FALSE !(! buf) [L6089] msg = (struct ems_cpc_msg *)(buf + 4) [L6090] EXPR cf->can_id [L6090] msg->msg.can_msg.id = cf->can_id & 536870911U [L6091] EXPR cf->can_dlc [L6091] msg->msg.can_msg.length = cf->can_dlc [L6092] EXPR cf->can_id VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND TRUE cf->can_id & 1073741824U [L6093] EXPR cf->can_id VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6093] COND TRUE cf->can_id & 2147483648U [L6094] msg->type = (u8 )16 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6098] msg->length = (u8 )5 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6121] EXPR msg->msg.can_msg.id [L6121] msg->msg.can_msg.id = msg->msg.can_msg.id [L6122] i = 0 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6124] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6126] COND TRUE i < 10 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6130] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6130] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6131] context = & dev->tx_contexts[i] VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6140] COND TRUE ! context [L6143] dev->udev [L6143] urb->transfer_dma [L6791] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6793] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6799] COND TRUE \read(*addr) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6800] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6806] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6144] netdev->dev.parent [L6146] return ((netdev_tx_t )16); VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND FALSE !(\read(tmp___9)) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6637] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6639] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6878] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6743] __VERIFIER_error() VAL [__key___7={-536868728:0}, __key___8={-1073739640:0}, __this_module={71:70}, ems_usb_bittiming_const={-1610610517:0}, ems_usb_driver={-1609530985:0}, ems_usb_netdev_ops={536871316:0}, ems_usb_table={-1610612449:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 392 locations, 11 error locations. Result: UNSAFE, OverallTime: 241.4s, OverallIterations: 24, TraceHistogramMax: 4, AutomataDifference: 168.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20793 SDtfs, 33940 SDslu, 47039 SDs, 0 SdLazy, 1405 SolverSat, 274 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 35.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2057 GetRequests, 1924 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31109occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 624589 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 12.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1954 ConstructedInterpolants, 0 QuantifiedInterpolants, 139530 SizeOfPredicates, 81 NumberOfNonLiveVariables, 12573 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 46 InterpolantComputations, 44 PerfectInterpolantSequences, 114/120 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...