./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/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 dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 05:41:23,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:41:23,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:41:23,439 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:41:23,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:41:23,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:41:23,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:41:23,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:41:23,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:41:23,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:41:23,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:41:23,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:41:23,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:41:23,445 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:41:23,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:41:23,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:41:23,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:41:23,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:41:23,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:41:23,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:41:23,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:41:23,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:41:23,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:41:23,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:41:23,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:41:23,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:41:23,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:41:23,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:41:23,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:41:23,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:41:23,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:41:23,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:41:23,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:41:23,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:41:23,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:41:23,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:41:23,460 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 05:41:23,470 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:41:23,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:41:23,472 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:41:23,472 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:41:23,472 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:41:23,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:41:23,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:41:23,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:41:23,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:41:23,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:41:23,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:41:23,475 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_ed979757-6092-4855-a2a3-4d66237e450a/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 -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c [2018-12-09 05:41:23,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:41:23,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:41:23,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:41:23,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:41:23,506 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:41:23,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-12-09 05:41:23,541 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/data/0f3b61598/4b3404a3f65647a8840108dd677a37c9/FLAG0ee9f7baf [2018-12-09 05:41:23,939 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:41:23,939 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-12-09 05:41:23,942 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/data/0f3b61598/4b3404a3f65647a8840108dd677a37c9/FLAG0ee9f7baf [2018-12-09 05:41:23,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/data/0f3b61598/4b3404a3f65647a8840108dd677a37c9 [2018-12-09 05:41:23,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:41:23,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:41:23,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:23,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:41:23,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:41:23,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:23" (1/1) ... [2018-12-09 05:41:23,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:23, skipping insertion in model container [2018-12-09 05:41:23,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:23" (1/1) ... [2018-12-09 05:41:23,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:41:23,970 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:41:24,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:24,057 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:41:24,069 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:41:24,077 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:41:24,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24 WrapperNode [2018-12-09 05:41:24,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:41:24,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:24,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:41:24,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:41:24,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:41:24,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:41:24,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:41:24,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:41:24,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... [2018-12-09 05:41:24,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:41:24,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:41:24,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:41:24,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:41:24,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/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-12-09 05:41:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:41:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:41:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:41:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:41:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:41:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:41:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 05:41:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 05:41:24,312 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:41:24,312 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 05:41:24,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:24 BoogieIcfgContainer [2018-12-09 05:41:24,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:41:24,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:41:24,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:41:24,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:41:24,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:41:23" (1/3) ... [2018-12-09 05:41:24,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:24, skipping insertion in model container [2018-12-09 05:41:24,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:24" (2/3) ... [2018-12-09 05:41:24,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:24, skipping insertion in model container [2018-12-09 05:41:24,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:24" (3/3) ... [2018-12-09 05:41:24,320 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i [2018-12-09 05:41:24,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:41:24,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:41:24,346 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:41:24,369 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:41:24,369 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:41:24,369 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:41:24,369 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:41:24,369 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:41:24,369 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:41:24,369 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:41:24,370 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:41:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 05:41:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:41:24,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:24,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:24,388 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:24,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-12-09 05:41:24,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:24,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:24,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 05:41:24,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:24,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 05:41:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 05:41:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:41:24,476 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-09 05:41:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:24,490 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-09 05:41:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 05:41:24,491 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-09 05:41:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:24,495 INFO L225 Difference]: With dead ends: 38 [2018-12-09 05:41:24,495 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 05:41:24,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:41:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 05:41:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 05:41:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 05:41:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-12-09 05:41:24,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-12-09 05:41:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:24,517 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-12-09 05:41:24,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 05:41:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-12-09 05:41:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:41:24,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:24,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:24,518 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:24,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-12-09 05:41:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:24,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:24,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:24,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:24,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:41:24,590 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-12-09 05:41:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:24,624 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-12-09 05:41:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:24,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 05:41:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:24,626 INFO L225 Difference]: With dead ends: 28 [2018-12-09 05:41:24,626 INFO L226 Difference]: Without dead ends: 23 [2018-12-09 05:41:24,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:41:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-09 05:41:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-09 05:41:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 05:41:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-09 05:41:24,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-12-09 05:41:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:24,629 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-09 05:41:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-09 05:41:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:24,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:24,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:24,630 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:24,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-12-09 05:41:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:24,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:24,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:24,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:24,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:24,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:41:24,680 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-09 05:41:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:24,748 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-12-09 05:41:24,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:24,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:24,750 INFO L225 Difference]: With dead ends: 50 [2018-12-09 05:41:24,750 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 05:41:24,751 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-12-09 05:41:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 05:41:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 05:41:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 05:41:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-09 05:41:24,756 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-12-09 05:41:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:24,756 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-09 05:41:24,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-09 05:41:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:24,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:24,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:24,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:24,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-12-09 05:41:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:24,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:24,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:41:24,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 05:41:24,908 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 05:41:24,910 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2018-12-09 05:41:24,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 05:41:24,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 05:41:25,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 05:41:25,130 INFO L272 AbstractInterpreter]: Visited 21 different actions 53 times. Merged at 12 different actions 26 times. Never widened. Performed 214 root evaluator evaluations with a maximum evaluation depth of 13. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-09 05:41:25,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:25,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 05:41:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:41:25,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/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-12-09 05:41:25,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:25,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 05:41:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:25,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:41:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:25,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:41:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:26,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 05:41:26,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-09 05:41:26,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 05:41:26,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 05:41:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 05:41:26,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-09 05:41:26,150 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-12-09 05:41:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:26,298 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-09 05:41:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:41:26,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-12-09 05:41:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:26,299 INFO L225 Difference]: With dead ends: 51 [2018-12-09 05:41:26,299 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 05:41:26,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-09 05:41:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 05:41:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-09 05:41:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-09 05:41:26,303 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-12-09 05:41:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:26,303 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-09 05:41:26,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 05:41:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-09 05:41:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:26,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:26,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:26,304 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-12-09 05:41:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:26,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:28,327 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-09 05:41:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:28,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:28,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:28,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:28,331 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-12-09 05:41:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:28,333 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-12-09 05:41:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:28,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:28,334 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:28,334 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:28,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-12-09 05:41:28,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-12-09 05:41:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:28,338 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-09 05:41:28,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-12-09 05:41:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:28,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:28,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:28,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:28,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-12-09 05:41:28,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:28,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:28,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:30,358 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-09 05:41:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:30,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:30,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:30,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:30,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:30,362 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-12-09 05:41:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:30,364 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-09 05:41:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:30,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:30,365 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:30,365 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:30,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-09 05:41:30,368 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-12-09 05:41:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:30,368 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-09 05:41:30,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-12-09 05:41:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:30,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:30,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:30,369 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:30,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-12-09 05:41:30,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:30,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:32,393 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-09 05:41:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:32,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:32,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:32,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:32,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:32,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:32,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:32,397 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-12-09 05:41:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:32,399 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-12-09 05:41:32,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:32,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:32,400 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:32,400 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:32,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-09 05:41:32,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-09 05:41:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:32,403 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-09 05:41:32,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-09 05:41:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:32,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:32,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:32,404 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:32,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-12-09 05:41:32,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:32,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:34,426 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse0 (= c_main_~y~0 .cse1)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse2 (* (- 2) .cse4))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (and (not .cse0) (< c_main_~y~0 .cse3)) (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0))))))) is different from false [2018-12-09 05:41:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:34,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:34,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:34,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:34,430 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-12-09 05:41:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:34,432 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-09 05:41:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:34,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:34,433 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:34,433 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:34,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 05:41:34,438 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2018-12-09 05:41:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:34,438 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 05:41:34,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 05:41:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:34,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:34,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:34,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:34,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2048497361, now seen corresponding path program 1 times [2018-12-09 05:41:34,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:34,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:36,465 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse0 (= c_main_~y~0 .cse1)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse2 (* (- 2) .cse4))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (and (not .cse0) (< c_main_~y~0 .cse3)) (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0))))))) is different from false [2018-12-09 05:41:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:36,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:36,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:36,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:36,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:36,473 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-12-09 05:41:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:36,476 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-12-09 05:41:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:36,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:36,477 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:36,477 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:36,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-12-09 05:41:36,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2018-12-09 05:41:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:36,481 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-12-09 05:41:36,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-12-09 05:41:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:36,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:36,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:36,481 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1368438991, now seen corresponding path program 1 times [2018-12-09 05:41:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:36,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:38,504 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-09 05:41:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:38,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:38,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:38,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:38,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:38,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:38,508 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-12-09 05:41:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:38,510 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-12-09 05:41:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:38,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:38,511 INFO L225 Difference]: With dead ends: 60 [2018-12-09 05:41:38,511 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 05:41:38,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 05:41:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 05:41:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 05:41:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-09 05:41:38,513 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2018-12-09 05:41:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:38,514 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-09 05:41:38,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-09 05:41:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:38,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:38,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:38,514 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:38,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2117181679, now seen corresponding path program 1 times [2018-12-09 05:41:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:38,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:41:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:41:38,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:41:38,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:41:38,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:41:38,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:41:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:41:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:41:38,542 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 3 states. [2018-12-09 05:41:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:38,566 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-12-09 05:41:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:41:38,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 05:41:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:41:38,567 INFO L225 Difference]: With dead ends: 61 [2018-12-09 05:41:38,567 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 05:41:38,567 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-12-09 05:41:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 05:41:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-09 05:41:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:41:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 05:41:38,569 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-12-09 05:41:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:41:38,569 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 05:41:38,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:41:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 05:41:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:41:38,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:41:38,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:38,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:41:38,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-12-09 05:41:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:41:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:38,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:41:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:38,592 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:41:38,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:38 BoogieIcfgContainer [2018-12-09 05:41:38,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:41:38,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:41:38,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:41:38,606 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:41:38,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:24" (3/4) ... [2018-12-09 05:41:38,608 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:41:38,634 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ed979757-6092-4855-a2a3-4d66237e450a/bin-2019/utaipan/witness.graphml [2018-12-09 05:41:38,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:41:38,634 INFO L168 Benchmark]: Toolchain (without parser) took 14682.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -114.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:38,635 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:38,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.09 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:38,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:38,636 INFO L168 Benchmark]: Boogie Preprocessor took 44.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:38,636 INFO L168 Benchmark]: RCFGBuilder took 179.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:38,636 INFO L168 Benchmark]: TraceAbstraction took 14292.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:38,636 INFO L168 Benchmark]: Witness Printer took 27.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:38,638 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.09 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14292.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Witness Printer took 27.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. UNSAFE Result, 14.2s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 16 SDslu, 176 SDs, 0 SdLazy, 363 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 35256 SizeOfPredicates, 1 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 8/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...