./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:56:33,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:56:33,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:56:33,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:56:33,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:56:33,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:56:33,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:56:33,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:56:33,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:56:33,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:56:33,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:56:33,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:56:33,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:56:33,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:56:33,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:56:33,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:56:33,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:56:33,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:56:33,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:56:33,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:56:33,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:56:33,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:56:33,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:56:33,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:56:33,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:56:33,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:56:33,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:56:33,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:56:33,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:56:33,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:56:33,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:56:33,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:56:33,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:56:33,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:56:33,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:56:33,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:56:33,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 09:56:33,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:56:33,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:56:33,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:56:33,153 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:56:33,154 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:56:33,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:56:33,154 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:56:33,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:56:33,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:56:33,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:56:33,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:56:33,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:56:33,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:56:33,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:56:33,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:56:33,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:56:33,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:56:33,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:56:33,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:56:33,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:56:33,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:56:33,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:56:33,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:56:33,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-18 09:56:33,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:56:33,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:56:33,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:56:33,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:56:33,193 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:56:33,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:33,228 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/8291e13a6/fdba63eef92149459b9ea430c3710fd9/FLAGe7129462c [2018-11-18 09:56:33,530 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:56:33,531 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:33,536 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/8291e13a6/fdba63eef92149459b9ea430c3710fd9/FLAGe7129462c [2018-11-18 09:56:33,544 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/8291e13a6/fdba63eef92149459b9ea430c3710fd9 [2018-11-18 09:56:33,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:56:33,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:56:33,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:56:33,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:56:33,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:56:33,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd7b18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33, skipping insertion in model container [2018-11-18 09:56:33,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:56:33,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:56:33,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:56:33,681 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:56:33,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:56:33,706 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:56:33,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33 WrapperNode [2018-11-18 09:56:33,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:56:33,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:56:33,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:56:33,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:56:33,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... [2018-11-18 09:56:33,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:56:33,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:56:33,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:56:33,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:56:33,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 [2018-11-18 09:56:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:56:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:56:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:56:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-18 09:56:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-18 09:56:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:56:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:56:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:56:33,918 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:56:33,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:33 BoogieIcfgContainer [2018-11-18 09:56:33,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:56:33,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:56:33,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:56:33,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:56:33,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:56:33" (1/3) ... [2018-11-18 09:56:33,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4394c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:33, skipping insertion in model container [2018-11-18 09:56:33,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:33" (2/3) ... [2018-11-18 09:56:33,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4394c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:33, skipping insertion in model container [2018-11-18 09:56:33,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:33" (3/3) ... [2018-11-18 09:56:33,923 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:33,929 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:56:33,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:56:33,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:56:33,968 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:56:33,969 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:56:33,969 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:56:33,969 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:56:33,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:56:33,969 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:56:33,969 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:56:33,969 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:56:33,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:56:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 09:56:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 09:56:33,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:33,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:33,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:33,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-18 09:56:33,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:34,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:56:34,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 09:56:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:56:34,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:56:34,067 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 09:56:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,080 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 09:56:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:56:34,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 09:56:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,086 INFO L225 Difference]: With dead ends: 31 [2018-11-18 09:56:34,086 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 09:56:34,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:56:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 09:56:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 09:56:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 09:56:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 09:56:34,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 09:56:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,110 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 09:56:34,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 09:56:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 09:56:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 09:56:34,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-18 09:56:34,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:34,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:56:34,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:56:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:56:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:56:34,179 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-18 09:56:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,191 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 09:56:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:56:34,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 09:56:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,192 INFO L225 Difference]: With dead ends: 21 [2018-11-18 09:56:34,193 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 09:56:34,193 INFO L604 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 [2018-11-18 09:56:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 09:56:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 09:56:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:56:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 09:56:34,196 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 09:56:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,196 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 09:56:34,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:56:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 09:56:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 09:56:34,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,197 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-18 09:56:34,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:34,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:34,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:34,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 09:56:34,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:56:34,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:56:34,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:56:34,347 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-18 09:56:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,365 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-18 09:56:34,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:56:34,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 09:56:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,366 INFO L225 Difference]: With dead ends: 23 [2018-11-18 09:56:34,366 INFO L226 Difference]: Without dead ends: 17 [2018-11-18 09:56:34,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:56:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-18 09:56:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 09:56:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 09:56:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 09:56:34,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-18 09:56:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,369 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-18 09:56:34,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:56:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 09:56:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 09:56:34,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,369 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2097288115, now seen corresponding path program 2 times [2018-11-18 09:56:34,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:34,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:56:34,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:56:34,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 09:56:34,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:56:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:56:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:56:34,528 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-18 09:56:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,543 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-18 09:56:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:56:34,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 09:56:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,544 INFO L225 Difference]: With dead ends: 25 [2018-11-18 09:56:34,544 INFO L226 Difference]: Without dead ends: 19 [2018-11-18 09:56:34,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:56:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-18 09:56:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 09:56:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:56:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-18 09:56:34,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-18 09:56:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,546 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-18 09:56:34,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:56:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-18 09:56:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 09:56:34,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,547 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -629748883, now seen corresponding path program 3 times [2018-11-18 09:56:34,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:34,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:34,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:56:34,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 09:56:34,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:34,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:34,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 09:56:34,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:56:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:56:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:56:34,670 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-18 09:56:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,688 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-18 09:56:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:56:34,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 09:56:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,689 INFO L225 Difference]: With dead ends: 27 [2018-11-18 09:56:34,689 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 09:56:34,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:56:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 09:56:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 09:56:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 09:56:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 09:56:34,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-18 09:56:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,693 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 09:56:34,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:56:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 09:56:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:56:34,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,694 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,694 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 4 times [2018-11-18 09:56:34,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:34,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:34,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:56:34,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:56:34,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:34,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:34,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 09:56:34,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:56:34,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:56:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:56:34,857 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-18 09:56:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:34,873 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-18 09:56:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:56:34,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 09:56:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:34,874 INFO L225 Difference]: With dead ends: 29 [2018-11-18 09:56:34,874 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 09:56:34,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:56:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 09:56:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 09:56:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 09:56:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-18 09:56:34,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-18 09:56:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:34,877 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-18 09:56:34,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:56:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 09:56:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 09:56:34,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:34,878 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:34,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:34,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1310377825, now seen corresponding path program 5 times [2018-11-18 09:56:34,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:34,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:35,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:35,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 09:56:35,055 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 09:56:35,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:35,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:35,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 09:56:35,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:56:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:56:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:56:35,097 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-18 09:56:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:35,122 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-18 09:56:35,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:56:35,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 09:56:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:35,123 INFO L225 Difference]: With dead ends: 31 [2018-11-18 09:56:35,123 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 09:56:35,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:56:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 09:56:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 09:56:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 09:56:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-18 09:56:35,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-18 09:56:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:35,127 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-18 09:56:35,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:56:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-18 09:56:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 09:56:35,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:35,128 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:35,128 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:35,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash -936293477, now seen corresponding path program 6 times [2018-11-18 09:56:35,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:35,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:35,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 09:56:35,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 09:56:35,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:35,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:35,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 09:56:35,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:56:35,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:56:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:56:35,276 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-18 09:56:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:35,330 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-18 09:56:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:56:35,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-18 09:56:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:35,331 INFO L225 Difference]: With dead ends: 33 [2018-11-18 09:56:35,331 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 09:56:35,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:56:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 09:56:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 09:56:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 09:56:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-18 09:56:35,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-18 09:56:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:35,335 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-18 09:56:35,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:56:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-18 09:56:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 09:56:35,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:35,336 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:35,336 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:35,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 381135189, now seen corresponding path program 7 times [2018-11-18 09:56:35,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:35,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:35,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 09:56:35,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:56:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:56:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:56:35,496 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-18 09:56:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:35,539 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-18 09:56:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:56:35,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-18 09:56:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:35,540 INFO L225 Difference]: With dead ends: 35 [2018-11-18 09:56:35,540 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 09:56:35,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:56:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 09:56:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 09:56:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 09:56:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-18 09:56:35,543 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-18 09:56:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:35,543 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-18 09:56:35,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:56:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-18 09:56:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 09:56:35,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:35,544 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:35,544 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:35,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -585269105, now seen corresponding path program 8 times [2018-11-18 09:56:35,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:35,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:35,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:56:35,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:56:35,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:35,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:35,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 09:56:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:56:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:56:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:56:35,741 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-11-18 09:56:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:35,784 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-18 09:56:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:56:35,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-18 09:56:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:35,785 INFO L225 Difference]: With dead ends: 37 [2018-11-18 09:56:35,785 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 09:56:35,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:56:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 09:56:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 09:56:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 09:56:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-18 09:56:35,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-18 09:56:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:35,789 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-18 09:56:35,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:56:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-18 09:56:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:56:35,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:35,790 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:35,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:35,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1586859703, now seen corresponding path program 9 times [2018-11-18 09:56:35,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:35,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:35,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:35,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:56:35,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 09:56:35,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:35,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 09:56:35,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:56:35,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:56:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:56:35,983 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-11-18 09:56:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:36,023 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-18 09:56:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:56:36,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-18 09:56:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:36,024 INFO L225 Difference]: With dead ends: 39 [2018-11-18 09:56:36,024 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 09:56:36,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:56:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 09:56:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 09:56:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 09:56:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 09:56:36,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-18 09:56:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:36,027 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-18 09:56:36,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:56:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 09:56:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 09:56:36,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:36,028 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:36,028 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:36,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 10 times [2018-11-18 09:56:36,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:36,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:36,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:56:36,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:56:36,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:36,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 09:56:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 09:56:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:56:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:56:36,199 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-11-18 09:56:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:36,253 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-18 09:56:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 09:56:36,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-18 09:56:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:36,258 INFO L225 Difference]: With dead ends: 41 [2018-11-18 09:56:36,258 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 09:56:36,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:56:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 09:56:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 09:56:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 09:56:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-18 09:56:36,261 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-18 09:56:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:36,261 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-18 09:56:36,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 09:56:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-18 09:56:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 09:56:36,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:36,262 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:36,262 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:36,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2066735299, now seen corresponding path program 11 times [2018-11-18 09:56:36,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:36,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:36,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 09:56:36,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 09:56:36,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:36,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:36,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 09:56:36,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 09:56:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 09:56:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:56:36,598 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-18 09:56:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:36,658 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-18 09:56:36,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:56:36,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-18 09:56:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:36,658 INFO L225 Difference]: With dead ends: 43 [2018-11-18 09:56:36,659 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 09:56:36,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:56:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 09:56:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 09:56:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 09:56:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-18 09:56:36,661 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-18 09:56:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:36,661 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-18 09:56:36,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 09:56:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-18 09:56:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 09:56:36,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:36,662 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:36,662 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:36,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 653270135, now seen corresponding path program 12 times [2018-11-18 09:56:36,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:36,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:36,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:36,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:36,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:36,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 09:56:36,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 09:56:36,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:36,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:36,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 09:56:36,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 09:56:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 09:56:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:56:36,903 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-11-18 09:56:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:36,997 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-18 09:56:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 09:56:36,997 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-18 09:56:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:36,998 INFO L225 Difference]: With dead ends: 45 [2018-11-18 09:56:36,998 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 09:56:36,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:56:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 09:56:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 09:56:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 09:56:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-18 09:56:37,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-18 09:56:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:37,002 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-18 09:56:37,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 09:56:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 09:56:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 09:56:37,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:37,003 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:37,003 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:37,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1056591055, now seen corresponding path program 13 times [2018-11-18 09:56:37,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:37,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:37,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:37,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:37,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 09:56:37,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 09:56:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 09:56:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:56:37,217 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-11-18 09:56:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:37,303 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-18 09:56:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 09:56:37,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-18 09:56:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:37,305 INFO L225 Difference]: With dead ends: 47 [2018-11-18 09:56:37,305 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 09:56:37,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:56:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 09:56:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 09:56:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 09:56:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-18 09:56:37,309 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-18 09:56:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:37,309 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-18 09:56:37,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 09:56:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-18 09:56:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 09:56:37,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:37,312 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:37,312 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:37,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash 739279723, now seen corresponding path program 14 times [2018-11-18 09:56:37,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:37,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:37,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:56:37,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:56:37,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:37,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:37,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 09:56:37,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 09:56:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 09:56:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-18 09:56:37,519 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-11-18 09:56:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:37,605 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-18 09:56:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 09:56:37,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-18 09:56:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:37,606 INFO L225 Difference]: With dead ends: 49 [2018-11-18 09:56:37,606 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 09:56:37,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-18 09:56:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 09:56:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 09:56:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 09:56:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-18 09:56:37,609 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-18 09:56:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:37,609 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-18 09:56:37,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 09:56:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-18 09:56:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:56:37,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:37,610 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:37,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:37,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash -5755611, now seen corresponding path program 15 times [2018-11-18 09:56:37,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:37,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:56:37,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:56:37,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:56:37,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 09:56:37,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:37,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:37,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 09:56:37,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 09:56:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 09:56:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:56:37,959 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-11-18 09:56:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:38,062 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-18 09:56:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 09:56:38,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-18 09:56:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:38,063 INFO L225 Difference]: With dead ends: 51 [2018-11-18 09:56:38,063 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 09:56:38,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:56:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 09:56:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 09:56:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 09:56:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-18 09:56:38,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-18 09:56:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:38,066 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-18 09:56:38,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 09:56:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-18 09:56:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 09:56:38,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:38,068 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:38,068 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:38,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 16 times [2018-11-18 09:56:38,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:56:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:56:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:38,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:56:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:56:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:56:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:56:38,092 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:56:38,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:56:38 BoogieIcfgContainer [2018-11-18 09:56:38,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:56:38,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:56:38,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:56:38,110 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:56:38,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:33" (3/4) ... [2018-11-18 09:56:38,114 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:56:38,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:56:38,115 INFO L168 Benchmark]: Toolchain (without parser) took 4568.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 954.4 MB in the beginning and 975.1 MB in the end (delta: -20.6 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:38,116 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:56:38,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.74 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:38,116 INFO L168 Benchmark]: Boogie Preprocessor took 52.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.7 MB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:38,117 INFO L168 Benchmark]: RCFGBuilder took 158.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:38,117 INFO L168 Benchmark]: TraceAbstraction took 4190.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 167.9 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:38,117 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 975.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:56:38,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.74 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.7 MB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4190.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 167.9 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 975.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; VAL [i=0, x=3, y=2, z=0] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=1, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=2, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=3, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=4, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=5, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=6, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=7, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=8, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=9, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=10, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=11, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=12, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=13, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=14, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=15, x=3, y=2] [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U VAL [i=16, x=3, y=2] [L30] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, x=3, y=2] [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) VAL [i=16, x=3, y=2] [L47] CALL __VERIFIER_assert(z == zz) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 4.1s OverallTime, 18 OverallIterations, 17 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 0 SDslu, 2447 SDs, 0 SdLazy, 1734 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 409 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 128711 SizeOfPredicates, 15 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 09:56:39,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:56:39,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:56:39,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:56:39,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:56:39,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:56:39,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:56:39,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:56:39,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:56:39,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:56:39,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:56:39,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:56:39,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:56:39,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:56:39,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:56:39,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:56:39,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:56:39,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:56:39,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:56:39,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:56:39,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:56:39,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:56:39,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:56:39,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:56:39,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:56:39,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:56:39,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:56:39,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:56:39,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:56:39,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:56:39,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:56:39,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:56:39,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:56:39,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:56:39,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:56:39,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:56:39,622 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 09:56:39,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:56:39,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:56:39,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:56:39,634 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:56:39,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:56:39,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:56:39,635 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:56:39,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:56:39,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:56:39,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:56:39,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:56:39,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:56:39,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:56:39,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 09:56:39,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:56:39,638 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 09:56:39,638 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 09:56:39,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2018-11-18 09:56:39,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:56:39,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:56:39,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:56:39,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:56:39,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:56:39,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:39,719 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/efed9391a/a09b60810d8749d5919e1146f84f6d0b/FLAG834e95699 [2018-11-18 09:56:40,024 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:56:40,024 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:40,028 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/efed9391a/a09b60810d8749d5919e1146f84f6d0b/FLAG834e95699 [2018-11-18 09:56:40,037 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/data/efed9391a/a09b60810d8749d5919e1146f84f6d0b [2018-11-18 09:56:40,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:56:40,041 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:56:40,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:56:40,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:56:40,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:56:40,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399d1882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40, skipping insertion in model container [2018-11-18 09:56:40,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:56:40,075 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:56:40,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:56:40,209 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:56:40,225 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:56:40,234 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:56:40,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40 WrapperNode [2018-11-18 09:56:40,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:56:40,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:56:40,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:56:40,235 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:56:40,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... [2018-11-18 09:56:40,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:56:40,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:56:40,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:56:40,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:56:40,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/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 [2018-11-18 09:56:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:56:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:56:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:56:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:56:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:56:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2018-11-18 09:56:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:56:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-18 09:56:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-18 09:56:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-18 09:56:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:56:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:56:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:56:40,467 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:56:40,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:40 BoogieIcfgContainer [2018-11-18 09:56:40,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:56:40,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:56:40,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:56:40,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:56:40,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:56:40" (1/3) ... [2018-11-18 09:56:40,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d444fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:40, skipping insertion in model container [2018-11-18 09:56:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:56:40" (2/3) ... [2018-11-18 09:56:40,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d444fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:56:40, skipping insertion in model container [2018-11-18 09:56:40,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:40" (3/3) ... [2018-11-18 09:56:40,474 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 09:56:40,481 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:56:40,486 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:56:40,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:56:40,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:56:40,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:56:40,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:56:40,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:56:40,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:56:40,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:56:40,518 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:56:40,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:56:40,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:56:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 09:56:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 09:56:40,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:40,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:40,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:40,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-18 09:56:40,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:40,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:40,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:40,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:40,597 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:56:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:56:40,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 09:56:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:56:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:56:40,613 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 09:56:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:40,628 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 09:56:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:56:40,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 09:56:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:40,634 INFO L225 Difference]: With dead ends: 31 [2018-11-18 09:56:40,634 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 09:56:40,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:56:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 09:56:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 09:56:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 09:56:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 09:56:40,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 09:56:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 09:56:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 09:56:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 09:56:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 09:56:40,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:40,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:40,662 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:40,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-18 09:56:40,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:40,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:40,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:40,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:40,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:56:40,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:40,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:56:40,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:56:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:56:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:56:40,718 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-18 09:56:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:40,731 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 09:56:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:56:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 09:56:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:40,732 INFO L225 Difference]: With dead ends: 21 [2018-11-18 09:56:40,733 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 09:56:40,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:56:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 09:56:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 09:56:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:56:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 09:56:40,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 09:56:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 09:56:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:56:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 09:56:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 09:56:40,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:40,738 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:40,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-18 09:56:40,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:40,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:40,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:56:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:40,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 09:56:40,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:56:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:56:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:56:40,846 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-18 09:56:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:40,898 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 09:56:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:56:40,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 09:56:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:40,899 INFO L225 Difference]: With dead ends: 27 [2018-11-18 09:56:40,899 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 09:56:40,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:56:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 09:56:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 09:56:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 09:56:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 09:56:40,904 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-18 09:56:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:40,904 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 09:56:40,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:56:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 09:56:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:56:40,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:40,905 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:40,905 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:40,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 2 times [2018-11-18 09:56:40,906 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:40,906 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:40,925 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 09:56:40,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:56:40,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:40,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:41,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:56:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:41,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:41,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 09:56:41,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:56:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:56:41,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:56:41,129 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-11-18 09:56:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:41,399 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 09:56:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:56:41,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-18 09:56:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:41,400 INFO L225 Difference]: With dead ends: 39 [2018-11-18 09:56:41,400 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 09:56:41,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:56:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 09:56:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 09:56:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 09:56:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 09:56:41,406 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-18 09:56:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:41,407 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-18 09:56:41,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:56:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 09:56:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 09:56:41,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:41,408 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:41,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:41,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:41,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 3 times [2018-11-18 09:56:41,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:41,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:41,429 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 09:56:41,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 09:56:41,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:41,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:42,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:56:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:42,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:56:42,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 09:56:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 09:56:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 09:56:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-18 09:56:42,509 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-18 09:56:43,005 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-18 09:56:43,321 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-11-18 09:56:43,520 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-18 09:56:43,713 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 09:56:44,208 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 09:56:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:44,551 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-18 09:56:44,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 09:56:44,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-18 09:56:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:44,553 INFO L225 Difference]: With dead ends: 63 [2018-11-18 09:56:44,553 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 09:56:44,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 09:56:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 09:56:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-18 09:56:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:56:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-18 09:56:44,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-11-18 09:56:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:44,565 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-18 09:56:44,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 09:56:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-18 09:56:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 09:56:44,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:44,566 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:44,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:44,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 4 times [2018-11-18 09:56:44,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:44,567 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 09:56:44,590 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:56:44,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:56:44,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:56:44,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:56:45,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:58:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 240 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:13,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:13,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2018-11-18 09:58:13,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 09:58:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 09:58:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1239, Unknown=1, NotChecked=0, Total=1560 [2018-11-18 09:58:13,073 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 40 states. [2018-11-18 09:58:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:18,763 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-18 09:58:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 09:58:18,763 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2018-11-18 09:58:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:58:18,763 INFO L225 Difference]: With dead ends: 57 [2018-11-18 09:58:18,764 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:58:18,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 88.6s TimeCoverageRelationStatistics Valid=346, Invalid=1375, Unknown=1, NotChecked=0, Total=1722 [2018-11-18 09:58:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:58:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:58:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:58:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:58:18,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-11-18 09:58:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:58:18,765 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:18,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 09:58:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:58:18,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:58:18,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:58:20,203 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 257 DAG size of output: 208 [2018-11-18 09:58:20,468 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2018-11-18 09:58:20,470 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 09:58:20,470 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:58:20,470 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:58:20,470 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 09:58:20,471 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:58:20,471 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:58:20,471 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2018-11-18 09:58:20,471 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 33) no Hoare annotation was computed. [2018-11-18 09:58:20,471 INFO L421 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 16) main_~x~0)) (.cse8 ((_ zero_extend 16) main_~y~0))) (let ((.cse12 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse7 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse8 (_ bv1 32)) (_ bv1 32)))))) (let ((.cse14 (bvor .cse12 (bvor (bvshl (bvand .cse7 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse8 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse10 (bvor .cse14 (bvor (bvshl (bvand .cse7 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse8 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse6 (bvor .cse10 (bvor (bvshl (bvand .cse7 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse8 (_ bv8 32)) (_ bv4 32)))))) (let ((.cse0 (bvor .cse6 (bvor (bvshl (bvand .cse7 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse8 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse2 (bvor (bvor .cse0 (bvor (bvshl (bvand .cse7 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse8 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse7 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse8 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse9 (bvor (bvor .cse2 (bvor (bvshl (bvand .cse7 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse8 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse7 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse8 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse11 (bvor .cse9 (bvor (bvshl (bvand .cse7 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse8 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse3 (bvor (bvor .cse11 (bvor (bvshl (bvand .cse7 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse8 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse7 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse8 (_ bv2048 32)) (_ bv12 32)))))) (let ((.cse13 (bvadd main_~i~0 (_ bv4294967295 32))) (.cse5 (bvor .cse3 (bvor (bvshl (bvand .cse7 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse8 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse4 (bvor .cse5 (bvor (bvshl (bvand .cse7 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse8 (_ bv8192 32)) (_ bv14 32))))) (.cse1 (let ((.cse15 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse7 .cse15) .cse13) (bvshl (bvand .cse8 .cse15) main_~i~0))))) (or (and (= (_ bv6 32) main_~i~0) (= main_~z~0 (bvor .cse0 .cse1))) (and (= main_~z~0 .cse2) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= main_~z~0 .cse3) (= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))) (and (= main_~z~0 .cse4) (= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))) (and (= .cse5 main_~z~0) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))) (and (= .cse0 main_~z~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= main_~z~0 .cse6) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))) (= (bvor (bvor .cse4 (bvor (bvshl (bvand .cse7 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse8 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse7 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse8 (_ bv32768 32)) (_ bv16 32)))) main_~z~0) (and (= main_~z~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= main_~z~0 .cse9)) (and (= main_~z~0 .cse10) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= main_~z~0 .cse11) (= (_ bv10 32) main_~i~0)) (and (= (_ bv11 32) main_~i~0) (= main_~z~0 (bvor .cse11 .cse1))) (and (= main_~z~0 .cse12) (= .cse13 (_ bv0 32))) (and (= (bvor .cse4 .cse1) main_~z~0) (= (_ bv15 32) main_~i~0)) (and (= (bvor .cse2 .cse1) main_~z~0) (= (_ bv8 32) main_~i~0)) (and (= main_~z~0 .cse14) (= (_ bv2 32) main_~i~0))))))))))))))) [2018-11-18 09:58:20,471 INFO L425 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2018-11-18 09:58:20,471 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed. [2018-11-18 09:58:20,472 INFO L421 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse1 (bvult (bvadd main_~i~0 (_ bv7 32)) (_ bv16 32))) (.cse2 (bvult (bvadd main_~i~0 (_ bv8 32)) (_ bv16 32))) (.cse0 (bvult (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32))) (.cse8 (bvult (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32))) (.cse17 (bvult (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32))) (.cse7 (bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32))) (.cse3 (bvult (bvadd main_~i~0 (_ bv9 32)) (_ bv16 32))) (.cse6 (bvult (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32))) (.cse18 (bvult (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)))) (and (or (not .cse0) .cse1) (or (not .cse1) .cse2) (or .cse3 (not .cse2)) (= (let ((.cse4 ((_ zero_extend 16) main_~x~0)) (.cse5 ((_ zero_extend 16) main_~y~0))) (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse4 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse5 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse4 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse5 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse4 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse5 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse4 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse5 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse4 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse5 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse4 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse5 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse4 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse5 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse4 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse5 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse4 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse5 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse4 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse5 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse4 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse5 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse4 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse5 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse4 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse5 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse4 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse5 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse4 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse5 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse4 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse5 (_ bv32768 32)) (_ bv16 32))))) main_~z~0) (or .cse6 (not .cse7)) (or .cse0 (not .cse8)) (exists ((main_~y~0 (_ BitVec 16)) (main_~x~0 (_ BitVec 16))) (let ((.cse12 ((_ zero_extend 16) main_~x~0)) (.cse16 ((_ zero_extend 16) main_~y~0))) (and (= (bvor (bvand (_ bv1431655765 32) (let ((.cse9 (bvand (_ bv858993459 32) (let ((.cse10 (bvand (_ bv252645135 32) (let ((.cse11 (bvand (_ bv16711935 32) (bvor .cse12 (bvshl .cse12 (_ bv8 32)))))) (bvor .cse11 (bvshl .cse11 (_ bv4 32))))))) (bvor .cse10 (bvshl .cse10 (_ bv2 32))))))) (bvor .cse9 (bvshl .cse9 (_ bv1 32))))) (bvshl (bvand (_ bv1431655765 32) (let ((.cse13 (bvand (_ bv858993459 32) (let ((.cse14 (bvand (_ bv252645135 32) (let ((.cse15 (bvand (_ bv16711935 32) (bvor .cse16 (bvshl .cse16 (_ bv8 32)))))) (bvor .cse15 (bvshl .cse15 (_ bv4 32))))))) (bvor .cse14 (bvshl .cse14 (_ bv2 32))))))) (bvor .cse13 (bvshl .cse13 (_ bv1 32))))) (_ bv1 32))) main_~zz~0) (= (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse12 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse16 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse12 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse16 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse12 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse16 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse12 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse16 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse12 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse16 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse12 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse16 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse12 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse16 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse12 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse16 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse12 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse16 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse12 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse16 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse12 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse16 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse12 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse16 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse12 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse16 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse12 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse16 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse12 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse16 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse12 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse16 (_ bv32768 32)) (_ bv16 32)))) main_~z~0)))) (or .cse8 (not .cse17)) (or (not .cse18) .cse17) (or .cse7 (not (bvult main_~i~0 (_ bv16 32)))) (or (bvult (bvadd main_~i~0 (_ bv10 32)) (_ bv16 32)) (not .cse3)) (or (not .cse6) .cse18))) [2018-11-18 09:58:20,472 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed. [2018-11-18 09:58:20,472 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-18 09:58:20,472 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-18 09:58:20,473 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-18 09:58:20,473 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-18 09:58:20,473 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-18 09:58:20,473 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-18 09:58:20,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:58:20 BoogieIcfgContainer [2018-11-18 09:58:20,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:58:20,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:58:20,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:58:20,500 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:58:20,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:56:40" (3/4) ... [2018-11-18 09:58:20,503 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:58:20,509 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:58:20,509 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:58:20,509 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 09:58:20,513 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 09:58:20,513 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 09:58:20,513 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 09:58:20,560 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c53d323-f30a-4384-a688-4403c4f92416/bin-2019/uautomizer/witness.graphml [2018-11-18 09:58:20,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:58:20,561 INFO L168 Benchmark]: Toolchain (without parser) took 100521.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,562 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:58:20,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,562 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,563 INFO L168 Benchmark]: RCFGBuilder took 207.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,563 INFO L168 Benchmark]: TraceAbstraction took 100031.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.9 MB). Peak memory consumption was 465.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,564 INFO L168 Benchmark]: Witness Printer took 61.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:20,565 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 207.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100031.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.9 MB). Peak memory consumption was 465.6 MB. Max. memory is 11.5 GB. * Witness Printer took 61.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((6bv32 == i && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i)))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))) && ~bvadd64(i, 4294967289bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))) && ~bvadd64(i, 4294967284bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))) && ~bvadd64(i, 4294967282bv32) == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))) == z && ~bvadd64(i, 4294967283bv32) == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))) && ~bvadd64(i, 4294967292bv32) == 0bv32)) || ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32))) == z) || (z == 0bv32 && i == 0bv32)) || (~bvadd64(i, 4294967287bv32) == 0bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))))) || (z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))) && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))) && 10bv32 == i)) || (11bv32 == i && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))))) || (z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))) && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 15bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 8bv32 == i)) || (z == ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))) && 2bv32 == i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 99.9s OverallTime, 6 OverallIterations, 17 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 SDtfs, 22 SDslu, 693 SDs, 0 SdLazy, 570 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 91.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 35 NumberOfFragments, 2877 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1461 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 399 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 89.2s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 233 ConstructedInterpolants, 1 QuantifiedInterpolants, 806570 SizeOfPredicates, 12 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 240/808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...