./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:58:33,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:58:33,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:58:33,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:58:33,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:58:33,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:58:33,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:58:33,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:58:33,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:58:33,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:58:33,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:58:33,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:58:33,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:58:33,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:58:33,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:58:33,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:58:33,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:58:33,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:58:33,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:58:33,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:58:33,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:58:33,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:58:33,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:58:33,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:58:33,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:58:33,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:58:33,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:58:33,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:58:33,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:58:33,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:58:33,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:58:33,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:58:33,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:58:33,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:58:33,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:58:33,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:58:33,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:58:33,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:58:33,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:58:33,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:58:33,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:58:33,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:58:33,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:58:33,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:58:33,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:58:33,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:58:33,563 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:58:33,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:58:33,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:58:33,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:58:33,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:58:33,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:58:33,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:58:33,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:58:33,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:58:33,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:58:33,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:58:33,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:58:33,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:58:33,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:58:33,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:58:33,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:58:33,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:58:33,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:58:33,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:58:33,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:58:33,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:58:33,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:58:33,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:58:33,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:58:33,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer 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 -> Automizer 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-11-20 04:58:33,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:58:33,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:58:33,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:58:33,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:58:33,781 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:58:33,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-20 04:58:33,863 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/data/c3f1094d1/cd55fd7240794da883c0fe6f52db8bab/FLAG84b3fc5bb [2019-11-20 04:58:34,320 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:58:34,329 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-20 04:58:34,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/data/c3f1094d1/cd55fd7240794da883c0fe6f52db8bab/FLAG84b3fc5bb [2019-11-20 04:58:34,625 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/data/c3f1094d1/cd55fd7240794da883c0fe6f52db8bab [2019-11-20 04:58:34,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:58:34,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:58:34,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:58:34,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:58:34,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:58:34,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:58:34" (1/1) ... [2019-11-20 04:58:34,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cacdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:34, skipping insertion in model container [2019-11-20 04:58:34,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:58:34" (1/1) ... [2019-11-20 04:58:34,647 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:58:34,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:58:35,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:58:35,155 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:58:35,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:58:35,245 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:58:35,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35 WrapperNode [2019-11-20 04:58:35,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:58:35,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:58:35,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:58:35,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:58:35,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:58:35,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:58:35,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:58:35,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:58:35,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... [2019-11-20 04:58:35,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:58:35,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:58:35,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:58:35,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:58:35,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/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 [2019-11-20 04:58:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:58:35,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:58:36,487 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:58:36,488 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-20 04:58:36,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:58:36 BoogieIcfgContainer [2019-11-20 04:58:36,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:58:36,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:58:36,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:58:36,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:58:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:58:34" (1/3) ... [2019-11-20 04:58:36,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70859839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:58:36, skipping insertion in model container [2019-11-20 04:58:36,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:58:35" (2/3) ... [2019-11-20 04:58:36,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70859839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:58:36, skipping insertion in model container [2019-11-20 04:58:36,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:58:36" (3/3) ... [2019-11-20 04:58:36,498 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-20 04:58:36,509 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:58:36,517 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:58:36,530 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:58:36,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:58:36,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:58:36,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:58:36,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:58:36,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:58:36,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:58:36,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:58:36,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:58:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-20 04:58:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 04:58:36,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:36,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:36,588 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-11-20 04:58:36,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:36,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549017400] [2019-11-20 04:58:36,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549017400] [2019-11-20 04:58:36,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:36,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:58:36,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875384694] [2019-11-20 04:58:36,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:58:36,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:58:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:58:36,805 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-11-20 04:58:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:36,862 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-11-20 04:58:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:58:36,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 04:58:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:36,880 INFO L225 Difference]: With dead ends: 216 [2019-11-20 04:58:36,881 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 04:58:36,885 INFO L630 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 [2019-11-20 04:58:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 04:58:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-20 04:58:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 04:58:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-11-20 04:58:36,927 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-11-20 04:58:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:36,928 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-11-20 04:58:36,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:58:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-11-20 04:58:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 04:58:36,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:36,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:36,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:36,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:36,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-11-20 04:58:36,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:36,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056173326] [2019-11-20 04:58:36,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:36,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056173326] [2019-11-20 04:58:36,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:36,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:36,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841067101] [2019-11-20 04:58:36,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:36,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:36,984 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-11-20 04:58:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:37,057 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-11-20 04:58:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:37,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 04:58:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:37,059 INFO L225 Difference]: With dead ends: 201 [2019-11-20 04:58:37,060 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 04:58:37,061 INFO L630 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 [2019-11-20 04:58:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 04:58:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-20 04:58:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 04:58:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-11-20 04:58:37,072 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-11-20 04:58:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:37,072 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-11-20 04:58:37,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-11-20 04:58:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 04:58:37,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:37,074 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:37,074 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-11-20 04:58:37,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:37,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587892538] [2019-11-20 04:58:37,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:37,626 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-20 04:58:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587892538] [2019-11-20 04:58:37,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:37,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:58:37,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334624638] [2019-11-20 04:58:37,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:58:37,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:37,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:58:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:58:37,634 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-11-20 04:58:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:38,190 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-11-20 04:58:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:38,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 04:58:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:38,194 INFO L225 Difference]: With dead ends: 205 [2019-11-20 04:58:38,194 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 04:58:38,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:58:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 04:58:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-11-20 04:58:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 04:58:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-11-20 04:58:38,227 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-11-20 04:58:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:38,227 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-11-20 04:58:38,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:58:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-11-20 04:58:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 04:58:38,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:38,229 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:38,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-11-20 04:58:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:38,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243463843] [2019-11-20 04:58:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:38,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243463843] [2019-11-20 04:58:38,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:38,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:38,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145291585] [2019-11-20 04:58:38,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:38,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:38,292 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-11-20 04:58:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:38,336 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-11-20 04:58:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:38,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 04:58:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:38,339 INFO L225 Difference]: With dead ends: 293 [2019-11-20 04:58:38,339 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 04:58:38,341 INFO L630 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 [2019-11-20 04:58:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 04:58:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-20 04:58:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-20 04:58:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-11-20 04:58:38,352 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-11-20 04:58:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:38,352 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-11-20 04:58:38,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-11-20 04:58:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 04:58:38,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:38,355 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:38,355 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-11-20 04:58:38,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:38,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545471670] [2019-11-20 04:58:38,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:58:38,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545471670] [2019-11-20 04:58:38,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:38,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:38,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489172222] [2019-11-20 04:58:38,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:38,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:38,436 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-11-20 04:58:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:38,479 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-11-20 04:58:38,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:38,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 04:58:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:38,481 INFO L225 Difference]: With dead ends: 226 [2019-11-20 04:58:38,482 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 04:58:38,483 INFO L630 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 [2019-11-20 04:58:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 04:58:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-20 04:58:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 04:58:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-11-20 04:58:38,491 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-11-20 04:58:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:38,491 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-11-20 04:58:38,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-11-20 04:58:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 04:58:38,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:38,493 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:38,494 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-11-20 04:58:38,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176960872] [2019-11-20 04:58:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:40,866 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-20 04:58:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:40,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176960872] [2019-11-20 04:58:40,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80753870] [2019-11-20 04:58:40,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:40,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:58:41,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:41,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:58:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-20 04:58:41,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322666110] [2019-11-20 04:58:41,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 04:58:41,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:41,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 04:58:41,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:58:41,075 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 7 states. [2019-11-20 04:58:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:41,952 INFO L93 Difference]: Finished difference Result 359 states and 564 transitions. [2019-11-20 04:58:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:58:41,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-20 04:58:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:41,956 INFO L225 Difference]: With dead ends: 359 [2019-11-20 04:58:41,956 INFO L226 Difference]: Without dead ends: 319 [2019-11-20 04:58:41,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:58:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-20 04:58:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2019-11-20 04:58:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-20 04:58:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 434 transitions. [2019-11-20 04:58:41,986 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 434 transitions. Word has length 23 [2019-11-20 04:58:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:41,986 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 434 transitions. [2019-11-20 04:58:41,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 04:58:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 434 transitions. [2019-11-20 04:58:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 04:58:41,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:41,988 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:42,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:42,192 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-11-20 04:58:42,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:42,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584358557] [2019-11-20 04:58:42,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:58:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584358557] [2019-11-20 04:58:42,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:42,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:42,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974711775] [2019-11-20 04:58:42,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:42,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:42,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:42,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:42,229 INFO L87 Difference]: Start difference. First operand 275 states and 434 transitions. Second operand 3 states. [2019-11-20 04:58:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:42,270 INFO L93 Difference]: Finished difference Result 548 states and 861 transitions. [2019-11-20 04:58:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:42,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 04:58:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:42,273 INFO L225 Difference]: With dead ends: 548 [2019-11-20 04:58:42,274 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 04:58:42,275 INFO L630 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 [2019-11-20 04:58:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 04:58:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-11-20 04:58:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 04:58:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2019-11-20 04:58:42,288 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 25 [2019-11-20 04:58:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:42,288 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2019-11-20 04:58:42,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2019-11-20 04:58:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 04:58:42,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:42,290 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:42,290 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-11-20 04:58:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:42,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974117718] [2019-11-20 04:58:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:42,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974117718] [2019-11-20 04:58:42,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349792497] [2019-11-20 04:58:42,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:42,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:58:42,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:58:42,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:58:42,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-20 04:58:42,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453117791] [2019-11-20 04:58:42,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:42,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:58:42,666 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand 3 states. [2019-11-20 04:58:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:42,687 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2019-11-20 04:58:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:42,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 04:58:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:42,690 INFO L225 Difference]: With dead ends: 298 [2019-11-20 04:58:42,690 INFO L226 Difference]: Without dead ends: 292 [2019-11-20 04:58:42,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:58:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-20 04:58:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-11-20 04:58:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-20 04:58:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-11-20 04:58:42,704 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 27 [2019-11-20 04:58:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:42,706 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-11-20 04:58:42,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-11-20 04:58:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 04:58:42,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:42,710 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:42,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:42,914 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:42,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-11-20 04:58:42,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:42,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376052656] [2019-11-20 04:58:42,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:58:42,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376052656] [2019-11-20 04:58:42,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:42,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:42,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333323238] [2019-11-20 04:58:42,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:42,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:42,987 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 3 states. [2019-11-20 04:58:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:43,025 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-20 04:58:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:43,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-20 04:58:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:43,029 INFO L225 Difference]: With dead ends: 510 [2019-11-20 04:58:43,029 INFO L226 Difference]: Without dead ends: 243 [2019-11-20 04:58:43,030 INFO L630 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 [2019-11-20 04:58:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-20 04:58:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-20 04:58:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-20 04:58:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-11-20 04:58:43,040 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 33 [2019-11-20 04:58:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:43,040 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-11-20 04:58:43,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-11-20 04:58:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 04:58:43,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:43,048 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:43,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-11-20 04:58:43,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:43,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820790010] [2019-11-20 04:58:43,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 04:58:43,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820790010] [2019-11-20 04:58:43,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:43,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:43,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853316874] [2019-11-20 04:58:43,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:43,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:43,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:43,107 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-11-20 04:58:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:43,147 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-11-20 04:58:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:43,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 04:58:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:43,150 INFO L225 Difference]: With dead ends: 424 [2019-11-20 04:58:43,150 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 04:58:43,152 INFO L630 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 [2019-11-20 04:58:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 04:58:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-11-20 04:58:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 04:58:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-11-20 04:58:43,162 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-11-20 04:58:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:43,163 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-11-20 04:58:43,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-11-20 04:58:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 04:58:43,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:43,165 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:43,165 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-11-20 04:58:43,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:43,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848732434] [2019-11-20 04:58:43,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:58:43,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848732434] [2019-11-20 04:58:43,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:58:43,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:58:43,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959275004] [2019-11-20 04:58:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:58:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:58:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:58:43,231 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-11-20 04:58:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:43,270 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-11-20 04:58:43,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:58:43,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-20 04:58:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:43,272 INFO L225 Difference]: With dead ends: 305 [2019-11-20 04:58:43,272 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 04:58:43,273 INFO L630 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 [2019-11-20 04:58:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 04:58:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-20 04:58:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 04:58:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-11-20 04:58:43,282 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-11-20 04:58:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:43,282 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-20 04:58:43,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:58:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-11-20 04:58:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 04:58:43,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:43,283 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:43,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-11-20 04:58:43,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:43,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5577077] [2019-11-20 04:58:43,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:58:43,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5577077] [2019-11-20 04:58:43,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203027555] [2019-11-20 04:58:43,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:43,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 04:58:43,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:43,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:58:43,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 04:58:43,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253179552] [2019-11-20 04:58:43,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:58:43,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:58:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:58:43,710 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 10 states. [2019-11-20 04:58:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:43,850 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2019-11-20 04:58:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:58:43,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-20 04:58:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:43,852 INFO L225 Difference]: With dead ends: 167 [2019-11-20 04:58:43,853 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 04:58:43,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:58:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 04:58:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-20 04:58:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-20 04:58:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2019-11-20 04:58:43,859 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 47 [2019-11-20 04:58:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2019-11-20 04:58:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:58:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2019-11-20 04:58:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 04:58:43,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:43,861 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:44,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:44,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-11-20 04:58:44,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:44,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617672826] [2019-11-20 04:58:44,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:44,685 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-11-20 04:58:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:44,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617672826] [2019-11-20 04:58:44,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198565073] [2019-11-20 04:58:44,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:44,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:58:44,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:44,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 04:58:44,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:58:44,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:58:44,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:58:44,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:58:44,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:44,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:45,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:58:45,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 04:58:45,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319189743] [2019-11-20 04:58:45,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:58:45,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:45,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:58:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:58:45,035 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand 10 states. [2019-11-20 04:58:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:45,460 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2019-11-20 04:58:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:58:45,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-20 04:58:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:45,462 INFO L225 Difference]: With dead ends: 177 [2019-11-20 04:58:45,462 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 04:58:45,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:58:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 04:58:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-20 04:58:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-20 04:58:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2019-11-20 04:58:45,475 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 57 [2019-11-20 04:58:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:45,476 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2019-11-20 04:58:45,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:58:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2019-11-20 04:58:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 04:58:45,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:45,477 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:45,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:45,681 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-11-20 04:58:45,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:45,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107893182] [2019-11-20 04:58:45,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:46,221 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-20 04:58:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:46,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107893182] [2019-11-20 04:58:46,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530232957] [2019-11-20 04:58:46,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:46,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 04:58:46,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:46,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:58:46,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-20 04:58:46,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030837689] [2019-11-20 04:58:46,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 04:58:46,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 04:58:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:58:46,431 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand 9 states. [2019-11-20 04:58:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:46,587 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2019-11-20 04:58:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:58:46,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-20 04:58:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:46,590 INFO L225 Difference]: With dead ends: 194 [2019-11-20 04:58:46,590 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 04:58:46,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:58:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 04:58:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-20 04:58:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-20 04:58:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2019-11-20 04:58:46,599 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 66 [2019-11-20 04:58:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:46,600 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2019-11-20 04:58:46,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 04:58:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2019-11-20 04:58:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 04:58:46,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:58:46,601 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:58:46,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:46,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:58:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:58:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-11-20 04:58:46,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:58:46,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518051569] [2019-11-20 04:58:46,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:58:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:49,430 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-11-20 04:58:51,465 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse37 (<= c_ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse38 (div c_ULTIMATE.start_main_~this_buffer_empty~0 4294967296))) (and (let ((.cse33 (div c_ULTIMATE.start_main_~this_expect~0 2)) (.cse30 (div c_ULTIMATE.start_main_~P6~0 2))) (let ((.cse31 (* .cse30 (- 2))) (.cse32 (* .cse33 (- 2)))) (let ((.cse14 (div (+ .cse32 c_ULTIMATE.start_main_~this_expect~0) 4294967296)) (.cse2 (* 2 .cse33)) (.cse29 (* 4294967296 (div c_ULTIMATE.start_main_~this_expect~0 4294967296))) (.cse19 (div (+ c_ULTIMATE.start_main_~P6~0 .cse31) 4294967296)) (.cse16 (* 2 .cse30)) (.cse5 (div (+ .cse32 c_ULTIMATE.start_main_~this_expect~0 (- 2)) 4294967296))) (let ((.cse20 (div (+ c_ULTIMATE.start_main_~P6~0 .cse31 (- 2)) 4294967296)) (.cse1 (* 4294967296 .cse5)) (.cse8 (* 4 .cse30)) (.cse26 (<= 0 c_ULTIMATE.start_main_~P6~0)) (.cse27 (= c_ULTIMATE.start_main_~P6~0 .cse16)) (.cse12 (* 4294967296 .cse19)) (.cse24 (<= .cse29 c_ULTIMATE.start_main_~this_expect~0)) (.cse25 (= .cse2 c_ULTIMATE.start_main_~this_expect~0)) (.cse18 (* 4294967296 .cse14)) (.cse22 (* 2 c_ULTIMATE.start_main_~P6~0))) (let ((.cse0 (+ c_ULTIMATE.start_main_~this_expect~0 1)) (.cse7 (+ .cse18 .cse22 .cse2)) (.cse13 (or .cse24 .cse25)) (.cse17 (+ .cse12 .cse16 c_ULTIMATE.start_main_~this_expect~0)) (.cse3 (< c_ULTIMATE.start_main_~this_expect~0 .cse29)) (.cse11 (or .cse26 .cse27)) (.cse21 (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0)) (.cse6 (not .cse27)) (.cse23 (+ .cse22 .cse1 .cse2)) (.cse9 (* 4294967296 .cse20)) (.cse10 (< c_ULTIMATE.start_main_~P6~0 0)) (.cse4 (not .cse25))) (or (and (<= .cse0 (+ .cse1 .cse2)) .cse3 .cse4) (and .cse3 .cse4 (<= (+ .cse5 1) 0)) (and (or (and .cse6 (<= .cse7 (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 5)) .cse10) (and .cse11 (<= .cse7 (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0 1)))) .cse13) (and (<= (+ .cse14 1) 0) .cse13) (and (let ((.cse15 (+ .cse18 c_ULTIMATE.start_main_~P6~0 .cse2))) (or (and .cse6 .cse10 (<= .cse15 (+ .cse16 .cse9 c_ULTIMATE.start_main_~this_expect~0 2))) (and .cse11 (<= .cse15 .cse17)))) .cse13) (and .cse13 (<= .cse0 (+ .cse18 .cse2))) (and (or (and (<= (+ .cse18 .cse2 1) c_ULTIMATE.start_main_~this_expect~0) .cse13) (and .cse13 (or (and .cse11 (<= .cse14 .cse19)) (and .cse6 .cse10 (<= .cse14 .cse20)))) (and .cse3 .cse4 (<= (+ .cse1 .cse2 1) c_ULTIMATE.start_main_~this_expect~0)) (and (or (and .cse11 (<= .cse5 .cse19)) (and .cse6 (<= .cse5 .cse20) .cse10)) .cse3 .cse4)) (or (and (or (and .cse11 (<= (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0 3) .cse7)) (and .cse6 (<= (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 7) .cse7) .cse10)) .cse13) (and .cse3 .cse4 (or (and .cse11 (<= .cse21 (+ .cse22 .cse1 .cse2 1))) (and .cse6 (<= (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 3) .cse23) .cse10))) (let ((.cse28 (and .cse6 .cse10))) (and (or .cse24 .cse25 (and (or .cse26 .cse27 (< .cse20 .cse5)) (or (< .cse19 .cse5) .cse28))) (or (and .cse3 .cse4) (and (or (< .cse19 .cse14) .cse28) (or .cse26 .cse27 (< .cse20 .cse14)))))))) (and (or (and .cse6 (<= (+ c_ULTIMATE.start_main_~P6~0 .cse1 .cse2) (+ .cse16 .cse9 c_ULTIMATE.start_main_~this_expect~0)) .cse10) (and .cse11 (<= (+ c_ULTIMATE.start_main_~P6~0 .cse1 .cse2 2) .cse17))) .cse3 .cse4) (and .cse3 (or (and .cse11 (<= (+ .cse22 .cse1 .cse2 3) .cse21)) (and .cse6 (<= .cse23 (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 1)) .cse10)) .cse4))))))) (or (let ((.cse39 (* 4294967296 .cse38))) (let ((.cse36 (<= 1 c_ULTIMATE.start_main_~this_buffer_empty~0)) (.cse34 (+ .cse39 1))) (and (or (<= c_ULTIMATE.start_main_~this_buffer_empty~0 .cse34) (let ((.cse35 (+ .cse38 1))) (and (or (< 0 .cse35) .cse36) (or .cse37 (<= .cse35 0))))) (or .cse36 (< .cse34 c_ULTIMATE.start_main_~this_buffer_empty~0) (< .cse39 c_ULTIMATE.start_main_~this_buffer_empty~0))))) (< 0 .cse38)) (or .cse37 (<= .cse38 0)))) is different from false [2019-11-20 04:58:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 62 refuted. 0 times theorem prover too weak. 9 trivial. 28 not checked. [2019-11-20 04:58:51,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518051569] [2019-11-20 04:58:51,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132879784] [2019-11-20 04:58:51,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:58:51,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 04:58:51,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:58:51,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:58:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:58:51,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:58:51,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-20 04:58:51,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450150181] [2019-11-20 04:58:51,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:58:51,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:58:51,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:58:51,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-11-20 04:58:51,931 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand 16 states. [2019-11-20 04:58:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:58:52,439 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2019-11-20 04:58:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 04:58:52,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-11-20 04:58:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:58:52,440 INFO L225 Difference]: With dead ends: 211 [2019-11-20 04:58:52,440 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:58:52,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-11-20 04:58:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:58:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:58:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:58:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:58:52,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-20 04:58:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:58:52,442 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:58:52,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:58:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:58:52,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:58:52,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:58:52,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:58:52,859 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-11-20 04:58:52,923 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-20 04:58:52,923 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-20 04:58:52,923 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-20 04:58:52,923 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-20 04:58:52,924 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-20 04:58:52,925 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L447 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-20 04:58:52,926 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-20 04:58:52,927 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-20 04:58:52,927 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-20 04:58:52,928 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-20 04:58:52,928 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-20 04:58:52,930 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-20 04:58:52,931 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-20 04:58:52,931 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-20 04:58:52,933 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-20 04:58:52,933 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L440 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-20 04:58:52,934 INFO L444 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-20 04:58:52,935 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:58:52,935 INFO L440 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)))) [2019-11-20 04:58:52,935 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-20 04:58:52,935 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:58:52,935 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-20 04:58:52,935 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-20 04:58:52,936 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-20 04:58:52,937 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L440 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse5 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse4 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and (= ULTIMATE.start_main_~q~0 3) .cse1 .cse0 .cse2 .cse3) (and (= 1 ULTIMATE.start_main_~q~0) .cse4 .cse5 .cse2 .cse3) (and .cse1 (= ULTIMATE.start_main_~q~0 4) .cse5 .cse2 .cse3) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse4 .cse2 .cse3))) [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-20 04:58:52,938 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-20 04:58:52,939 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-20 04:58:52,940 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-20 04:58:52,941 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-20 04:58:52,942 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-20 04:58:52,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:58:52 BoogieIcfgContainer [2019-11-20 04:58:52,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:58:52,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:58:52,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:58:52,964 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:58:52,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:58:36" (3/4) ... [2019-11-20 04:58:52,969 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:58:52,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 04:58:52,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 04:58:53,048 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_094850d3-47f8-4e1c-a370-90444f9c49ac/bin/uautomizer/witness.graphml [2019-11-20 04:58:53,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:58:53,051 INFO L168 Benchmark]: Toolchain (without parser) took 18422.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 940.7 MB in the beginning and 907.4 MB in the end (delta: 33.3 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,052 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:58:53,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.54 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,054 INFO L168 Benchmark]: Boogie Preprocessor took 54.08 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,054 INFO L168 Benchmark]: RCFGBuilder took 1101.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,057 INFO L168 Benchmark]: TraceAbstraction took 16473.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 914.7 MB in the end (delta: 122.0 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,057 INFO L168 Benchmark]: Witness Printer took 86.20 ms. Allocated memory is still 1.2 GB. Free memory was 914.7 MB in the beginning and 907.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:58:53,060 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.54 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.08 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1101.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16473.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 914.7 MB in the end (delta: 122.0 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. * Witness Printer took 86.20 ms. Allocated memory is still 1.2 GB. Free memory was 914.7 MB in the beginning and 907.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) || ((((q == 3 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((1 == q && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) || ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 2279 SDtfs, 1913 SDslu, 5000 SDs, 0 SdLazy, 818 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 306 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 20 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 975 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 1581330 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...