./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan --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 Taipan --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_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan --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 Taipan --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-1dbac8b [2018-11-10 11:38:47,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:38:47,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:38:47,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:38:47,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:38:47,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:38:47,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:38:47,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:38:47,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:38:47,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:38:47,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:38:47,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:38:47,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:38:47,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:38:47,658 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:38:47,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:38:47,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:38:47,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:38:47,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:38:47,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:38:47,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:38:47,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:38:47,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:38:47,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:38:47,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:38:47,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:38:47,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:38:47,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:38:47,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:38:47,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:38:47,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:38:47,669 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:38:47,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:38:47,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:38:47,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:38:47,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:38:47,671 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:38:47,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:38:47,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:38:47,681 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:38:47,682 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:38:47,682 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:38:47,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:38:47,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:38:47,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:38:47,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:38:47,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:38:47,685 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan 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 -> Taipan 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-10 11:38:47,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:38:47,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:38:47,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:38:47,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:38:47,718 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:38:47,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:47,754 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/2a3651018/21d40215436745cd814fdbd287cb3bb3/FLAG48b5e5bd8 [2018-11-10 11:38:48,055 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:38:48,056 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:48,061 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/2a3651018/21d40215436745cd814fdbd287cb3bb3/FLAG48b5e5bd8 [2018-11-10 11:38:48,072 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/2a3651018/21d40215436745cd814fdbd287cb3bb3 [2018-11-10 11:38:48,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:38:48,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:38:48,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:38:48,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:38:48,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:38:48,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194fdcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48, skipping insertion in model container [2018-11-10 11:38:48,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:38:48,099 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:38:48,201 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:38:48,204 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:38:48,218 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:38:48,227 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:38:48,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48 WrapperNode [2018-11-10 11:38:48,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:38:48,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:38:48,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:38:48,228 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:38:48,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:38:48,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:38:48,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:38:48,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:38:48,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... [2018-11-10 11:38:48,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:38:48,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:38:48,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:38:48,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:38:48,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:38:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:38:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:38:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:38:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:38:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:38:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 11:38:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 11:38:48,418 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:38:48,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:48 BoogieIcfgContainer [2018-11-10 11:38:48,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:38:48,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:38:48,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:38:48,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:38:48,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:38:48" (1/3) ... [2018-11-10 11:38:48,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b865ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:38:48, skipping insertion in model container [2018-11-10 11:38:48,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:48" (2/3) ... [2018-11-10 11:38:48,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b865ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:38:48, skipping insertion in model container [2018-11-10 11:38:48,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:48" (3/3) ... [2018-11-10 11:38:48,424 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:48,431 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:38:48,437 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:38:48,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:38:48,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:38:48,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:38:48,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:38:48,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:38:48,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:38:48,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:38:48,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:38:48,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:38:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-10 11:38:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 11:38:48,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:48,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:48,493 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:48,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-10 11:38:48,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:48,572 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-10 11:38:48,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:38:48,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:38:48,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:38:48,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 11:38:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:38:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:38:48,585 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-10 11:38:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:48,599 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-10 11:38:48,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:38:48,600 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 11:38:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:48,606 INFO L225 Difference]: With dead ends: 31 [2018-11-10 11:38:48,606 INFO L226 Difference]: Without dead ends: 13 [2018-11-10 11:38:48,609 INFO L605 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-10 11:38:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-10 11:38:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 11:38:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 11:38:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 11:38:48,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-10 11:38:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:48,630 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-10 11:38:48,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 11:38:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 11:38:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:38:48,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:48,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:48,631 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:48,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-10 11:38:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:48,672 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-10 11:38:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:38:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:38:48,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:38:48,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:38:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:38:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:38:48,673 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-10 11:38:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:48,680 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-10 11:38:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:38:48,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 11:38:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:48,681 INFO L225 Difference]: With dead ends: 21 [2018-11-10 11:38:48,681 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 11:38:48,681 INFO L605 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-10 11:38:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 11:38:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 11:38:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 11:38:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 11:38:48,685 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-10 11:38:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:48,685 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-10 11:38:48,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:38:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 11:38:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:38:48,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:48,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:48,686 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:48,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-10 11:38:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:48,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:48,734 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-10 11:38:48,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:48,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:48,735 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-10 11:38:48,736 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [21], [24], [26], [32], [33], [34], [36] [2018-11-10 11:38:48,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:38:48,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:38:48,841 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:38:48,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:38:48,989 INFO L272 AbstractInterpreter]: Visited 13 different actions 171 times. Merged at 4 different actions 80 times. Widened at 1 different actions 17 times. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2018-11-10 11:38:49,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:38:49,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:49,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:49,015 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:49,053 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-10 11:38:49,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:49,091 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-10 11:38:49,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:49,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 11:38:49,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:49,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:38:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:38:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:38:49,108 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-11-10 11:38:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:49,119 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-10 11:38:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:38:49,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-10 11:38:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:49,120 INFO L225 Difference]: With dead ends: 23 [2018-11-10 11:38:49,120 INFO L226 Difference]: Without dead ends: 17 [2018-11-10 11:38:49,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:38:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-10 11:38:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 11:38:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 11:38:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-10 11:38:49,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-10 11:38:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:49,124 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-10 11:38:49,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:38:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-10 11:38:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:38:49,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:49,124 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:49,125 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:49,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2097288115, now seen corresponding path program 2 times [2018-11-10 11:38:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,187 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-10 11:38:49,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:49,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:49,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:49,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:49,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:49,193 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:38:49,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 11:38:49,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:49,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:49,214 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-10 11:38:49,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:49,264 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-10 11:38:49,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:49,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 11:38:49,280 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:49,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:38:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:38:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:38:49,281 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-10 11:38:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:49,293 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-10 11:38:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:38:49,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-10 11:38:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:49,294 INFO L225 Difference]: With dead ends: 25 [2018-11-10 11:38:49,295 INFO L226 Difference]: Without dead ends: 19 [2018-11-10 11:38:49,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:38:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-10 11:38:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 11:38:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 11:38:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-10 11:38:49,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-10 11:38:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:49,301 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 11:38:49,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:38:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-10 11:38:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:38:49,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:49,302 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:49,302 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:49,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -629748883, now seen corresponding path program 3 times [2018-11-10 11:38:49,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,376 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-10 11:38:49,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:49,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:49,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:49,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:49,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:38:49,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 11:38:49,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:38:49,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:49,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:49,405 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-10 11:38:49,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:49,471 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-10 11:38:49,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-10 11:38:49,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:49,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:38:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:38:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:38:49,491 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-11-10 11:38:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:49,505 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-10 11:38:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:38:49,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 11:38:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:49,506 INFO L225 Difference]: With dead ends: 27 [2018-11-10 11:38:49,506 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 11:38:49,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:38:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 11:38:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 11:38:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 11:38:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 11:38:49,508 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-10 11:38:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:49,509 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 11:38:49,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:38:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 11:38:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:38:49,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:49,510 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:49,510 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:49,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 4 times [2018-11-10 11:38:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,565 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-10 11:38:49,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,565 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:49,565 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:49,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:49,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,566 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:49,571 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:49,589 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-10 11:38:49,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:49,672 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-10 11:38:49,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:49,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-10 11:38:49,688 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:49,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:38:49,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:38:49,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:38:49,689 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-11-10 11:38:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:49,711 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-10 11:38:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:38:49,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-10 11:38:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:49,713 INFO L225 Difference]: With dead ends: 29 [2018-11-10 11:38:49,713 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 11:38:49,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:38:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 11:38:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 11:38:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 11:38:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-10 11:38:49,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-10 11:38:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:49,718 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-10 11:38:49,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:38:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-10 11:38:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:38:49,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:49,719 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:49,719 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:49,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1310377825, now seen corresponding path program 5 times [2018-11-10 11:38:49,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:49,785 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-10 11:38:49,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:49,785 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:49,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:49,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:49,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:49,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:49,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:38:49,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 11:38:49,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:49,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:49,812 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-10 11:38:49,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:49,936 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-10 11:38:49,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:49,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-10 11:38:49,951 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:49,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:38:49,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:38:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:38:49,952 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 8 states. [2018-11-10 11:38:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:49,990 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-10 11:38:49,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:38:49,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-10 11:38:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:49,991 INFO L225 Difference]: With dead ends: 31 [2018-11-10 11:38:49,991 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 11:38:49,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:38:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 11:38:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 11:38:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 11:38:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-10 11:38:49,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-10 11:38:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:49,995 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-10 11:38:49,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:38:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-10 11:38:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:38:49,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:49,996 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:49,996 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:49,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -936293477, now seen corresponding path program 6 times [2018-11-10 11:38:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:49,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:50,087 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-10 11:38:50,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:50,087 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:50,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:50,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:50,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:38:50,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 11:38:50,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:38:50,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:50,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:50,113 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-10 11:38:50,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:50,370 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-10 11:38:50,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:50,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-10 11:38:50,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:50,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:38:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:38:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:38:50,387 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 9 states. [2018-11-10 11:38:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:50,414 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-10 11:38:50,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:38:50,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 11:38:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:50,415 INFO L225 Difference]: With dead ends: 33 [2018-11-10 11:38:50,415 INFO L226 Difference]: Without dead ends: 27 [2018-11-10 11:38:50,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:38:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-10 11:38:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 11:38:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 11:38:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 11:38:50,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-10 11:38:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:50,419 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 11:38:50,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:38:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 11:38:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 11:38:50,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:50,420 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:50,420 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:50,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:50,420 INFO L82 PathProgramCache]: Analyzing trace with hash 381135189, now seen corresponding path program 7 times [2018-11-10 11:38:50,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:50,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:50,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:50,530 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-10 11:38:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:50,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:50,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:50,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:50,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:50,550 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-10 11:38:50,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:50,835 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-10 11:38:50,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:50,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-10 11:38:50,851 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:50,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:38:50,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:38:50,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:38:50,852 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2018-11-10 11:38:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:50,882 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-10 11:38:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:38:50,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-10 11:38:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:50,883 INFO L225 Difference]: With dead ends: 35 [2018-11-10 11:38:50,883 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 11:38:50,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:38:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 11:38:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 11:38:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 11:38:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-10 11:38:50,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-10 11:38:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:50,887 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-10 11:38:50,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:38:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-10 11:38:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 11:38:50,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:50,888 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:50,888 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:50,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash -585269105, now seen corresponding path program 8 times [2018-11-10 11:38:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:50,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:50,971 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-10 11:38:50,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:50,971 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:50,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:50,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:50,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:50,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:50,978 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:38:51,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-10 11:38:51,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:51,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:51,021 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-10 11:38:51,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:51,232 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-10 11:38:51,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:51,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-10 11:38:51,248 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:51,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:38:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:38:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:38:51,248 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-11-10 11:38:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:51,284 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-10 11:38:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:38:51,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-10 11:38:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:51,285 INFO L225 Difference]: With dead ends: 37 [2018-11-10 11:38:51,285 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 11:38:51,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:38:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 11:38:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 11:38:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 11:38:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-10 11:38:51,288 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-10 11:38:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:51,288 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-10 11:38:51,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:38:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-10 11:38:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 11:38:51,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:51,289 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:51,289 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:51,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1586859703, now seen corresponding path program 9 times [2018-11-10 11:38:51,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:51,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:51,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:51,367 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-10 11:38:51,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:51,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:51,368 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:51,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:51,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:51,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:38:51,374 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 11:38:51,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:38:51,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:51,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:51,387 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-10 11:38:51,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:51,659 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-10 11:38:51,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:51,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-10 11:38:51,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:51,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 11:38:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:38:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:38:51,675 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 12 states. [2018-11-10 11:38:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:51,724 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-10 11:38:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 11:38:51,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-10 11:38:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:51,726 INFO L225 Difference]: With dead ends: 39 [2018-11-10 11:38:51,727 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 11:38:51,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:38:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 11:38:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 11:38:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 11:38:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 11:38:51,730 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-10 11:38:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:51,730 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-10 11:38:51,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 11:38:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 11:38:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 11:38:51,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:51,731 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:51,731 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:51,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 10 times [2018-11-10 11:38:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:51,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:51,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:51,829 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-10 11:38:51,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:51,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:51,829 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:51,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:51,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:51,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:51,835 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:51,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:51,873 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-10 11:38:51,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:52,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-10 11:38:52,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-10 11:38:52,156 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:52,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:38:52,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:38:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-11-10 11:38:52,157 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 13 states. [2018-11-10 11:38:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:52,206 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-10 11:38:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:38:52,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-10 11:38:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:52,206 INFO L225 Difference]: With dead ends: 41 [2018-11-10 11:38:52,206 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 11:38:52,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-11-10 11:38:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 11:38:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 11:38:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 11:38:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-10 11:38:52,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-10 11:38:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:52,210 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-10 11:38:52,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:38:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-10 11:38:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 11:38:52,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:52,211 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:52,211 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2066735299, now seen corresponding path program 11 times [2018-11-10 11:38:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:52,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:52,320 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-10 11:38:52,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:52,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:52,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:52,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:52,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:52,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:52,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:38:52,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-10 11:38:52,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:52,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:52,416 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-10 11:38:52,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:52,706 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-10 11:38:52,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:52,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-10 11:38:52,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:52,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 11:38:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 11:38:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-11-10 11:38:52,727 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 14 states. [2018-11-10 11:38:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:52,808 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-10 11:38:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 11:38:52,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-10 11:38:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:52,809 INFO L225 Difference]: With dead ends: 43 [2018-11-10 11:38:52,809 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 11:38:52,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-11-10 11:38:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 11:38:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 11:38:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 11:38:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-10 11:38:52,813 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-10 11:38:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:52,813 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-10 11:38:52,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 11:38:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-10 11:38:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 11:38:52,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:52,814 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:52,814 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:52,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 653270135, now seen corresponding path program 12 times [2018-11-10 11:38:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:52,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:52,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:52,911 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-10 11:38:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:52,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:52,911 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:52,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:52,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:38:52,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 11:38:52,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:38:52,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:52,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:52,934 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-10 11:38:52,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:53,236 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-10 11:38:53,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:53,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-10 11:38:53,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:53,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 11:38:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 11:38:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-11-10 11:38:53,253 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 15 states. [2018-11-10 11:38:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:53,308 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-10 11:38:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 11:38:53,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-11-10 11:38:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:53,309 INFO L225 Difference]: With dead ends: 45 [2018-11-10 11:38:53,309 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 11:38:53,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-11-10 11:38:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 11:38:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-10 11:38:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 11:38:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-10 11:38:53,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-10 11:38:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:53,312 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-10 11:38:53,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 11:38:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-10 11:38:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:38:53,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:53,313 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:53,313 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:53,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1056591055, now seen corresponding path program 13 times [2018-11-10 11:38:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:53,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:53,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:53,478 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-10 11:38:53,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:53,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:53,478 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:53,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:53,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:53,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:53,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:53,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:53,523 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-10 11:38:53,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:53,929 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-10 11:38:53,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-10 11:38:53,945 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:53,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 11:38:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 11:38:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2018-11-10 11:38:53,945 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 16 states. [2018-11-10 11:38:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:54,029 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-10 11:38:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:38:54,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-11-10 11:38:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:54,030 INFO L225 Difference]: With dead ends: 47 [2018-11-10 11:38:54,030 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 11:38:54,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2018-11-10 11:38:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 11:38:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 11:38:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 11:38:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-10 11:38:54,032 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-10 11:38:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:54,032 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-10 11:38:54,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 11:38:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-10 11:38:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:38:54,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:54,033 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:54,033 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:54,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 739279723, now seen corresponding path program 14 times [2018-11-10 11:38:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:54,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:54,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:54,148 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-10 11:38:54,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:54,148 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:54,148 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:54,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:54,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:54,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:54,154 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:38:54,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-10 11:38:54,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:54,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:54,715 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-10 11:38:54,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:55,109 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-10 11:38:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:55,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-10 11:38:55,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:55,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 11:38:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:38:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:38:55,126 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 17 states. [2018-11-10 11:38:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:55,201 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-10 11:38:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 11:38:55,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-10 11:38:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:55,202 INFO L225 Difference]: With dead ends: 49 [2018-11-10 11:38:55,202 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 11:38:55,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:38:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 11:38:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 11:38:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 11:38:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-10 11:38:55,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-10 11:38:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:55,205 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-10 11:38:55,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 11:38:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-10 11:38:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 11:38:55,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:55,206 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:55,206 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:55,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash -5755611, now seen corresponding path program 15 times [2018-11-10 11:38:55,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:55,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:55,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:55,351 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-10 11:38:55,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:55,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:55,352 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:38:55,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:38:55,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:55,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:38:55,357 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 11:38:55,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:38:55,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:55,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:55,378 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-10 11:38:55,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:55,846 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-10 11:38:55,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:55,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-10 11:38:55,861 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:55,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 11:38:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 11:38:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 11:38:55,862 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 18 states. [2018-11-10 11:38:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:55,956 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-10 11:38:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 11:38:55,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-11-10 11:38:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:55,957 INFO L225 Difference]: With dead ends: 51 [2018-11-10 11:38:55,957 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 11:38:55,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 11:38:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 11:38:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 11:38:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 11:38:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-10 11:38:55,960 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-10 11:38:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:55,960 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-10 11:38:55,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 11:38:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-10 11:38:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 11:38:55,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:55,962 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:55,962 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:55,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 16 times [2018-11-10 11:38:55,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:55,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:55,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:55,989 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:38:56,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:38:56 BoogieIcfgContainer [2018-11-10 11:38:56,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:38:56,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:38:56,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:38:56,017 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:38:56,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:48" (3/4) ... [2018-11-10 11:38:56,020 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:38:56,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:38:56,021 INFO L168 Benchmark]: Toolchain (without parser) took 7946.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -216.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:56,022 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:56,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.88 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:56,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.08 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:56,023 INFO L168 Benchmark]: Boogie Preprocessor took 12.47 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:56,023 INFO L168 Benchmark]: RCFGBuilder took 164.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:56,024 INFO L168 Benchmark]: TraceAbstraction took 7597.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:56,024 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:56,028 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.88 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.08 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.47 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 164.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7597.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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, 7.5s OverallTime, 18 OverallIterations, 17 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 0 SDslu, 2585 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 709 SyntacticMatches, 15 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 4.5s 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.2s AbstIntTime, 1 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.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 186278 SizeOfPredicates, 15 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4080 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-1dbac8b [2018-11-10 11:38:57,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:38:57,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:38:57,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:38:57,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:38:57,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:38:57,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:38:57,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:38:57,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:38:57,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:38:57,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:38:57,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:38:57,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:38:57,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:38:57,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:38:57,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:38:57,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:38:57,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:38:57,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:38:57,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:38:57,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:38:57,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:38:57,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:38:57,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:38:57,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:38:57,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:38:57,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:38:57,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:38:57,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:38:57,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:38:57,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:38:57,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:38:57,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:38:57,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:38:57,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:38:57,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:38:57,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 11:38:57,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:38:57,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:38:57,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:38:57,495 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:38:57,496 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:38:57,496 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:38:57,496 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:38:57,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:38:57,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:38:57,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:38:57,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:38:57,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:38:57,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:38:57,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:38:57,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:38:57,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 11:38:57,499 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 11:38:57,500 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_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan 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 -> Taipan 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-10 11:38:57,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:38:57,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:38:57,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:38:57,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:38:57,545 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:38:57,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:57,584 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/ab29ea8f4/566a18a9d98442019465702309e3e7c4/FLAG8b961fb5e [2018-11-10 11:38:57,901 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:38:57,902 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:57,906 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/ab29ea8f4/566a18a9d98442019465702309e3e7c4/FLAG8b961fb5e [2018-11-10 11:38:57,914 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/data/ab29ea8f4/566a18a9d98442019465702309e3e7c4 [2018-11-10 11:38:57,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:38:57,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:38:57,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:38:57,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:38:57,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:38:57,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:38:57" (1/1) ... [2018-11-10 11:38:57,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d33e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:57, skipping insertion in model container [2018-11-10 11:38:57,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:38:57" (1/1) ... [2018-11-10 11:38:57,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:38:57,941 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:38:58,048 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:38:58,051 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:38:58,069 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:38:58,078 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:38:58,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58 WrapperNode [2018-11-10 11:38:58,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:38:58,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:38:58,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:38:58,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:38:58,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:38:58,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:38:58,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:38:58,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:38:58,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... [2018-11-10 11:38:58,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:38:58,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:38:58,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:38:58,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:38:58,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:38:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:38:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:38:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:38:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:38:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:38:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 11:38:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 11:38:58,290 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:38:58,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:58 BoogieIcfgContainer [2018-11-10 11:38:58,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:38:58,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:38:58,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:38:58,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:38:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:38:57" (1/3) ... [2018-11-10 11:38:58,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b47fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:38:58, skipping insertion in model container [2018-11-10 11:38:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:38:58" (2/3) ... [2018-11-10 11:38:58,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b47fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:38:58, skipping insertion in model container [2018-11-10 11:38:58,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:58" (3/3) ... [2018-11-10 11:38:58,295 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-10 11:38:58,303 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:38:58,309 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:38:58,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:38:58,339 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:38:58,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:38:58,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:38:58,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:38:58,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:38:58,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:38:58,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:38:58,340 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:38:58,340 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:38:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-10 11:38:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 11:38:58,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:58,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:58,356 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:58,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-10 11:38:58,361 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:38:58,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:58,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:58,410 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-10 11:38:58,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:38:58,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:38:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:38:58,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 11:38:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:38:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:38:58,428 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-10 11:38:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:58,443 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-10 11:38:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:38:58,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 11:38:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:58,449 INFO L225 Difference]: With dead ends: 31 [2018-11-10 11:38:58,449 INFO L226 Difference]: Without dead ends: 13 [2018-11-10 11:38:58,450 INFO L605 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-10 11:38:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-10 11:38:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 11:38:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 11:38:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-10 11:38:58,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-10 11:38:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:58,471 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-10 11:38:58,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 11:38:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-10 11:38:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:38:58,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:58,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:58,472 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:58,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-10 11:38:58,473 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:38:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:58,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:58,528 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-10 11:38:58,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:38:58,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:38:58,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:38:58,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:38:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:38:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:38:58,530 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-10 11:38:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:58,541 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-10 11:38:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:38:58,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 11:38:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:58,542 INFO L225 Difference]: With dead ends: 21 [2018-11-10 11:38:58,542 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 11:38:58,542 INFO L605 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-10 11:38:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 11:38:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 11:38:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 11:38:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 11:38:58,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-10 11:38:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:58,545 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-10 11:38:58,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:38:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 11:38:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:38:58,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:58,546 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:58,546 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:58,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-10 11:38:58,547 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:38:58,547 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:58,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:58,615 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-10 11:38:58,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:58,652 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-10 11:38:58,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:58,654 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:58,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:58,675 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-10 11:38:58,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:58,705 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-10 11:38:58,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 11:38:58,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 7 [2018-11-10 11:38:58,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:38:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:38:58,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:38:58,721 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2018-11-10 11:38:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:58,798 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-10 11:38:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:38:58,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-10 11:38:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:58,800 INFO L225 Difference]: With dead ends: 27 [2018-11-10 11:38:58,800 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 11:38:58,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:38:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 11:38:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 11:38:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 11:38:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 11:38:58,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-10 11:38:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:58,807 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 11:38:58,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:38:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 11:38:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:38:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:58,808 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:58,808 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 2 times [2018-11-10 11:38:58,808 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:38:58,809 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:58,831 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 11:38:58,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:38:58,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:58,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:58,915 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-10 11:38:58,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:58,996 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-10 11:38:59,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:59,000 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:38:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:38:59,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:38:59,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:59,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:59,044 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-10 11:38:59,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:59,197 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-10 11:38:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 11:38:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 16 [2018-11-10 11:38:59,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 11:38:59,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 11:38:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:38:59,219 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 16 states. [2018-11-10 11:38:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:59,556 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-10 11:38:59,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:38:59,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-10 11:38:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:59,557 INFO L225 Difference]: With dead ends: 39 [2018-11-10 11:38:59,557 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 11:38:59,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:38:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 11:38:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 11:38:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 11:38:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 11:38:59,563 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-10 11:38:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:59,564 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-10 11:38:59,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 11:38:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 11:38:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 11:38:59,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:59,565 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:59,565 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:59,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 3 times [2018-11-10 11:38:59,566 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:38:59,566 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:38:59,577 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 11:38:59,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 11:38:59,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:59,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:39:00,052 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-10 11:39:00,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:39:00,461 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-10 11:39:00,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:39:00,463 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:39:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:39:00,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 11:39:00,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:39:00,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:39:00,563 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-10 11:39:00,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:39:00,580 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-10 11:39:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 11:39:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 24 [2018-11-10 11:39:00,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 11:39:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 11:39:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-10 11:39:00,608 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-10 11:39:01,039 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-10 11:39:01,309 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-11-10 11:39:01,504 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-10 11:39:01,697 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-10 11:39:02,156 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 11:39:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:39:02,484 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-10 11:39:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 11:39:02,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-10 11:39:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:39:02,486 INFO L225 Difference]: With dead ends: 63 [2018-11-10 11:39:02,486 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 11:39:02,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 11:39:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 11:39:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-10 11:39:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 11:39:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 11:39:02,496 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-11-10 11:39:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:39:02,497 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 11:39:02,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 11:39:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-10 11:39:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 11:39:02,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:39:02,498 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:39:02,498 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:39:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:39:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 4 times [2018-11-10 11:39:02,499 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:39:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:39:02,511 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:39:02,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:39:02,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:39:02,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:39:03,827 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-10 11:39:03,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:40:29,924 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-10 11:40:29,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:29,926 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/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-10 11:40:29,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:40:30,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:40:30,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:30,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:30,746 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-10 11:40:30,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:40:36,674 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2018-11-10 11:40:38,899 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 167 [2018-11-10 11:40:41,375 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 175 [2018-11-10 11:40:44,028 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2018-11-10 11:40:46,981 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 191 [2018-11-10 11:40:50,277 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 199 [2018-11-10 11:40:53,824 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 207 [2018-11-10 11:40:57,772 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 215 [2018-11-10 11:41:02,071 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 223 [2018-11-10 11:41:06,665 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 231 [2018-11-10 11:41:11,692 WARN L179 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 239 [2018-11-10 11:41:17,054 WARN L179 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 247 [2018-11-10 11:41:23,042 WARN L179 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 255 [2018-11-10 11:41:26,403 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2018-11-10 11:41:26,490 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-10 11:41:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 11:41:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23, 23] total 58 [2018-11-10 11:41:26,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 11:41:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 11:41:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2402, Unknown=1, NotChecked=0, Total=3306 [2018-11-10 11:41:26,511 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 58 states. [2018-11-10 11:41:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:32,135 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-10 11:41:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 11:41:32,135 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 44 [2018-11-10 11:41:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:32,136 INFO L225 Difference]: With dead ends: 61 [2018-11-10 11:41:32,136 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:41:32,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 144.0s TimeCoverageRelationStatistics Valid=947, Invalid=2592, Unknown=1, NotChecked=0, Total=3540 [2018-11-10 11:41:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:41:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:41:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:41:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:41:32,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-11-10 11:41:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:32,137 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:41:32,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 11:41:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:41:32,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:41:32,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:41:33,936 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 275 DAG size of output: 227 [2018-11-10 11:41:34,090 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 169 [2018-11-10 11:41:34,092 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 11:41:34,092 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:41:34,092 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:41:34,093 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:41:34,093 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:41:34,093 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:41:34,093 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2018-11-10 11:41:34,093 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 33) no Hoare annotation was computed. [2018-11-10 11:41:34,093 INFO L421 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 16) main_~x~0)) (.cse11 ((_ zero_extend 16) main_~y~0))) (let ((.cse8 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse10 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse11 (_ bv1 32)) (_ bv1 32)))))) (let ((.cse4 (bvor .cse8 (bvor (bvshl (bvand .cse10 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse11 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse6 (bvor (bvor .cse4 (bvor (bvshl (bvand .cse10 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse11 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse10 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse11 (_ bv8 32)) (_ bv4 32)))))) (let ((.cse7 (bvor (bvor (bvor .cse6 (bvor (bvshl (bvand .cse10 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse11 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse10 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse11 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse10 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse11 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse12 (bvor (bvor .cse7 (bvor (bvshl (bvand .cse10 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse11 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse10 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse11 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse2 (bvor .cse12 (bvor (bvshl (bvand .cse10 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse11 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse3 (bvor .cse2 (bvor (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse11 (_ bv1024 32)) (_ bv11 32)))))) (let ((.cse9 (bvadd main_~i~0 (_ bv4294967295 32))) (.cse0 (bvor (bvor .cse3 (bvor (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse11 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse11 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse1 (bvor .cse0 (bvor (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse11 (_ bv8192 32)) (_ bv14 32))))) (.cse5 (let ((.cse15 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse10 .cse15) .cse9) (bvshl (bvand .cse11 .cse15) main_~i~0))))) (or (and (= .cse0 main_~z~0) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))) (and (= main_~z~0 .cse1) (= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32)) (= main_~z~0 .cse2)) (and (= .cse3 main_~z~0) (= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))) (and (= main_~z~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= main_~z~0 (bvor .cse4 .cse5))) (and (= main_~z~0 (bvor .cse3 .cse5)) (= (_ bv12 32) main_~i~0)) (and (= main_~z~0 .cse6) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= main_~z~0 .cse7) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= main_~z~0 .cse8) (= .cse9 (_ bv0 32))) (and (= (bvor .cse1 .cse5) main_~z~0) (= (_ bv15 32) main_~i~0)) (and (= (bvor (bvor .cse1 (bvor (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse11 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse11 (_ bv32768 32)) (_ bv16 32)))) main_~z~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))) (and (= (bvor .cse7 .cse5) main_~z~0) (= (_ bv8 32) main_~i~0)) (and (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvor .cse6 .cse5) main_~z~0)) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= main_~z~0 .cse12)) (and (= main_~z~0 .cse4) (= (_ bv2 32) main_~i~0)) (and (= main_~z~0 (bvor (bvor .cse6 (let ((.cse14 (bvadd main_~i~0 (_ bv4294967294 32)))) (let ((.cse13 (bvshl (_ bv1 32) .cse14))) (bvor (bvshl (bvand .cse10 .cse13) .cse14) (bvshl (bvand .cse11 .cse13) .cse9))))) .cse5)) (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)))))))))))))) [2018-11-10 11:41:34,093 INFO L425 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2018-11-10 11:41:34,094 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed. [2018-11-10 11:41:34,094 INFO L421 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (and (exists ((main_~y~0 (_ BitVec 16)) (main_~x~0 (_ BitVec 16))) (let ((.cse3 ((_ zero_extend 16) main_~x~0)) (.cse7 ((_ zero_extend 16) main_~y~0))) (and (= main_~zz~0 (bvor (bvand (let ((.cse0 (bvand (let ((.cse1 (bvand (let ((.cse2 (bvand (bvor .cse3 (bvshl .cse3 (_ bv8 32))) (_ bv16711935 32)))) (bvor .cse2 (bvshl .cse2 (_ bv4 32)))) (_ bv252645135 32)))) (bvor .cse1 (bvshl .cse1 (_ bv2 32)))) (_ bv858993459 32)))) (bvor .cse0 (bvshl .cse0 (_ bv1 32)))) (_ bv1431655765 32)) (bvshl (bvand (let ((.cse4 (bvand (let ((.cse5 (bvand (let ((.cse6 (bvand (bvor .cse7 (bvshl .cse7 (_ bv8 32))) (_ bv16711935 32)))) (bvor .cse6 (bvshl .cse6 (_ bv4 32)))) (_ bv252645135 32)))) (bvor .cse5 (bvshl .cse5 (_ bv2 32)))) (_ bv858993459 32)))) (bvor .cse4 (bvshl .cse4 (_ bv1 32)))) (_ bv1431655765 32)) (_ bv1 32)))) (= (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse3 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse7 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse3 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse7 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse3 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse7 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse3 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse7 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse3 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse7 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse3 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse7 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse3 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse7 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse3 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse7 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse3 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse7 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse3 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse7 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse3 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse7 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse3 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse7 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse3 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse7 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse3 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse7 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse3 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse7 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse3 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse7 (_ bv32768 32)) (_ bv16 32)))) main_~z~0)))) (= (let ((.cse8 ((_ zero_extend 16) main_~x~0)) (.cse9 ((_ 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 .cse8 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse9 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse8 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse9 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse8 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse9 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse8 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse9 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse8 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse9 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse8 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse9 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse8 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse9 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse8 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse9 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse8 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse9 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse8 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse9 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse8 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse9 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse8 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse9 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse8 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse9 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse8 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse9 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse8 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse9 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse8 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse9 (_ bv32768 32)) (_ bv16 32))))) main_~z~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))) [2018-11-10 11:41:34,094 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed. [2018-11-10 11:41:34,094 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-10 11:41:34,094 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 11:41:34,095 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-10 11:41:34,095 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-10 11:41:34,095 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-10 11:41:34,095 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-10 11:41:34,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:41:34 BoogieIcfgContainer [2018-11-10 11:41:34,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:41:34,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:41:34,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:41:34,124 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:41:34,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:38:58" (3/4) ... [2018-11-10 11:41:34,128 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:41:34,133 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:41:34,134 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:41:34,134 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 11:41:34,137 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 11:41:34,137 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 11:41:34,137 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:41:34,178 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f286791-b2fb-4153-b48c-4d6bd2324e42/bin-2019/utaipan/witness.graphml [2018-11-10 11:41:34,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:41:34,179 INFO L168 Benchmark]: Toolchain (without parser) took 156261.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 950.8 MB in the beginning and 779.3 MB in the end (delta: 171.5 MB). Peak memory consumption was 391.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:41:34,179 INFO L168 Benchmark]: CDTParser took 0.16 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-10 11:41:34,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:41:34,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.95 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:41:34,181 INFO L168 Benchmark]: Boogie Preprocessor took 15.42 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:41:34,181 INFO L168 Benchmark]: RCFGBuilder took 182.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:41:34,182 INFO L168 Benchmark]: TraceAbstraction took 155832.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 1.1 GB in the beginning and 788.5 MB in the end (delta: 304.7 MB). Peak memory consumption was 409.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:41:34,183 INFO L168 Benchmark]: Witness Printer took 54.73 ms. Allocated memory is still 1.2 GB. Free memory was 788.5 MB in the beginning and 779.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:41:34,185 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.16 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 160.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.95 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.42 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 182.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 155832.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 1.1 GB in the beginning and 788.5 MB in the end (delta: 304.7 MB). Peak memory consumption was 409.0 MB. Max. memory is 11.5 GB. * Witness Printer took 54.73 ms. Allocated memory is still 1.2 GB. Free memory was 788.5 MB in the beginning and 779.3 MB 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: ((((((((((((((((~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) || (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)) || (~bvadd64(i, 4294967286bv32) == 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))))) || (~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))) == z && ~bvadd64(i, 4294967285bv32) == 0bv32)) || (z == 0bv32 && i == 0bv32)) || (~bvadd64(i, 4294967293bv32) == 0bv32 && 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), ~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(~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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) && 12bv32 == i)) || (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)) || (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(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(~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 && ~bvadd64(i, 4294967280bv32) == 0bv32)) || (~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)) || (~bvadd64(i, 4294967291bv32) == 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), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~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(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)) || (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), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~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))) && ~bvadd64(i, 4294967290bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 155.7s OverallTime, 6 OverallIterations, 17 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 26 SDslu, 793 SDs, 0 SdLazy, 597 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 340 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 146.8s 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, 13 PreInvPairs, 31 NumberOfFragments, 2806 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 576 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 144.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 445 ConstructedInterpolants, 4 QuantifiedInterpolants, 1690933 SizeOfPredicates, 24 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 240/1616 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...