./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:24:46,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:24:46,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:24:46,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:24:46,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:24:46,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:24:46,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:24:46,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:24:46,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:24:46,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:24:46,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:24:46,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:24:46,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:24:46,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:24:46,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:24:46,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:24:46,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:24:46,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:24:46,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:24:46,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:24:46,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:24:46,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:24:46,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:24:46,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:24:46,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:24:46,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:24:46,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:24:46,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:24:46,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:24:46,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:24:46,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:24:46,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:24:46,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:24:46,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:24:46,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:24:46,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:24:46,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:24:46,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:24:46,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:24:46,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:24:46,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:24:46,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:24:46,539 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:24:46,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:24:46,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:24:46,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:24:46,541 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:24:46,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:24:46,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:24:46,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:24:46,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:24:46,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:24:46,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:24:46,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:24:46,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:24:46,543 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:24:46,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:24:46,543 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:24:46,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:24:46,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:24:46,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:24:46,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:24:46,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:24:46,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:24:46,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:24:46,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:24:46,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:24:46,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:24:46,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:24:46,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:24:46,546 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_53ddbc73-c849-467b-968c-e124f3d19c5a/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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-11-16 00:24:46,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:24:46,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:24:46,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:24:46,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:24:46,588 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:24:46,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-16 00:24:46,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/data/feb7c5482/a977c886f15e4ec2be40f344fbaea672/FLAG0aaeb925b [2019-11-16 00:24:46,996 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:24:46,997 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-16 00:24:47,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/data/feb7c5482/a977c886f15e4ec2be40f344fbaea672/FLAG0aaeb925b [2019-11-16 00:24:47,369 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/data/feb7c5482/a977c886f15e4ec2be40f344fbaea672 [2019-11-16 00:24:47,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:24:47,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:24:47,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:47,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:24:47,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:24:47,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48805723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47, skipping insertion in model container [2019-11-16 00:24:47,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:24:47,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:24:47,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:47,560 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:24:47,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:47,662 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:24:47,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47 WrapperNode [2019-11-16 00:24:47,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:47,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:47,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:24:47,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:24:47,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:47,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:24:47,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:24:47,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:24:47,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... [2019-11-16 00:24:47,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:24:47,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:24:47,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:24:47,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:24:47,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:24:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:24:48,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:24:48,058 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-16 00:24:48,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:48 BoogieIcfgContainer [2019-11-16 00:24:48,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:24:48,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:24:48,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:24:48,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:24:48,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:47" (1/3) ... [2019-11-16 00:24:48,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6da562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:48, skipping insertion in model container [2019-11-16 00:24:48,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:47" (2/3) ... [2019-11-16 00:24:48,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6da562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:48, skipping insertion in model container [2019-11-16 00:24:48,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:48" (3/3) ... [2019-11-16 00:24:48,066 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-16 00:24:48,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:24:48,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-16 00:24:48,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-16 00:24:48,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:24:48,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:24:48,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:24:48,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:24:48,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:24:48,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:24:48,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:24:48,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:24:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-16 00:24:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:24:48,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:48,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1436471502, now seen corresponding path program 1 times [2019-11-16 00:24:48,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092470007] [2019-11-16 00:24:48,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,281 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-16 00:24:48,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092470007] [2019-11-16 00:24:48,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:24:48,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921791437] [2019-11-16 00:24:48,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:24:48,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:24:48,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:24:48,304 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-16 00:24:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,330 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-16 00:24:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:24:48,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-16 00:24:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,339 INFO L225 Difference]: With dead ends: 85 [2019-11-16 00:24:48,339 INFO L226 Difference]: Without dead ends: 40 [2019-11-16 00:24:48,341 INFO L600 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-16 00:24:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-16 00:24:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-16 00:24:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:24:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-16 00:24:48,374 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 9 [2019-11-16 00:24:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,374 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-16 00:24:48,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:24:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-16 00:24:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:24:48,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,375 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:48,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1526631753, now seen corresponding path program 1 times [2019-11-16 00:24:48,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159760433] [2019-11-16 00:24:48,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,447 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-16 00:24:48,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159760433] [2019-11-16 00:24:48,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:48,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841132546] [2019-11-16 00:24:48,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:48,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:48,450 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-11-16 00:24:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,543 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-16 00:24:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:48,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-16 00:24:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,545 INFO L225 Difference]: With dead ends: 44 [2019-11-16 00:24:48,545 INFO L226 Difference]: Without dead ends: 38 [2019-11-16 00:24:48,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-16 00:24:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-16 00:24:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:24:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-16 00:24:48,552 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2019-11-16 00:24:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,553 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-16 00:24:48,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-16 00:24:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:24:48,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,554 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:48,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1785542740, now seen corresponding path program 1 times [2019-11-16 00:24:48,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208761707] [2019-11-16 00:24:48,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,603 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-16 00:24:48,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208761707] [2019-11-16 00:24:48,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:48,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599936034] [2019-11-16 00:24:48,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:48,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:48,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:48,606 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-11-16 00:24:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,753 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-16 00:24:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:24:48,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:24:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,755 INFO L225 Difference]: With dead ends: 50 [2019-11-16 00:24:48,756 INFO L226 Difference]: Without dead ends: 46 [2019-11-16 00:24:48,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:24:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-16 00:24:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-11-16 00:24:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:24:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-16 00:24:48,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-11-16 00:24:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,768 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-16 00:24:48,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-16 00:24:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:24:48,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:48,772 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash -734801565, now seen corresponding path program 1 times [2019-11-16 00:24:48,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122881135] [2019-11-16 00:24:48,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,868 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-16 00:24:48,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122881135] [2019-11-16 00:24:48,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:48,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291798840] [2019-11-16 00:24:48,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:48,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:48,870 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-16 00:24:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,949 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-16 00:24:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:48,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-16 00:24:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,950 INFO L225 Difference]: With dead ends: 44 [2019-11-16 00:24:48,951 INFO L226 Difference]: Without dead ends: 42 [2019-11-16 00:24:48,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-16 00:24:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-16 00:24:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-16 00:24:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-16 00:24:48,958 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-11-16 00:24:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,958 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-16 00:24:48,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-16 00:24:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:24:48,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:48,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2090765742, now seen corresponding path program 1 times [2019-11-16 00:24:48,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298635747] [2019-11-16 00:24:48,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:49,015 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-16 00:24:49,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298635747] [2019-11-16 00:24:49,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:49,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:49,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759639575] [2019-11-16 00:24:49,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:49,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:49,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:49,017 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2019-11-16 00:24:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:49,277 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-16 00:24:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:49,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-16 00:24:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:49,280 INFO L225 Difference]: With dead ends: 71 [2019-11-16 00:24:49,280 INFO L226 Difference]: Without dead ends: 57 [2019-11-16 00:24:49,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:24:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-16 00:24:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-16 00:24:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:24:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-16 00:24:49,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-11-16 00:24:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:49,290 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-16 00:24:49,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-16 00:24:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:24:49,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:49,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:49,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1769510362, now seen corresponding path program 1 times [2019-11-16 00:24:49,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:49,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763035530] [2019-11-16 00:24:49,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:49,390 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-16 00:24:49,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763035530] [2019-11-16 00:24:49,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:49,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:24:49,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10078021] [2019-11-16 00:24:49,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:24:49,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:49,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:24:49,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:24:49,392 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2019-11-16 00:24:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:49,597 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-16 00:24:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:24:49,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:24:49,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:49,599 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:24:49,599 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:24:49,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:24:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:24:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-16 00:24:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:24:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-16 00:24:49,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2019-11-16 00:24:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:49,607 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-16 00:24:49,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:24:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-16 00:24:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:24:49,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:49,613 INFO L380 BasicCegarLoop]: trace histogram [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-16 00:24:49,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1110583474, now seen corresponding path program 1 times [2019-11-16 00:24:49,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:49,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511281390] [2019-11-16 00:24:49,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:49,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511281390] [2019-11-16 00:24:49,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318668845] [2019-11-16 00:24:49,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:49,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:24:49,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:50,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:50,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-16 00:24:50,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593897506] [2019-11-16 00:24:50,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:24:50,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:50,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:24:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:24:50,098 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2019-11-16 00:24:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:51,241 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-16 00:24:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:24:51,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-16 00:24:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:51,245 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:24:51,245 INFO L226 Difference]: Without dead ends: 94 [2019-11-16 00:24:51,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=440, Invalid=1042, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:24:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-16 00:24:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2019-11-16 00:24:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-16 00:24:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-16 00:24:51,272 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-16 00:24:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:51,273 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-16 00:24:51,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:24:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-16 00:24:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:24:51,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:51,274 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:51,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:51,478 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1311932474, now seen corresponding path program 1 times [2019-11-16 00:24:51,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:51,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653512838] [2019-11-16 00:24:51,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:51,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653512838] [2019-11-16 00:24:51,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919803611] [2019-11-16 00:24:51,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:51,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:24:51,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:51,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:51,702 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:51,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-16 00:24:51,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295392326] [2019-11-16 00:24:51,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:24:51,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:51,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:24:51,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:24:51,704 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2019-11-16 00:24:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:52,041 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-16 00:24:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:52,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-16 00:24:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:52,043 INFO L225 Difference]: With dead ends: 77 [2019-11-16 00:24:52,043 INFO L226 Difference]: Without dead ends: 75 [2019-11-16 00:24:52,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:24:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-16 00:24:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-16 00:24:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-16 00:24:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-16 00:24:52,064 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2019-11-16 00:24:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-16 00:24:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:24:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-16 00:24:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:24:52,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:52,069 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:52,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:52,272 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1348445734, now seen corresponding path program 2 times [2019-11-16 00:24:52,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:52,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895003004] [2019-11-16 00:24:52,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:52,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:52,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:52,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895003004] [2019-11-16 00:24:52,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495728247] [2019-11-16 00:24:52,493 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:52,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:52,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:52,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:24:52,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:52,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:52,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:52,846 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:52,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-11-16 00:24:52,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918029656] [2019-11-16 00:24:52,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:24:52,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:24:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:24:52,849 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 22 states. [2019-11-16 00:24:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:54,382 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-11-16 00:24:54,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:24:54,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-11-16 00:24:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:54,384 INFO L225 Difference]: With dead ends: 99 [2019-11-16 00:24:54,384 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:24:54,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=1476, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:24:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:24:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2019-11-16 00:24:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-16 00:24:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-16 00:24:54,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2019-11-16 00:24:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:54,405 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-16 00:24:54,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:24:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-16 00:24:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:24:54,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:54,416 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:54,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:54,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 670000306, now seen corresponding path program 2 times [2019-11-16 00:24:54,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:54,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007146692] [2019-11-16 00:24:54,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:24:54,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007146692] [2019-11-16 00:24:54,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500702536] [2019-11-16 00:24:54,857 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:54,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:54,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:24:54,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:55,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:55,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:55,240 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:55,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-16 00:24:55,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871343635] [2019-11-16 00:24:55,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:24:55,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:24:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:24:55,242 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 19 states. [2019-11-16 00:24:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:55,935 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-16 00:24:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:24:55,936 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-11-16 00:24:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:55,937 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:24:55,937 INFO L226 Difference]: Without dead ends: 57 [2019-11-16 00:24:55,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:24:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-16 00:24:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-11-16 00:24:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:24:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-16 00:24:55,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-11-16 00:24:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:55,948 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-16 00:24:55,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:24:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-16 00:24:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:55,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:55,949 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:56,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:56,153 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2085108794, now seen corresponding path program 3 times [2019-11-16 00:24:56,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:56,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862104934] [2019-11-16 00:24:56,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:24:56,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862104934] [2019-11-16 00:24:56,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703258284] [2019-11-16 00:24:56,410 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/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-16 00:24:56,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:24:56,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:56,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:24:56,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:56,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:56,838 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:56,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-11-16 00:24:56,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133186032] [2019-11-16 00:24:56,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:24:56,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:56,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:24:56,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:24:56,843 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states. [2019-11-16 00:24:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:59,312 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-16 00:24:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:24:59,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-11-16 00:24:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:59,313 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:24:59,313 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:24:59,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2019-11-16 00:24:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:24:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:24:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:24:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:24:59,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-16 00:24:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:59,316 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:24:59,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:24:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:24:59,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:24:59,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:59,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:25:00,222 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-11-16 00:25:00,618 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-11-16 00:25:00,846 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-16 00:25:01,135 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-11-16 00:25:01,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,137 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-16 00:25:01,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:25:01,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:25:01,138 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,138 INFO L439 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) .cse0 (= 0 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_main_~buf~0 1) .cse1 .cse2 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse3) (and (<= 2 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 2) .cse0 .cse1 .cse2 .cse3))) [2019-11-16 00:25:01,138 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,138 INFO L439 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse2 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 2 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_main_~buf~0 1) .cse1 .cse2 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse3) (and (= ULTIMATE.start_main_~in~0 0) .cse0 (= 0 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse0 (and (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (<= 0 ULTIMATE.start_main_~in~0)) .cse1 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) .cse3))) [2019-11-16 00:25:01,138 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,139 INFO L439 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse1 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse1) (and (<= 2 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 2) .cse0 .cse2 .cse3 .cse1) (and .cse0 (<= ULTIMATE.start_main_~buf~0 1) .cse2 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse1))) [2019-11-16 00:25:01,139 INFO L443 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,139 INFO L439 ceAbstractionStarter]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2) (and (<= 2 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 2) .cse0 .cse1 .cse3 .cse2) (and (= ULTIMATE.start_main_~in~0 0) .cse0 (= 0 ULTIMATE.start_main_~buf~0) .cse3 .cse2) (and .cse0 (<= ULTIMATE.start_main_~buf~0 1) .cse1 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2))) [2019-11-16 00:25:01,139 INFO L443 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,139 INFO L439 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-16 00:25:01,140 INFO L443 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,140 INFO L439 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-16 00:25:01,140 INFO L443 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,140 INFO L439 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-16 00:25:01,140 INFO L443 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-16 00:25:01,140 INFO L446 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,141 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,142 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-16 00:25:01,143 INFO L446 ceAbstractionStarter]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-16 00:25:01,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-16 00:25:01,144 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-16 00:25:01,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:25:01 BoogieIcfgContainer [2019-11-16 00:25:01,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:25:01,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:25:01,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:25:01,173 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:25:01,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:48" (3/4) ... [2019-11-16 00:25:01,178 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:25:01,192 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-16 00:25:01,193 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:25:01,278 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53ddbc73-c849-467b-968c-e124f3d19c5a/bin/uautomizer/witness.graphml [2019-11-16 00:25:01,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:25:01,281 INFO L168 Benchmark]: Toolchain (without parser) took 13907.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 950.2 MB in the beginning and 967.5 MB in the end (delta: -17.4 MB). Peak memory consumption was 182.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,281 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:01,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:01,283 INFO L168 Benchmark]: Boogie Preprocessor took 37.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,283 INFO L168 Benchmark]: RCFGBuilder took 328.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,284 INFO L168 Benchmark]: TraceAbstraction took 13112.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 969.8 MB in the end (delta: 142.2 MB). Peak memory consumption was 201.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,284 INFO L168 Benchmark]: Witness Printer took 105.80 ms. Allocated memory is still 1.2 GB. Free memory was 969.8 MB in the beginning and 967.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:01,286 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 328.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13112.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 969.8 MB in the end (delta: 142.2 MB). Peak memory consumption was 201.5 MB. Max. memory is 11.5 GB. * Witness Printer took 105.80 ms. Allocated memory is still 1.2 GB. Free memory was 969.8 MB in the beginning and 967.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((2 <= buf && in == 2) && bufferlen == buflim + 2) && 1 == cond) && bufferlen < inlen) && buf < buflim) || ((((((bufferlen == buflim + 2 && buf <= 1) && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buf < buflim)) || (((((in == 0 && bufferlen == buflim + 2) && 0 == buf) && 1 == cond) && bufferlen < inlen) && buf < buflim)) || (((((3 <= buf && bufferlen == buflim + 2) && bufferlen + 1 <= inlen && 0 <= in) && 1 == cond) && buflim + in + 3 <= buf + inlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((3 <= buf && bufferlen + 1 <= inlen) && bufferlen == buflim + 2) && !(0 == cond)) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buf <= buflim) || (((((2 <= buf && in == 2) && bufferlen == buflim + 2) && 1 == cond) && bufferlen < inlen) && buf <= buflim)) || ((((((bufferlen == buflim + 2 && buf <= 1) && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buf <= buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && bufferlen == buflim + 2) && 0 == buf) && 1 == cond) && bufferlen < inlen) && buf < buflim) || ((((((bufferlen == buflim + 2 && buf <= 1) && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buf < buflim)) || ((((((3 <= buf && bufferlen + 1 <= inlen) && bufferlen == buflim + 2) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buf < buflim)) || (((((2 <= buf && in == 2) && bufferlen == buflim + 2) && 1 == cond) && bufferlen < inlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((3 <= buf && bufferlen + 1 <= inlen) && bufferlen == buflim + 2) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buf <= buflim) || (((((2 <= buf && in == 2) && bufferlen == buflim + 2) && 1 == cond) && bufferlen < inlen) && buf <= buflim)) || ((((in == 0 && bufferlen == buflim + 2) && 0 == buf) && bufferlen < inlen) && buf <= buflim)) || ((((((bufferlen == buflim + 2 && buf <= 1) && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 8 error locations. Result: SAFE, OverallTime: 13.0s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 329 SDtfs, 1146 SDslu, 1123 SDs, 0 SdLazy, 1556 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 51 NumberOfFragments, 424 HoareAnnotationTreeSize, 10 FomulaSimplifications, 8160 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1013 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 122483 SizeOfPredicates, 41 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 41/302 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...