./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-5842f4b [2018-11-18 11:54:40,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:54:40,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:54:40,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:54:40,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:54:40,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:54:40,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:54:40,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:54:40,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:54:40,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:54:40,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:54:40,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:54:40,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:54:40,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:54:40,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:54:40,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:54:40,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:54:40,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:54:40,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:54:40,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:54:40,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:54:40,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:54:40,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:54:40,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:54:40,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:54:40,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:54:40,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:54:40,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:54:40,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:54:40,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:54:40,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:54:40,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:54:40,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:54:40,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:54:40,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:54:40,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:54:40,498 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:54:40,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:54:40,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:54:40,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:54:40,508 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:54:40,508 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:54:40,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:54:40,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:54:40,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:54:40,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:54:40,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:54:40,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:54:40,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:54:40,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:54:40,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:54:40,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:54:40,512 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:54:40,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:54:40,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:54:40,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:54:40,513 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_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:40,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:54:40,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:54:40,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:54:40,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:54:40,551 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:54:40,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:40,614 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/060419b36/2f028dc2492547648e265bf48ea2a02e/FLAG5e230d888 [2018-11-18 11:54:40,986 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:54:40,987 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:40,991 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/060419b36/2f028dc2492547648e265bf48ea2a02e/FLAG5e230d888 [2018-11-18 11:54:41,001 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/060419b36/2f028dc2492547648e265bf48ea2a02e [2018-11-18 11:54:41,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:54:41,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:54:41,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:54:41,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:54:41,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:54:41,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba112a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41, skipping insertion in model container [2018-11-18 11:54:41,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:54:41,038 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:54:41,172 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:54:41,175 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:54:41,195 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:54:41,205 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:54:41,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41 WrapperNode [2018-11-18 11:54:41,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:54:41,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:54:41,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:54:41,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:54:41,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:54:41,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:54:41,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:54:41,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:54:41,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... [2018-11-18 11:54:41,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:54:41,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:54:41,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:54:41,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:54:41,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:54:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:54:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:54:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:54:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:54:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:54:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:54:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:54:41,441 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:54:41,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:41 BoogieIcfgContainer [2018-11-18 11:54:41,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:54:41,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:54:41,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:54:41,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:54:41,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:41" (1/3) ... [2018-11-18 11:54:41,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768e2611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:41, skipping insertion in model container [2018-11-18 11:54:41,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:41" (2/3) ... [2018-11-18 11:54:41,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768e2611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:41, skipping insertion in model container [2018-11-18 11:54:41,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:41" (3/3) ... [2018-11-18 11:54:41,448 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:41,456 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:54:41,463 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:54:41,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:54:41,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:54:41,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:54:41,504 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:54:41,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:54:41,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:54:41,504 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:54:41,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:54:41,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:54:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 11:54:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 11:54:41,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:41,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:41,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:41,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-18 11:54:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:41,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:54:41,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:54:41,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:54:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:54:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:54:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:54:41,632 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 11:54:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:41,645 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 11:54:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:54:41,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 11:54:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:41,651 INFO L225 Difference]: With dead ends: 31 [2018-11-18 11:54:41,651 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 11:54:41,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:54:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 11:54:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 11:54:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 11:54:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 11:54:41,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 11:54:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:41,683 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 11:54:41,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:54:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 11:54:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 11:54:41,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:41,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:41,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:41,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-18 11:54:41,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:41,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:41,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:54:41,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:54:41,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:54:41,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:54:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:54:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:54:41,786 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-18 11:54:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:41,798 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 11:54:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:54:41,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 11:54:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:41,799 INFO L225 Difference]: With dead ends: 21 [2018-11-18 11:54:41,799 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 11:54:41,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:54:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 11:54:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 11:54:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 11:54:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 11:54:41,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 11:54:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:41,804 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 11:54:41,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:54:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 11:54:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 11:54:41,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:41,805 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:41,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:41,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-18 11:54:41,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:41,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:41,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:41,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:41,917 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-18 11:54:41,920 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [21], [24], [26], [32], [33], [34], [36] [2018-11-18 11:54:41,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:54:41,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:54:42,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:54:42,066 INFO L272 AbstractInterpreter]: Visited 13 different actions 22 times. Merged at 2 different actions 6 times. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 5. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 9 variables. [2018-11-18 11:54:42,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:42,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:54:42,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:42,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:42,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:42,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:54:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:42,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:42,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-18 11:54:42,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:42,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:54:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:54:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:54:42,237 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-18 11:54:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:42,271 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-18 11:54:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:54:42,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 11:54:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:42,272 INFO L225 Difference]: With dead ends: 23 [2018-11-18 11:54:42,273 INFO L226 Difference]: Without dead ends: 17 [2018-11-18 11:54:42,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:54:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-18 11:54:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 11:54:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 11:54:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 11:54:42,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-18 11:54:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:42,276 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-18 11:54:42,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:54:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 11:54:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 11:54:42,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:42,277 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:42,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:42,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2097288115, now seen corresponding path program 2 times [2018-11-18 11:54:42,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:42,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:42,438 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:42,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:42,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:42,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:54:42,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 11:54:42,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:42,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:42,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-18 11:54:42,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:42,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:54:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:54:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:54:42,568 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-18 11:54:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:42,588 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-18 11:54:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:54:42,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 11:54:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:42,589 INFO L225 Difference]: With dead ends: 25 [2018-11-18 11:54:42,589 INFO L226 Difference]: Without dead ends: 19 [2018-11-18 11:54:42,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:54:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-18 11:54:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 11:54:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 11:54:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-18 11:54:42,593 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-18 11:54:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-18 11:54:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:54:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-18 11:54:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 11:54:42,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:42,594 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:42,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:42,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -629748883, now seen corresponding path program 3 times [2018-11-18 11:54:42,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:42,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:42,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:42,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:42,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:42,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:42,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:42,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 11:54:42,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:42,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:42,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:42,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:42,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-18 11:54:42,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:42,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:54:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:54:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:54:42,888 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-18 11:54:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:42,910 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-18 11:54:42,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:54:42,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 11:54:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:42,911 INFO L225 Difference]: With dead ends: 27 [2018-11-18 11:54:42,911 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 11:54:42,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:54:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 11:54:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 11:54:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 11:54:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 11:54:42,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-18 11:54:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:42,915 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 11:54:42,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:54:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 11:54:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:54:42,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:42,916 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:42,917 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:42,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 4 times [2018-11-18 11:54:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:42,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:43,077 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:43,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:43,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:54:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:43,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:43,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-18 11:54:43,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:43,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:54:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:54:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:54:43,289 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-18 11:54:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:43,315 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-18 11:54:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:54:43,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 11:54:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:43,316 INFO L225 Difference]: With dead ends: 29 [2018-11-18 11:54:43,317 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 11:54:43,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:54:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 11:54:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 11:54:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 11:54:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-18 11:54:43,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-18 11:54:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:43,321 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-18 11:54:43,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:54:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 11:54:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:54:43,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:43,321 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:43,322 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:43,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1310377825, now seen corresponding path program 5 times [2018-11-18 11:54:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:43,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:43,458 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:43,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:43,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:43,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:54:43,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 11:54:43,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:43,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:43,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-18 11:54:43,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:43,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:54:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:54:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:54:43,672 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-18 11:54:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:43,709 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-18 11:54:43,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:54:43,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 11:54:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:43,711 INFO L225 Difference]: With dead ends: 31 [2018-11-18 11:54:43,711 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 11:54:43,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:54:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 11:54:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 11:54:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 11:54:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-18 11:54:43,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-18 11:54:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:43,714 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-18 11:54:43,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:54:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-18 11:54:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:54:43,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:43,715 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:43,715 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:43,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash -936293477, now seen corresponding path program 6 times [2018-11-18 11:54:43,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:43,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:43,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:43,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:43,863 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:43,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:43,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:43,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:43,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 11:54:43,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:43,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:43,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:43,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:44,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-18 11:54:44,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:44,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:54:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:54:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:54:44,147 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-18 11:54:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:44,176 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-18 11:54:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:54:44,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-18 11:54:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:44,178 INFO L225 Difference]: With dead ends: 33 [2018-11-18 11:54:44,178 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 11:54:44,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:54:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 11:54:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 11:54:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 11:54:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-18 11:54:44,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-18 11:54:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:44,182 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-18 11:54:44,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:54:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-18 11:54:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:54:44,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:44,183 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:44,183 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:44,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 381135189, now seen corresponding path program 7 times [2018-11-18 11:54:44,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:44,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:44,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:44,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:44,383 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:44,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:44,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:44,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:44,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:44,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:54:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:44,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-18 11:54:44,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:44,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:54:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:54:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:54:44,618 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-18 11:54:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:44,671 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-18 11:54:44,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:54:44,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-18 11:54:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:44,679 INFO L225 Difference]: With dead ends: 35 [2018-11-18 11:54:44,679 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 11:54:44,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:54:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 11:54:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 11:54:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:54:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-18 11:54:44,683 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-18 11:54:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:44,684 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-18 11:54:44,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:54:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-18 11:54:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:54:44,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:44,685 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:44,685 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:44,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash -585269105, now seen corresponding path program 8 times [2018-11-18 11:54:44,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:44,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:44,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:44,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:44,844 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:44,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:44,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:44,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:44,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:44,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:54:44,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-18 11:54:44,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:44,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:44,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:45,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:45,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-18 11:54:45,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:45,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:54:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:54:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:54:45,114 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-11-18 11:54:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:45,158 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-18 11:54:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:54:45,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-18 11:54:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:45,160 INFO L225 Difference]: With dead ends: 37 [2018-11-18 11:54:45,160 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 11:54:45,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:54:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 11:54:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 11:54:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 11:54:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-18 11:54:45,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-18 11:54:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-18 11:54:45,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:54:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-18 11:54:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:54:45,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:45,165 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:45,165 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:45,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1586859703, now seen corresponding path program 9 times [2018-11-18 11:54:45,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:45,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:45,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:45,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:45,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:45,306 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:45,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:45,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:45,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:45,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 11:54:45,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:45,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:45,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:45,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:45,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:45,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-18 11:54:45,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:45,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:54:45,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:54:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2018-11-18 11:54:45,570 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-11-18 11:54:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:45,642 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-18 11:54:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:54:45,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-18 11:54:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:45,643 INFO L225 Difference]: With dead ends: 39 [2018-11-18 11:54:45,643 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 11:54:45,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2018-11-18 11:54:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 11:54:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 11:54:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 11:54:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 11:54:45,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-18 11:54:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:45,647 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-18 11:54:45,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:54:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 11:54:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:54:45,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:45,648 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:45,648 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:45,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:45,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 10 times [2018-11-18 11:54:45,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:45,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:45,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:45,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:45,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:45,807 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-18 11:54:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:45,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:45,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:45,940 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:45,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:45,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:45,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:45,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:54:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:45,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:46,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:46,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:46,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-18 11:54:46,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:46,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:54:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:54:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-11-18 11:54:46,255 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-11-18 11:54:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:46,463 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-18 11:54:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:54:46,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-18 11:54:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:46,465 INFO L225 Difference]: With dead ends: 41 [2018-11-18 11:54:46,465 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 11:54:46,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-11-18 11:54:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 11:54:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 11:54:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 11:54:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-18 11:54:46,469 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-18 11:54:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:46,469 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-18 11:54:46,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:54:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-18 11:54:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:54:46,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:46,470 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:46,470 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:46,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2066735299, now seen corresponding path program 11 times [2018-11-18 11:54:46,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:46,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:46,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:46,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:46,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:46,614 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:46,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:46,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:46,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:46,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:54:46,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-18 11:54:46,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:46,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:46,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-18 11:54:47,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 11:54:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 11:54:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-11-18 11:54:47,069 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-18 11:54:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:47,168 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-18 11:54:47,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:54:47,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-18 11:54:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:47,169 INFO L225 Difference]: With dead ends: 43 [2018-11-18 11:54:47,170 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 11:54:47,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-11-18 11:54:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 11:54:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 11:54:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 11:54:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-18 11:54:47,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-18 11:54:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:47,174 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-18 11:54:47,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 11:54:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-18 11:54:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:54:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:47,175 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:47,175 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:47,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:47,175 INFO L82 PathProgramCache]: Analyzing trace with hash 653270135, now seen corresponding path program 12 times [2018-11-18 11:54:47,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:47,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:47,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:47,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:47,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:47,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:47,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:47,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:47,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:47,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 11:54:47,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:47,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:47,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:47,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:47,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-18 11:54:47,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:47,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 11:54:47,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 11:54:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2018-11-18 11:54:47,721 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-11-18 11:54:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:47,880 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-18 11:54:47,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:54:47,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-18 11:54:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:47,881 INFO L225 Difference]: With dead ends: 45 [2018-11-18 11:54:47,881 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 11:54:47,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2018-11-18 11:54:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 11:54:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 11:54:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 11:54:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-18 11:54:47,885 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-18 11:54:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:47,885 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-18 11:54:47,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 11:54:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 11:54:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:54:47,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:47,886 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:47,886 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:47,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1056591055, now seen corresponding path program 13 times [2018-11-18 11:54:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:47,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:47,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:48,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:48,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:48,071 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:48,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:48,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:48,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:48,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:48,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:54:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:48,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:48,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-18 11:54:48,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:48,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 11:54:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:54:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-11-18 11:54:48,425 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-11-18 11:54:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:48,518 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-18 11:54:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 11:54:48,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-18 11:54:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:48,519 INFO L225 Difference]: With dead ends: 47 [2018-11-18 11:54:48,519 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 11:54:48,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-11-18 11:54:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 11:54:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 11:54:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 11:54:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-18 11:54:48,526 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-18 11:54:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:48,526 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-18 11:54:48,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 11:54:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-18 11:54:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:54:48,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:48,527 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:48,527 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:48,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 739279723, now seen corresponding path program 14 times [2018-11-18 11:54:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:48,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:48,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:48,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:48,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:48,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:48,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:48,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:54:48,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-18 11:54:48,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:48,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:48,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-18 11:54:49,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 11:54:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 11:54:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 11:54:49,277 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-11-18 11:54:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:49,393 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-18 11:54:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:54:49,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-18 11:54:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:49,394 INFO L225 Difference]: With dead ends: 49 [2018-11-18 11:54:49,394 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 11:54:49,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 11:54:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 11:54:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 11:54:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 11:54:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-18 11:54:49,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-18 11:54:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:49,398 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-18 11:54:49,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 11:54:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-18 11:54:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:54:49,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:49,399 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:49,400 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:49,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash -5755611, now seen corresponding path program 15 times [2018-11-18 11:54:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:49,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:49,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:49,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:49,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:54:49,589 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:54:49,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:54:49,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:49,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:49,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 11:54:49,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:49,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:49,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:49,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:50,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:54:50,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-18 11:54:50,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:54:50,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 11:54:50,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 11:54:50,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 11:54:50,039 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-11-18 11:54:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:50,146 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-18 11:54:50,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 11:54:50,147 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-18 11:54:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:50,147 INFO L225 Difference]: With dead ends: 51 [2018-11-18 11:54:50,147 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 11:54:50,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 11:54:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 11:54:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 11:54:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 11:54:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-18 11:54:50,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-18 11:54:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:50,151 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-18 11:54:50,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 11:54:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-18 11:54:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 11:54:50,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:50,152 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:50,152 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:50,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 16 times [2018-11-18 11:54:50,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:54:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:50,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:54:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:54:50,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:54:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:54:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:54:50,182 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 11:54:50,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:50 BoogieIcfgContainer [2018-11-18 11:54:50,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:54:50,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:54:50,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:54:50,214 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:54:50,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:41" (3/4) ... [2018-11-18 11:54:50,219 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:54:50,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:54:50,220 INFO L168 Benchmark]: Toolchain (without parser) took 9216.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,221 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:54:50,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 945.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,222 INFO L168 Benchmark]: Boogie Preprocessor took 62.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,223 INFO L168 Benchmark]: RCFGBuilder took 155.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,223 INFO L168 Benchmark]: TraceAbstraction took 8770.64 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.1 GB in the end (delta: 5.5 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:54:50,224 INFO L168 Benchmark]: Witness Printer took 6.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:54:50,226 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 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.5 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 17.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 945.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8770.64 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.1 GB in the end (delta: 5.5 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 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, 8.7s OverallTime, 18 OverallIterations, 17 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 331 SDtfs, 0 SDslu, 2465 SDs, 0 SdLazy, 1738 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 694 SyntacticMatches, 15 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 5.4s 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.1s 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.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 189606 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-5842f4b [2018-11-18 11:54:51,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:54:51,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:54:51,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:54:51,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:54:51,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:54:51,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:54:51,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:54:51,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:54:51,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:54:51,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:54:51,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:54:51,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:54:51,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:54:51,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:54:51,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:54:51,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:54:51,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:54:51,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:54:51,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:54:51,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:54:51,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:54:51,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:54:51,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:54:51,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:54:51,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:54:51,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:54:51,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:54:51,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:54:51,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:54:51,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:54:51,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:54:51,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:54:51,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:54:51,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:54:51,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:54:51,974 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 11:54:51,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:54:51,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:54:51,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:54:51,985 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:54:51,985 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:54:51,985 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:54:51,985 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:54:51,985 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:54:51,985 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:54:51,986 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:54:51,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:54:51,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:54:51,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:54:51,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:54:51,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:54:51,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:54:51,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:54:51,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:54:51,989 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 11:54:51,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:54:51,989 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 11:54:51,989 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 11:54:51,989 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_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:52,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:54:52,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:54:52,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:54:52,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:54:52,035 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:54:52,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:52,084 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/4cacbf01c/30fac8e8c8ff4c778b417bf4e69b6cc3/FLAGe9382b0ef [2018-11-18 11:54:52,410 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:54:52,410 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/sv-benchmarks/c/bitvector/interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:52,414 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/4cacbf01c/30fac8e8c8ff4c778b417bf4e69b6cc3/FLAGe9382b0ef [2018-11-18 11:54:52,423 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/data/4cacbf01c/30fac8e8c8ff4c778b417bf4e69b6cc3 [2018-11-18 11:54:52,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:54:52,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:54:52,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:54:52,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:54:52,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:54:52,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27184d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52, skipping insertion in model container [2018-11-18 11:54:52,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:54:52,461 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:54:52,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:54:52,590 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:54:52,606 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:54:52,617 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:54:52,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52 WrapperNode [2018-11-18 11:54:52,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:54:52,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:54:52,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:54:52,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:54:52,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:54:52,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:54:52,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:54:52,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:54:52,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... [2018-11-18 11:54:52,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:54:52,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:54:52,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:54:52,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:54:52,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:54:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:54:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:54:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:54:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:54:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:54:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:54:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:54:52,881 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:54:52,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:52 BoogieIcfgContainer [2018-11-18 11:54:52,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:54:52,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:54:52,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:54:52,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:54:52,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:52" (1/3) ... [2018-11-18 11:54:52,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f031a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:52, skipping insertion in model container [2018-11-18 11:54:52,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:52" (2/3) ... [2018-11-18 11:54:52,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f031a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:52, skipping insertion in model container [2018-11-18 11:54:52,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:52" (3/3) ... [2018-11-18 11:54:52,887 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits_true-unreach-call_true-no-overflow.i [2018-11-18 11:54:52,896 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:54:52,910 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:54:52,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:54:52,961 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:54:52,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:54:52,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:54:52,963 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:54:52,963 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:54:52,963 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:54:52,963 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:54:52,963 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:54:52,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:54:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 11:54:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 11:54:52,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:52,985 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:52,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:52,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566135, now seen corresponding path program 1 times [2018-11-18 11:54:53,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:53,004 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:53,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:54:53,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:54:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:54:53,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:54:53,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:54:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:54:53,087 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 11:54:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:53,100 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 11:54:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:54:53,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 11:54:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:53,106 INFO L225 Difference]: With dead ends: 31 [2018-11-18 11:54:53,106 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 11:54:53,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:54:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 11:54:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 11:54:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 11:54:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 11:54:53,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 11:54:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:53,139 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 11:54:53,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:54:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 11:54:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 11:54:53,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:53,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:53,140 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:53,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1870991551, now seen corresponding path program 1 times [2018-11-18 11:54:53,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:53,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:54:53,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:54:53,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:54:53,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:54:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:54:53,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:54:53,202 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-18 11:54:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:53,216 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 11:54:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:54:53,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 11:54:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:53,217 INFO L225 Difference]: With dead ends: 21 [2018-11-18 11:54:53,217 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 11:54:53,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:54:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 11:54:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 11:54:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 11:54:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 11:54:53,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 11:54:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:53,221 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 11:54:53,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:54:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 11:54:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 11:54:53,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:53,222 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:53,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:53,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 942585209, now seen corresponding path program 1 times [2018-11-18 11:54:53,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:53,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:53,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:53,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:54:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:54:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:54:53,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 7 [2018-11-18 11:54:53,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:54:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:54:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:54:53,458 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2018-11-18 11:54:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:53,563 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 11:54:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:54:53,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-18 11:54:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:53,564 INFO L225 Difference]: With dead ends: 27 [2018-11-18 11:54:53,564 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 11:54:53,565 INFO L604 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-18 11:54:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 11:54:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 11:54:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 11:54:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 11:54:53,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-18 11:54:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:53,569 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 11:54:53,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:54:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 11:54:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:54:53,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:53,570 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:53,570 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:53,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1382253401, now seen corresponding path program 2 times [2018-11-18 11:54:53,571 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:53,571 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 11:54:53,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:54:53,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:53,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:53,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:53,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 11:54:53,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:54:53,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:53,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:53,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:54,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:54:54,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 16 [2018-11-18 11:54:54,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 11:54:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 11:54:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:54:54,168 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 16 states. [2018-11-18 11:54:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:54,700 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 11:54:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:54:54,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-18 11:54:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:54,701 INFO L225 Difference]: With dead ends: 39 [2018-11-18 11:54:54,701 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 11:54:54,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:54:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 11:54:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 11:54:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 11:54:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-18 11:54:54,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-18 11:54:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:54,707 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-18 11:54:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 11:54:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-18 11:54:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:54:54,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:54,708 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:54,709 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:54,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2042750077, now seen corresponding path program 3 times [2018-11-18 11:54:54,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:54,710 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:54,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:55,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 11:54:55,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:55,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:55,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:55,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:54:55,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:54:55,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 11:54:55,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:55,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:54:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:56,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:54:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:54:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:54:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 24 [2018-11-18 11:54:56,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 11:54:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 11:54:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-18 11:54:56,070 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-18 11:54:56,737 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-18 11:54:57,066 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-11-18 11:54:57,284 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-18 11:54:57,494 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 11:54:58,072 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 11:54:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:54:58,503 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-18 11:54:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 11:54:58,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-18 11:54:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:54:58,505 INFO L225 Difference]: With dead ends: 63 [2018-11-18 11:54:58,505 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 11:54:58,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 11:54:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 11:54:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-18 11:54:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 11:54:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-18 11:54:58,515 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-11-18 11:54:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:54:58,515 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-18 11:54:58,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 11:54:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-18 11:54:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 11:54:58,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:54:58,516 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:54:58,516 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:54:58,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:54:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1274826847, now seen corresponding path program 4 times [2018-11-18 11:54:58,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:54:58,517 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:54:58,549 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:54:58,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:54:58,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:54:58,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:55:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:55:00,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:56:47,962 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2018-11-18 11:56:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 240 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:56:48,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:56:48,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/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-18 11:56:48,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 11:56:48,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 11:56:48,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:56:48,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:56:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:56:49,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:56:54,006 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 151 [2018-11-18 11:56:56,359 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2018-11-18 11:56:59,129 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 167 [2018-11-18 11:57:02,098 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 175 [2018-11-18 11:57:05,383 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2018-11-18 11:57:09,120 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 191 [2018-11-18 11:57:12,908 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 199 [2018-11-18 11:57:16,951 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 207 [2018-11-18 11:57:21,748 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 215 [2018-11-18 11:57:26,765 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 223 [2018-11-18 11:57:31,785 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 231 [2018-11-18 11:57:37,655 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 239 [2018-11-18 11:57:43,994 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 247 [2018-11-18 11:57:50,864 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 255 [2018-11-18 11:57:54,956 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2018-11-18 11:57:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:57:55,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:57:55,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23, 23] total 58 [2018-11-18 11:57:55,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-18 11:57:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-18 11:57:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2402, Unknown=1, NotChecked=0, Total=3306 [2018-11-18 11:57:55,055 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 58 states. [2018-11-18 11:58:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:58:01,595 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-18 11:58:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 11:58:01,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 44 [2018-11-18 11:58:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:58:01,596 INFO L225 Difference]: With dead ends: 61 [2018-11-18 11:58:01,596 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:58:01,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 176.5s TimeCoverageRelationStatistics Valid=947, Invalid=2592, Unknown=1, NotChecked=0, Total=3540 [2018-11-18 11:58:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:58:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:58:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:58:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:58:01,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-11-18 11:58:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:58:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:58:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-18 11:58:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:58:01,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:58:01,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:58:03,708 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 275 DAG size of output: 227 [2018-11-18 11:58:03,868 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 169 [2018-11-18 11:58:03,870 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:58:03,870 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:58:03,870 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:58:03,870 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2018-11-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 33) no Hoare annotation was computed. [2018-11-18 11:58:03,870 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-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2018-11-18 11:58:03,870 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L421 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (and (= (let ((.cse0 ((_ zero_extend 16) main_~x~0)) (.cse1 ((_ 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 .cse0 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse1 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse0 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse1 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse1 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse1 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse0 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse1 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse1 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse1 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse1 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse0 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse1 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse0 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse1 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse1 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse1 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse1 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse1 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse1 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse1 (_ bv32768 32)) (_ bv16 32))))) main_~z~0) (exists ((main_~y~0 (_ BitVec 16)) (main_~x~0 (_ BitVec 16))) (let ((.cse5 ((_ zero_extend 16) main_~x~0)) (.cse9 ((_ zero_extend 16) main_~y~0))) (and (= (bvor (bvand (_ bv1431655765 32) (let ((.cse2 (bvand (_ bv858993459 32) (let ((.cse3 (bvand (_ bv252645135 32) (let ((.cse4 (bvand (_ bv16711935 32) (bvor .cse5 (bvshl .cse5 (_ bv8 32)))))) (bvor .cse4 (bvshl .cse4 (_ bv4 32))))))) (bvor .cse3 (bvshl .cse3 (_ bv2 32))))))) (bvor .cse2 (bvshl .cse2 (_ bv1 32))))) (bvshl (bvand (_ bv1431655765 32) (let ((.cse6 (bvand (_ bv858993459 32) (let ((.cse7 (bvand (_ bv252645135 32) (let ((.cse8 (bvand (_ bv16711935 32) (bvor .cse9 (bvshl .cse9 (_ bv8 32)))))) (bvor .cse8 (bvshl .cse8 (_ bv4 32))))))) (bvor .cse7 (bvshl .cse7 (_ bv2 32))))))) (bvor .cse6 (bvshl .cse6 (_ bv1 32))))) (_ bv1 32))) main_~zz~0) (= (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse5 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse9 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse5 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse9 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse5 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse9 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse5 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse9 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse5 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse9 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse5 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse9 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse5 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse9 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse5 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse9 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse5 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse9 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse5 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse9 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse5 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse9 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse5 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse9 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse5 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse9 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse5 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse9 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse5 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse9 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse5 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse9 (_ bv32768 32)) (_ bv16 32)))) main_~z~0)))) (= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))) [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-18 11:58:03,871 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-18 11:58:03,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:58:03 BoogieIcfgContainer [2018-11-18 11:58:03,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:58:03,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:58:03,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:58:03,903 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:58:03,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:52" (3/4) ... [2018-11-18 11:58:03,907 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:58:03,912 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:58:03,913 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:58:03,913 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 11:58:03,916 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 11:58:03,917 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 11:58:03,917 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:58:03,959 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a34945d9-ccd0-4c22-873b-06d75e732de0/bin-2019/utaipan/witness.graphml [2018-11-18 11:58:03,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:58:03,960 INFO L168 Benchmark]: Toolchain (without parser) took 191533.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -277.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:58:03,960 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-18 11:58:03,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.02 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:58:03,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.89 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:58:03,961 INFO L168 Benchmark]: Boogie Preprocessor took 17.83 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:58:03,961 INFO L168 Benchmark]: RCFGBuilder took 231.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:58:03,962 INFO L168 Benchmark]: TraceAbstraction took 191020.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.7 MB). Peak memory consumption was 436.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:58:03,962 INFO L168 Benchmark]: Witness Printer took 55.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:58:03,966 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 190.02 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.89 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.83 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191020.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.7 MB). Peak memory consumption was 436.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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, 190.9s OverallTime, 6 OverallIterations, 17 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 26 SDslu, 793 SDs, 0 SdLazy, 597 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 340 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 180.1s 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, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 177.4s 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...