./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.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_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 0d29117e01c2d68b456be2ae55b4c10d8b73c290 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:12:27,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:12:27,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:12:27,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:12:27,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:12:27,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:12:27,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:12:27,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:12:27,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:12:27,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:12:27,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:12:27,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:12:27,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:12:27,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:12:27,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:12:27,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:12:27,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:12:27,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:12:27,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:12:27,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:12:27,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:12:27,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:12:27,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:12:27,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:12:27,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:12:27,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:12:27,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:12:27,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:12:27,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:12:27,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:12:27,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:12:27,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:12:27,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:12:27,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:12:27,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:12:27,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:12:27,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:12:27,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:12:27,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:12:27,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:12:27,398 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:12:27,399 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:12:27,399 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:12:27,399 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:12:27,399 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:12:27,400 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:12:27,400 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:12:27,400 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:12:27,400 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:12:27,400 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:12:27,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:12:27,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:12:27,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:12:27,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:12:27,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:12:27,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:12:27,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:12:27,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:12:27,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:12:27,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:12:27,403 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:12:27,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:12:27,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:12:27,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:12:27,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:12:27,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:12:27,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:12:27,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:12:27,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:12:27,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:12:27,406 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:12:27,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:12:27,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:12:27,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:12:27,407 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_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 -> 0d29117e01c2d68b456be2ae55b4c10d8b73c290 [2018-11-23 00:12:27,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:12:27,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:12:27,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:12:27,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:12:27,455 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:12:27,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 00:12:27,512 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/data/09e7844f3/0e4bdc67da1546bab36fc53af7440a27/FLAGc11e6f417 [2018-11-23 00:12:27,864 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:12:27,864 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 00:12:27,868 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/data/09e7844f3/0e4bdc67da1546bab36fc53af7440a27/FLAGc11e6f417 [2018-11-23 00:12:27,879 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/data/09e7844f3/0e4bdc67da1546bab36fc53af7440a27 [2018-11-23 00:12:27,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:12:27,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:12:27,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:12:27,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:12:27,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:12:27,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:12:27" (1/1) ... [2018-11-23 00:12:27,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c8d80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:27, skipping insertion in model container [2018-11-23 00:12:27,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:12:27" (1/1) ... [2018-11-23 00:12:27,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:12:27,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:12:28,077 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:12:28,080 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:12:28,090 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:12:28,100 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:12:28,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28 WrapperNode [2018-11-23 00:12:28,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:12:28,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:12:28,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:12:28,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:12:28,108 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:12:28" (1/1) ... [2018-11-23 00:12:28,112 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:12:28" (1/1) ... [2018-11-23 00:12:28,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:12:28,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:12:28,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:12:28,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:12:28,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... [2018-11-23 00:12:28,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:12:28,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:12:28,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:12:28,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:12:28,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:12:28,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:12:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:12:28,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:12:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:12:28,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:12:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 00:12:28,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 00:12:28,351 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:12:28,351 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:12:28,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:28 BoogieIcfgContainer [2018-11-23 00:12:28,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:12:28,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:12:28,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:12:28,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:12:28,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:12:27" (1/3) ... [2018-11-23 00:12:28,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327a2a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:12:28, skipping insertion in model container [2018-11-23 00:12:28,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:28" (2/3) ... [2018-11-23 00:12:28,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327a2a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:12:28, skipping insertion in model container [2018-11-23 00:12:28,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:28" (3/3) ... [2018-11-23 00:12:28,358 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-23 00:12:28,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:12:28,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:12:28,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:12:28,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:12:28,406 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:12:28,406 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:12:28,406 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:12:28,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:12:28,406 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:12:28,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:12:28,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:12:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 00:12:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:12:28,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:28,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:28,426 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 00:12:28,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:28,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:28,587 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 00:12:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:12:28,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:12:28,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:12:28,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:12:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:12:28,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:12:28,604 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 00:12:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:28,627 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 00:12:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:12:28,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 00:12:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:28,634 INFO L225 Difference]: With dead ends: 29 [2018-11-23 00:12:28,634 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 00:12:28,637 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 00:12:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 00:12:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 00:12:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 00:12:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 00:12:28,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 00:12:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:28,672 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 00:12:28,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:12:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 00:12:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:12:28,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:28,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:28,673 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:28,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 00:12:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:28,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:28,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:28,761 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 00:12:28,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:28,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:12:28,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-11-23 00:12:28,763 INFO L202 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2018-11-23 00:12:28,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:12:28,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:12:28,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:12:28,905 INFO L272 AbstractInterpreter]: Visited 11 different actions 17 times. Merged at 1 different actions 3 times. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 6. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 3 variables. [2018-11-23 00:12:28,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:28,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:12:28,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:28,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:28,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:28,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:12:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:28,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:28,975 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 00:12:28,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:12:29,012 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 00:12:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:12:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 00:12:29,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:12:29,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:12:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:12:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:12:29,033 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 00:12:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:29,049 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 00:12:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:12:29,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 00:12:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:29,050 INFO L225 Difference]: With dead ends: 18 [2018-11-23 00:12:29,050 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 00:12:29,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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 00:12:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 00:12:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 00:12:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 00:12:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 00:12:29,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 00:12:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:29,055 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 00:12:29,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:12:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 00:12:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 00:12:29,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:29,056 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:29,056 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:29,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 00:12:29,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:12:29,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:12:29,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:12:29,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:12:29,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:12:29,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 00:12:29,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:12:29,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:12:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:12:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 00:12:29,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:12:29,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:12:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:12:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:12:29,256 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 00:12:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:29,275 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 00:12:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:12:29,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 00:12:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:29,276 INFO L225 Difference]: With dead ends: 19 [2018-11-23 00:12:29,276 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 00:12:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:12:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 00:12:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 00:12:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 00:12:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 00:12:29,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 00:12:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:29,279 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 00:12:29,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:12:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 00:12:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 00:12:29,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:29,280 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:29,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:29,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 00:12:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:12:29,374 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:12:29,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:12:29,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:12:29,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:12:29,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:12:29,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:12:29,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:12:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:12:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 00:12:29,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:12:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:12:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:12:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:12:29,497 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 00:12:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:29,518 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 00:12:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:12:29,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 00:12:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:29,519 INFO L225 Difference]: With dead ends: 20 [2018-11-23 00:12:29,519 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 00:12:29,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:12:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 00:12:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 00:12:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 00:12:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 00:12:29,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 00:12:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:29,522 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 00:12:29,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:12:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 00:12:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:12:29,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:29,523 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:29,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:29,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-11-23 00:12:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:12:29,591 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:12:29,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:12:29,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:29,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:29,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:12:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:29,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:12:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:12:29,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 00:12:29,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:12:29,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:12:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:12:29,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:12:29,737 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-11-23 00:12:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:29,775 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 00:12:29,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:12:29,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 00:12:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:29,781 INFO L225 Difference]: With dead ends: 21 [2018-11-23 00:12:29,781 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 00:12:29,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:12:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 00:12:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 00:12:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 00:12:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 00:12:29,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 00:12:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:29,786 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 00:12:29,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:12:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 00:12:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 00:12:29,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:29,787 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:29,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:29,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-11-23 00:12:29,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:29,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:29,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:12:29,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:12:29,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:12:29,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:29,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/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 00:12:29,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:12:29,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:12:29,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 00:12:29,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:12:29,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:29,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:12:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:30,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:12:30,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-23 00:12:30,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:12:30,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:12:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:12:30,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:12:30,042 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 00:12:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:30,097 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 00:12:30,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:12:30,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 00:12:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:12:30,098 INFO L225 Difference]: With dead ends: 22 [2018-11-23 00:12:30,098 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 00:12:30,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:12:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 00:12:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 00:12:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:12:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 00:12:30,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 00:12:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:12:30,102 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 00:12:30,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:12:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 00:12:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 00:12:30,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:12:30,103 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:12:30,103 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:12:30,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-11-23 00:12:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:12:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:30,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:30,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:12:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:30,137 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0;~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=1, main_~y~0=2] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=2, main_~y~0=4] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=3, main_~y~0=8] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=4, main_~y~0=16] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=5, main_~y~0=32] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=6, main_~y~0=64] [?] assume !(~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [?] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 00:12:30,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:12:30 BoogieIcfgContainer [2018-11-23 00:12:30,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:12:30,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:12:30,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:12:30,170 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:12:30,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:28" (3/4) ... [2018-11-23 00:12:30,172 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0;~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=1, main_~y~0=2] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=2, main_~y~0=4] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=3, main_~y~0=8] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=4, main_~y~0=16] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=5, main_~y~0=32] [?] assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; VAL [main_~x~0=6, main_~y~0=64] [?] assume !(~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [?] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] assume !!(~x~0 % 4294967296 < 6); [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] assume !(~x~0 % 4294967296 < 6); VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] 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~ret1 := main(); [L9] ~x~0 := 0; [L10] ~y~0 := 1; VAL [~x~0=0, ~y~0=1] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=1, ~y~0=2] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=2, ~y~0=4] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=3, ~y~0=8] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=4, ~y~0=16] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=5, ~y~0=32] [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; VAL [~x~0=6, ~y~0=64] [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) VAL [~x~0=6, ~y~0=64] [L15] CALL call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 00:12:30,224 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77fa407c-76de-4c97-8e30-7eeb9dc4ebc5/bin-2019/utaipan/witness.graphml [2018-11-23 00:12:30,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:12:30,226 INFO L168 Benchmark]: Toolchain (without parser) took 2344.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 959.1 MB in the beginning and 960.6 MB in the end (delta: -1.5 MB). Peak memory consumption was 171.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,227 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:12:30,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.60 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:12:30,228 INFO L168 Benchmark]: Boogie Preprocessor took 15.87 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,229 INFO L168 Benchmark]: RCFGBuilder took 218.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,229 INFO L168 Benchmark]: TraceAbstraction took 1816.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 963.9 MB in the end (delta: 192.5 MB). Peak memory consumption was 192.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,230 INFO L168 Benchmark]: Witness Printer took 55.33 ms. Allocated memory is still 1.2 GB. Free memory was 963.9 MB in the beginning and 960.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:30,233 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.60 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.87 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 218.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1816.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 963.9 MB in the end (delta: 192.5 MB). Peak memory consumption was 192.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.33 ms. Allocated memory is still 1.2 GB. Free memory was 963.9 MB in the beginning and 960.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 1.7s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 0 SDslu, 198 SDs, 0 SdLazy, 139 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 6945 SizeOfPredicates, 5 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...