./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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 d2a071cc6090a217f48ed180b566a651717a8e39 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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 d2a071cc6090a217f48ed180b566a651717a8e39 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:16:14,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:14,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:14,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:14,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:14,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:14,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:14,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:14,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:14,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:14,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:14,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:14,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:14,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:14,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:14,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:14,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:14,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:14,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:14,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:14,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:14,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:14,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:14,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:14,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:14,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:14,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:14,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:14,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:14,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:14,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:14,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:14,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:14,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:14,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:14,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:14,582 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:16:14,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:14,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:14,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:14,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:14,593 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:16:14,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:16:14,593 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:16:14,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:16:14,594 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:16:14,594 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:16:14,594 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:16:14,594 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:16:14,594 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:16:14,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:14,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:14,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:14,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:14,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:14,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:16:14,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:14,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:14,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:14,598 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_3c6a9133-52b8-470c-aa51-8393f13f1007/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 12:16:14,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:14,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:14,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:14,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:14,630 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:14,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:14,666 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/36afd8221/5f3f7927ee3d4c7badc70c25b1b122a6/FLAG0b35b168d [2018-11-23 12:16:15,065 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:15,065 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:15,069 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/36afd8221/5f3f7927ee3d4c7badc70c25b1b122a6/FLAG0b35b168d [2018-11-23 12:16:15,081 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/36afd8221/5f3f7927ee3d4c7badc70c25b1b122a6 [2018-11-23 12:16:15,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:15,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:15,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:15,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:15,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:15,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6370e18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15, skipping insertion in model container [2018-11-23 12:16:15,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:15,113 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:15,238 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:15,241 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:15,250 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:15,258 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:15,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15 WrapperNode [2018-11-23 12:16:15,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:15,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:15,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:15,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:15,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:15,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:15,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:15,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:15,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... [2018-11-23 12:16:15,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:15,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:15,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:15,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:15,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:15,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:15,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:15,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:16:15,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:16:15,432 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:15,432 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:16:15,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:15 BoogieIcfgContainer [2018-11-23 12:16:15,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:15,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:15,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:15,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:15,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:15" (1/3) ... [2018-11-23 12:16:15,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90a795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:15, skipping insertion in model container [2018-11-23 12:16:15,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:15" (2/3) ... [2018-11-23 12:16:15,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90a795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:15, skipping insertion in model container [2018-11-23 12:16:15,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:15" (3/3) ... [2018-11-23 12:16:15,437 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:15,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:15,447 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:15,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:15,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:15,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:15,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:15,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:15,475 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:15,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:15,476 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:15,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 12:16:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:16:15,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:15,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:15,493 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:15,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 12:16:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:15,559 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-23 12:16:15,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:15,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:15,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:16:15,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:15,572 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 12:16:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:15,584 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:16:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:15,586 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:16:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:15,592 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:16:15,592 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 12:16:15,595 INFO L631 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-23 12:16:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 12:16:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 12:16:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 12:16:15,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 12:16:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:15,622 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 12:16:15,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 12:16:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:16:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:15,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:15,623 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:15,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 12:16:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:15,683 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-23 12:16:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:15,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:15,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:16:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:15,684 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 12:16:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:15,693 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:16:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:15,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 12:16:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:15,694 INFO L225 Difference]: With dead ends: 21 [2018-11-23 12:16:15,694 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 12:16:15,695 INFO L631 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-23 12:16:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 12:16:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 12:16:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:16:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 12:16:15,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 12:16:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:15,698 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 12:16:15,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 12:16:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:16:15,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:15,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:15,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-23 12:16:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:15,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:15,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:15,754 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-23 12:16:15,756 INFO L202 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [20], [27], [30], [32], [38], [39], [40], [42] [2018-11-23 12:16:15,784 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:16:15,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:16:15,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:16:15,881 INFO L272 AbstractInterpreter]: Visited 13 different actions 25 times. Merged at 3 different actions 9 times. Never widened. Performed 71 root evaluator evaluations with a maximum evaluation depth of 5. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-23 12:16:15,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:15,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:16:15,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:15,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:15,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:15,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:16:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:15,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:15,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:15,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 12:16:15,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:15,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:16:15,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:16:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:15,992 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 12:16:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,012 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:16:16,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:16,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:16:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:16,013 INFO L225 Difference]: With dead ends: 24 [2018-11-23 12:16:16,013 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:16:16,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:16:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 12:16:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 12:16:16,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-11-23 12:16:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:16,017 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:16:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:16:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 12:16:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:16:16,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:16,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:16,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:16,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1182180650, now seen corresponding path program 2 times [2018-11-23 12:16:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:16,093 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:16,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:16,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:16,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:16,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 12:16:16,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:16:16,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:16,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-23 12:16:16,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:16,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:16:16,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:16:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:16,231 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-11-23 12:16:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,252 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:16:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:16,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 12:16:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:16,253 INFO L225 Difference]: With dead ends: 27 [2018-11-23 12:16:16,253 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:16:16,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:16:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 12:16:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:16:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 12:16:16,257 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-11-23 12:16:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:16,258 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 12:16:16,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:16:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 12:16:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:16:16,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:16,258 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:16,259 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:16,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2055818357, now seen corresponding path program 3 times [2018-11-23 12:16:16,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,327 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-23 12:16:16,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:16,327 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:16,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:16,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:16,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 12:16:16,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:16,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:16,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:16,421 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-23 12:16:16,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:16,465 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-23 12:16:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-23 12:16:16,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:16,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:16:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:16:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:16,480 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2018-11-23 12:16:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,540 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 12:16:16,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:16:16,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 12:16:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:16,541 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:16:16,541 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:16:16,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:16:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 12:16:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:16:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 12:16:16,546 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2018-11-23 12:16:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:16,546 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 12:16:16,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:16:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 12:16:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:16:16,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:16,547 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:16,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:16,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:16,547 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 4 times [2018-11-23 12:16:16,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:16,647 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:16,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:16,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:16,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:16:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:16,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-23 12:16:16,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:16,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:16:16,825 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-11-23 12:16:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,880 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:16:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:16:16,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 12:16:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:16,881 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:16:16,881 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:16:16,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:16:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:16:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 12:16:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:16:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:16:16,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2018-11-23 12:16:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:16,885 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:16:16,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:16:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:16:16,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:16,886 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:16,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:16,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1904607445, now seen corresponding path program 5 times [2018-11-23 12:16:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:16,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:16,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:16,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:16,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:16,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:16,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 12:16:16,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:16:16,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:17,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:17,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2018-11-23 12:16:17,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:16:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:16:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:16:17,295 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2018-11-23 12:16:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:17,387 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 12:16:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:17,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-23 12:16:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:17,388 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:16:17,388 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:17,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:16:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 12:16:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:16:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 12:16:17,393 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2018-11-23 12:16:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:17,394 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 12:16:17,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:16:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 12:16:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:16:17,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:17,394 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:17,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:17,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1015181846, now seen corresponding path program 6 times [2018-11-23 12:16:17,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:17,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:17,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:17,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:17,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:17,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:17,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:17,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:17,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:17,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:17,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 12:16:17,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:17,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:17,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:17,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:18,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2018-11-23 12:16:18,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:18,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:16:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:16:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:16:18,040 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2018-11-23 12:16:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:18,148 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 12:16:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:16:18,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 12:16:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:18,150 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:16:18,150 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:16:18,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:16:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:16:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:16:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:16:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 12:16:18,157 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2018-11-23 12:16:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:18,157 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 12:16:18,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:16:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 12:16:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:16:18,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:18,159 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:18,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:18,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -209588939, now seen corresponding path program 7 times [2018-11-23 12:16:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:18,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:18,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:18,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:18,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:16:18,265 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:16:18,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:16:18,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:18,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:18,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:16:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:18,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:18,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:16:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2018-11-23 12:16:19,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:16:19,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:16:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:16:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:16:19,116 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 17 states. [2018-11-23 12:16:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:19,189 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 12:16:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:19,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-23 12:16:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:19,190 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:16:19,190 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:16:19,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:16:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:16:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 12:16:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:16:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 12:16:19,194 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2018-11-23 12:16:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:19,195 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 12:16:19,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:16:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:16:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:19,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:19,196 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:19,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:19,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1608865354, now seen corresponding path program 8 times [2018-11-23 12:16:19,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:16:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:19,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:16:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:16:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:16:19,230 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #39#return; [?] CALL call #t~ret0 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~c~0;~x~0 := 37;~y~0 := 0;~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=0, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=1, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=2, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=3, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=4, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=5, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=6, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=7, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !(~c~0 % 256 < 8); VAL [main_~bit~0=1, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !(~c~0 % 256 < 8); VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !(~c~0 % 256 < 8); VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 12:16:19,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:16:19 BoogieIcfgContainer [2018-11-23 12:16:19,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:16:19,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:16:19,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:16:19,274 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:16:19,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:15" (3/4) ... [2018-11-23 12:16:19,277 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:16:19,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:16:19,278 INFO L168 Benchmark]: Toolchain (without parser) took 4194.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 953.8 MB in the beginning and 941.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 165.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:19,282 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:16:19,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.25 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:19,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.23 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:19,283 INFO L168 Benchmark]: Boogie Preprocessor took 11.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:16:19,284 INFO L168 Benchmark]: RCFGBuilder took 150.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:19,284 INFO L168 Benchmark]: TraceAbstraction took 3839.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 197.3 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:19,285 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:16:19,287 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.25 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 11.23 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 150.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3839.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 197.3 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) 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, 20 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 141 SDslu, 766 SDs, 0 SdLazy, 579 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 241 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, 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, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 459 ConstructedInterpolants, 70 QuantifiedInterpolants, 140610 SizeOfPredicates, 10 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 0/588 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-aa41828 [2018-11-23 12:16:20,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:20,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:20,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:20,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:20,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:20,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:20,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:20,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:20,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:20,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:20,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:20,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:20,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:20,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:20,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:20,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:20,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:20,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:20,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:20,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:20,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:20,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:20,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:20,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:20,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:20,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:20,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:20,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:20,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:20,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:20,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:20,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:20,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:20,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:20,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:20,738 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 12:16:20,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:20,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:20,749 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:20,749 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:20,750 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:16:20,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:16:20,750 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:16:20,750 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:16:20,750 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:16:20,750 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:16:20,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:20,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:20,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:20,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:20,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:20,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:20,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:20,752 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:16:20,752 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:20,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:20,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:20,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 12:16:20,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:20,756 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:16:20,756 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:16:20,756 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_3c6a9133-52b8-470c-aa51-8393f13f1007/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 12:16:20,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:20,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:20,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:20,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:20,799 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:20,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:20,840 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/821042484/6d35e5b569494cb698fcf77b02671aa5/FLAG2ae403596 [2018-11-23 12:16:21,133 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:21,134 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:21,137 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/821042484/6d35e5b569494cb698fcf77b02671aa5/FLAG2ae403596 [2018-11-23 12:16:21,146 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/data/821042484/6d35e5b569494cb698fcf77b02671aa5 [2018-11-23 12:16:21,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:21,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:21,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:21,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:21,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:21,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646da148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21, skipping insertion in model container [2018-11-23 12:16:21,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:21,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:21,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:21,282 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:21,292 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:21,301 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:21,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21 WrapperNode [2018-11-23 12:16:21,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:21,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:21,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:21,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:21,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:21,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:21,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:21,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:21,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... [2018-11-23 12:16:21,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:21,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:21,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:21,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:21,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:21,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:16:21,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:16:21,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:21,515 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:16:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:21 BoogieIcfgContainer [2018-11-23 12:16:21,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:21,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:21,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:21,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:21,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:21" (1/3) ... [2018-11-23 12:16:21,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac632d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:21, skipping insertion in model container [2018-11-23 12:16:21,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:21" (2/3) ... [2018-11-23 12:16:21,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac632d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:21, skipping insertion in model container [2018-11-23 12:16:21,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:21" (3/3) ... [2018-11-23 12:16:21,520 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 12:16:21,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:21,531 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:21,540 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:21,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:21,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:21,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:21,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:21,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:21,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:21,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:21,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:21,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 12:16:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:16:21,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:21,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:21,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:21,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 12:16:21,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:21,632 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-23 12:16:21,632 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:16:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:21,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:21,647 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 12:16:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,661 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:16:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:21,662 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:16:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:21,666 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:16:21,666 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 12:16:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-23 12:16:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 12:16:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 12:16:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 12:16:21,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 12:16:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:21,689 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 12:16:21,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 12:16:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:16:21,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:21,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:21,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 12:16:21,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:21,741 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-23 12:16:21,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:16:21,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:21,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:21,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:21,744 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 12:16:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,756 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:16:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:21,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 12:16:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:21,757 INFO L225 Difference]: With dead ends: 21 [2018-11-23 12:16:21,757 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 12:16:21,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 12:16:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 12:16:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 12:16:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:16:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 12:16:21,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 12:16:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:21,761 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 12:16:21,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 12:16:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:16:21,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:21,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:21,762 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:21,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-23 12:16:21,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:21,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:21,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:21,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:21,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:21,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 12:16:21,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 5] total 7 [2018-11-23 12:16:21,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:16:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:16:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:21,893 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-23 12:16:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,938 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:16:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:16:21,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:16:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:21,940 INFO L225 Difference]: With dead ends: 28 [2018-11-23 12:16:21,940 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:16:21,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:16:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 12:16:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:16:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 12:16:21,944 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-11-23 12:16:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:21,944 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 12:16:21,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:16:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 12:16:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:16:21,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:21,946 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:21,946 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:21,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 2 times [2018-11-23 12:16:21,946 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:21,946 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:21,966 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:21,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:21,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:21,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:22,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:22,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:22,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:22,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:22,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:22,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:22,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:22,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 12:16:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7, 8] total 18 [2018-11-23 12:16:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:16:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:16:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:16:22,335 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 18 states. [2018-11-23 12:16:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:22,920 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-23 12:16:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:16:22,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 12:16:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:22,923 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:16:22,923 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:16:22,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:16:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:16:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-11-23 12:16:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:16:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:16:22,931 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 12:16:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:22,931 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:16:22,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:16:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:16:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:22,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:22,932 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:22,932 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:22,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1137706810, now seen corresponding path program 1 times [2018-11-23 12:16:22,933 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:22,933 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:22,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:22,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:23,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:23,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:23,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:23,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:23,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:23,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 12:16:23,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11, 13] total 28 [2018-11-23 12:16:23,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:16:23,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:16:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:16:23,600 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 28 states. [2018-11-23 12:16:24,121 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2018-11-23 12:16:24,401 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2018-11-23 12:16:24,716 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2018-11-23 12:16:25,044 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2018-11-23 12:16:25,375 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2018-11-23 12:16:25,745 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2018-11-23 12:16:25,925 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-23 12:16:26,133 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-11-23 12:16:26,359 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2018-11-23 12:16:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:26,364 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-23 12:16:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:16:26,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-11-23 12:16:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:26,366 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:16:26,366 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:16:26,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=714, Invalid=1836, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:16:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:16:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-11-23 12:16:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:16:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:16:26,381 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 34 [2018-11-23 12:16:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:26,382 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:16:26,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:16:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:16:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:26,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:26,382 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:26,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:26,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1498618808, now seen corresponding path program 2 times [2018-11-23 12:16:26,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:26,383 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:26,399 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:26,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:26,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:26,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:26,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:27,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:27,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:27,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:27,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:27,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:27,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:16:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 12:16:28,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20, 21] total 51 [2018-11-23 12:16:28,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:16:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:16:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2132, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:16:28,422 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 51 states. [2018-11-23 12:16:28,929 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2018-11-23 12:16:29,235 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-11-23 12:16:29,545 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-11-23 12:16:30,095 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 117 [2018-11-23 12:16:30,779 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 108 [2018-11-23 12:16:31,421 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2018-11-23 12:16:31,894 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 114 [2018-11-23 12:16:33,639 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 125 [2018-11-23 12:16:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:33,723 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2018-11-23 12:16:33,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:16:33,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 34 [2018-11-23 12:16:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:33,724 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:16:33,724 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:16:33,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1029, Invalid=4671, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 12:16:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:16:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2018-11-23 12:16:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:16:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-23 12:16:33,735 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 34 [2018-11-23 12:16:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:33,735 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-23 12:16:33,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:16:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:16:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:33,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:33,735 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:33,736 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:33,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1717473526, now seen corresponding path program 3 times [2018-11-23 12:16:33,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 12:16:33,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 12:16:33,747 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:33,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:16:33,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:33,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:16:33,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:16:33,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:33,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/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-23 12:16:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:33,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:16:33,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:33,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:16:33,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:16:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:16:33,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 12:16:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 13 [2018-11-23 12:16:33,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:16:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:16:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:33,993 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 13 states. [2018-11-23 12:16:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:34,033 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 12:16:34,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:34,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 12:16:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:34,033 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:16:34,033 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:16:34,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:16:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:16:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:16:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:16:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:16:34,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-23 12:16:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:34,034 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:16:34,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:16:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:16:34,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:34,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:16:34,363 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 52 [2018-11-23 12:16:34,365 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:16:34,365 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 12:16:34,365 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse4 (= (_ bv37 8) main_~y~0)) (.cse2 (= (_ bv1 8) main_~y~0)) (.cse0 (= (_ bv37 8) main_~x~0)) (.cse1 (= (_ bv0 8) main_~bit~0)) (.cse3 (= (_ bv5 8) main_~y~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv2 8) main_~c~0)) (and .cse0 .cse1 .cse3 (= (_ bv4 8) main_~c~0)) (and (= (_ bv0 8) main_~c~0) .cse0 (= (_ bv0 8) main_~y~0)) (and .cse1 (= (_ bv8 8) main_~c~0) .cse0 .cse4) (and .cse0 .cse3 (= (_ bv3 8) main_~c~0)) (and .cse0 .cse4 (= (_ bv7 8) main_~c~0) (= main_~bit~0 ((_ extract 7 0) (bvand (_ bv37 32) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) main_~c~0)))))))) (and .cse0 .cse4 (= (_ bv6 8) main_~c~0)) (and .cse0 (= (_ bv1 8) main_~c~0) (not (= ((_ zero_extend 24) main_~bit~0) (_ bv0 32))) .cse2) (and .cse0 .cse1 (= (_ bv5 8) main_~c~0) .cse3))) [2018-11-23 12:16:34,366 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 28) the Hoare annotation is: (and (= (_ bv37 8) main_~x~0) (= (_ bv37 8) main_~y~0) (= (_ bv0 8) main_~bit~0) (= (_ bv8 8) main_~c~0)) [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 12:16:34,366 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 12:16:34,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:16:34 BoogieIcfgContainer [2018-11-23 12:16:34,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:16:34,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:16:34,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:16:34,378 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:16:34,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:21" (3/4) ... [2018-11-23 12:16:34,380 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:16:34,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:16:34,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:16:34,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 12:16:34,386 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 12:16:34,386 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:16:34,387 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:16:34,410 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c6a9133-52b8-470c-aa51-8393f13f1007/bin-2019/utaipan/witness.graphml [2018-11-23 12:16:34,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:16:34,411 INFO L168 Benchmark]: Toolchain (without parser) took 13263.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 951.9 MB in the beginning and 1.0 GB in the end (delta: -84.0 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:34,411 INFO L168 Benchmark]: CDTParser took 0.14 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-23 12:16:34,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:34,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.22 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:34,412 INFO L168 Benchmark]: Boogie Preprocessor took 14.10 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:16:34,412 INFO L168 Benchmark]: RCFGBuilder took 187.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:34,413 INFO L168 Benchmark]: TraceAbstraction took 12861.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.3 MB). Peak memory consumption was 295.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:16:34,413 INFO L168 Benchmark]: Witness Printer took 32.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:16:34,414 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.14 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 152.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 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 12.22 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.10 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12861.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.3 MB). Peak memory consumption was 295.0 MB. Max. memory is 11.5 GB. * Witness Printer took 32.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. 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: 21]: Loop Invariant Derived loop invariant: ((((((((((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((0bv8 == bit && 8bv8 == c) && 37bv8 == x) && 37bv8 == y)) || ((37bv8 == x && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && 37bv8 == y) && 7bv8 == c) && bit == ~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]))[7:0])) || ((37bv8 == x && 37bv8 == y) && 6bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == c) && 5bv8 == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 448 SDslu, 612 SDs, 0 SdLazy, 1010 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, 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, 7 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 24 NumberOfFragments, 137 HoareAnnotationTreeSize, 14 FomulaSimplifications, 441 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2354 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 546 ConstructedInterpolants, 0 QuantifiedInterpolants, 192687 SizeOfPredicates, 36 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 541/1196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...