./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/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 e1af67db67a88433de1a31e57b46e50dcbb6e7d8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:00:41,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:00:41,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:00:41,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:00:41,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:00:41,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:00:41,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:00:41,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:00:41,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:00:41,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:00:41,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:00:41,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:00:41,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:00:41,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:00:41,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:00:41,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:00:41,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:00:41,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:00:41,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:00:41,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:00:41,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:00:41,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:00:41,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:00:41,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:00:41,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:00:41,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:00:41,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:00:41,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:00:41,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:00:41,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:00:41,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:00:41,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:00:41,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:00:41,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:00:41,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:00:41,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:00:41,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:00:41,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:00:41,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:00:41,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:00:41,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:00:41,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:00:41,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:00:41,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:00:41,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:00:41,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:00:41,720 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:00:41,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:00:41,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:00:41,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:00:41,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:00:41,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:00:41,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:00:41,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:00:41,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:00:41,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:00:41,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:00:41,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:00:41,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:00:41,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:00:41,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:00:41,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:00:41,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:00:41,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:00:41,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:00:41,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:00:41,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:00:41,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:00:41,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:00:41,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:00:41,725 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_e10ca805-b555-4fda-94a6-e5ff5edc2adb/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 -> e1af67db67a88433de1a31e57b46e50dcbb6e7d8 [2019-11-20 10:00:41,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:00:41,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:00:41,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:00:41,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:00:41,887 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:00:41,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-20 10:00:41,944 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/data/cd582d3a8/4817ea7fd8e1499d9270054dcad2da73/FLAG38cb33076 [2019-11-20 10:00:42,416 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:00:42,416 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-20 10:00:42,435 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/data/cd582d3a8/4817ea7fd8e1499d9270054dcad2da73/FLAG38cb33076 [2019-11-20 10:00:42,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/data/cd582d3a8/4817ea7fd8e1499d9270054dcad2da73 [2019-11-20 10:00:42,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:00:42,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:00:42,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:00:42,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:00:42,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:00:42,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:00:42" (1/1) ... [2019-11-20 10:00:42,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2190a7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:42, skipping insertion in model container [2019-11-20 10:00:42,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:00:42" (1/1) ... [2019-11-20 10:00:42,462 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:00:42,516 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:00:43,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:00:43,067 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:00:43,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:00:43,181 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:00:43,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43 WrapperNode [2019-11-20 10:00:43,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:00:43,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:00:43,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:00:43,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:00:43,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:00:43,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:00:43,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:00:43,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:00:43,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... [2019-11-20 10:00:43,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:00:43,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:00:43,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:00:43,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:00:43,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:00:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:00:43,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:00:44,620 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:00:44,621 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:00:44,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:00:44 BoogieIcfgContainer [2019-11-20 10:00:44,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:00:44,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:00:44,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:00:44,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:00:44,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:00:42" (1/3) ... [2019-11-20 10:00:44,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e90f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:00:44, skipping insertion in model container [2019-11-20 10:00:44,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:00:43" (2/3) ... [2019-11-20 10:00:44,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e90f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:00:44, skipping insertion in model container [2019-11-20 10:00:44,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:00:44" (3/3) ... [2019-11-20 10:00:44,629 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-11-20 10:00:44,638 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:00:44,644 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:00:44,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:00:44,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:00:44,677 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:00:44,677 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:00:44,677 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:00:44,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:00:44,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:00:44,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:00:44,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:00:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 10:00:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:00:44,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:44,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:44,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 857291087, now seen corresponding path program 1 times [2019-11-20 10:00:44,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:44,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169042277] [2019-11-20 10:00:44,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:45,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169042277] [2019-11-20 10:00:45,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:45,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:00:45,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051635410] [2019-11-20 10:00:45,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:00:45,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:00:45,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:45,057 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-20 10:00:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:45,926 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-20 10:00:45,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:00:45,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-20 10:00:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:45,950 INFO L225 Difference]: With dead ends: 528 [2019-11-20 10:00:45,950 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 10:00:45,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 10:00:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-20 10:00:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 10:00:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-20 10:00:46,020 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 88 [2019-11-20 10:00:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:46,021 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-20 10:00:46,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:00:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-20 10:00:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 10:00:46,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:46,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:46,026 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1648492327, now seen corresponding path program 1 times [2019-11-20 10:00:46,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:46,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004919963] [2019-11-20 10:00:46,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:46,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004919963] [2019-11-20 10:00:46,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:00:46,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426021972] [2019-11-20 10:00:46,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:46,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:46,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:46,110 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-20 10:00:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:46,745 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-20 10:00:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:00:46,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-20 10:00:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:46,749 INFO L225 Difference]: With dead ends: 792 [2019-11-20 10:00:46,749 INFO L226 Difference]: Without dead ends: 528 [2019-11-20 10:00:46,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-20 10:00:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-20 10:00:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-20 10:00:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-20 10:00:46,781 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 93 [2019-11-20 10:00:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-20 10:00:46,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-20 10:00:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:00:46,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:46,786 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:46,786 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1380296349, now seen corresponding path program 1 times [2019-11-20 10:00:46,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:46,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662616675] [2019-11-20 10:00:46,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:46,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662616675] [2019-11-20 10:00:46,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:46,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:00:46,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970525445] [2019-11-20 10:00:46,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:46,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:46,867 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-20 10:00:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:47,742 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-20 10:00:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:00:47,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:00:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:47,755 INFO L225 Difference]: With dead ends: 2102 [2019-11-20 10:00:47,755 INFO L226 Difference]: Without dead ends: 1576 [2019-11-20 10:00:47,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-20 10:00:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-20 10:00:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 10:00:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2049 transitions. [2019-11-20 10:00:47,806 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2049 transitions. Word has length 97 [2019-11-20 10:00:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:47,806 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2049 transitions. [2019-11-20 10:00:47,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2049 transitions. [2019-11-20 10:00:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:00:47,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:47,810 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:47,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 406434676, now seen corresponding path program 1 times [2019-11-20 10:00:47,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:47,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659660315] [2019-11-20 10:00:47,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 10:00:47,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659660315] [2019-11-20 10:00:47,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:47,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:00:47,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509716873] [2019-11-20 10:00:47,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:00:47,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:00:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:47,877 INFO L87 Difference]: Start difference. First operand 1576 states and 2049 transitions. Second operand 3 states. [2019-11-20 10:00:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:48,447 INFO L93 Difference]: Finished difference Result 3412 states and 4461 transitions. [2019-11-20 10:00:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:00:48,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 10:00:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:48,460 INFO L225 Difference]: With dead ends: 3412 [2019-11-20 10:00:48,460 INFO L226 Difference]: Without dead ends: 1838 [2019-11-20 10:00:48,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-20 10:00:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-20 10:00:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-20 10:00:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1702 transitions. [2019-11-20 10:00:48,511 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1702 transitions. Word has length 100 [2019-11-20 10:00:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:48,512 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1702 transitions. [2019-11-20 10:00:48,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:00:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1702 transitions. [2019-11-20 10:00:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:00:48,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:48,516 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:48,517 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2015967182, now seen corresponding path program 1 times [2019-11-20 10:00:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:48,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033049252] [2019-11-20 10:00:48,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:48,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033049252] [2019-11-20 10:00:48,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:48,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:00:48,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745701641] [2019-11-20 10:00:48,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:48,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:48,691 INFO L87 Difference]: Start difference. First operand 1314 states and 1702 transitions. Second operand 4 states. [2019-11-20 10:00:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:49,347 INFO L93 Difference]: Finished difference Result 2762 states and 3556 transitions. [2019-11-20 10:00:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:00:49,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 10:00:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:49,355 INFO L225 Difference]: With dead ends: 2762 [2019-11-20 10:00:49,355 INFO L226 Difference]: Without dead ends: 1450 [2019-11-20 10:00:49,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-20 10:00:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-20 10:00:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-20 10:00:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 10:00:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1839 transitions. [2019-11-20 10:00:49,397 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1839 transitions. Word has length 103 [2019-11-20 10:00:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:49,398 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1839 transitions. [2019-11-20 10:00:49,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1839 transitions. [2019-11-20 10:00:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 10:00:49,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:49,401 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:49,401 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2265750, now seen corresponding path program 1 times [2019-11-20 10:00:49,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:49,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899727722] [2019-11-20 10:00:49,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:49,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899727722] [2019-11-20 10:00:49,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:49,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:00:49,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411718291] [2019-11-20 10:00:49,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:00:49,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:00:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:00:49,533 INFO L87 Difference]: Start difference. First operand 1445 states and 1839 transitions. Second operand 5 states. [2019-11-20 10:00:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:50,461 INFO L93 Difference]: Finished difference Result 2757 states and 3539 transitions. [2019-11-20 10:00:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:00:50,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-20 10:00:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:50,469 INFO L225 Difference]: With dead ends: 2757 [2019-11-20 10:00:50,469 INFO L226 Difference]: Without dead ends: 1445 [2019-11-20 10:00:50,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:00:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-20 10:00:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-20 10:00:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 10:00:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1809 transitions. [2019-11-20 10:00:50,507 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1809 transitions. Word has length 107 [2019-11-20 10:00:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:50,508 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1809 transitions. [2019-11-20 10:00:50,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:00:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1809 transitions. [2019-11-20 10:00:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 10:00:50,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:50,511 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:50,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash 68334944, now seen corresponding path program 1 times [2019-11-20 10:00:50,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:50,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406020126] [2019-11-20 10:00:50,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:00:50,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406020126] [2019-11-20 10:00:50,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:50,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:00:50,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557321855] [2019-11-20 10:00:50,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:00:50,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:00:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:50,594 INFO L87 Difference]: Start difference. First operand 1445 states and 1809 transitions. Second operand 3 states. [2019-11-20 10:00:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:50,982 INFO L93 Difference]: Finished difference Result 2757 states and 3479 transitions. [2019-11-20 10:00:50,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:00:50,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-20 10:00:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:50,989 INFO L225 Difference]: With dead ends: 2757 [2019-11-20 10:00:50,990 INFO L226 Difference]: Without dead ends: 1445 [2019-11-20 10:00:50,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-20 10:00:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-20 10:00:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 10:00:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1803 transitions. [2019-11-20 10:00:51,025 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1803 transitions. Word has length 108 [2019-11-20 10:00:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:51,026 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1803 transitions. [2019-11-20 10:00:51,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:00:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1803 transitions. [2019-11-20 10:00:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:00:51,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:51,029 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:51,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash -69619749, now seen corresponding path program 1 times [2019-11-20 10:00:51,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:51,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930451487] [2019-11-20 10:00:51,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:51,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930451487] [2019-11-20 10:00:51,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:51,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:00:51,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663806658] [2019-11-20 10:00:51,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:00:51,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:00:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:51,079 INFO L87 Difference]: Start difference. First operand 1445 states and 1803 transitions. Second operand 3 states. [2019-11-20 10:00:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:51,581 INFO L93 Difference]: Finished difference Result 3150 states and 3946 transitions. [2019-11-20 10:00:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:00:51,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-20 10:00:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:51,589 INFO L225 Difference]: With dead ends: 3150 [2019-11-20 10:00:51,589 INFO L226 Difference]: Without dead ends: 1707 [2019-11-20 10:00:51,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:00:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-20 10:00:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-20 10:00:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 10:00:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1741 transitions. [2019-11-20 10:00:51,626 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1741 transitions. Word has length 110 [2019-11-20 10:00:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:51,626 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1741 transitions. [2019-11-20 10:00:51,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:00:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1741 transitions. [2019-11-20 10:00:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 10:00:51,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:51,629 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:51,629 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1256717015, now seen corresponding path program 1 times [2019-11-20 10:00:51,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:51,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917943197] [2019-11-20 10:00:51,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:51,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917943197] [2019-11-20 10:00:51,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:51,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:00:51,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680817682] [2019-11-20 10:00:51,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:51,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:51,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:51,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:51,748 INFO L87 Difference]: Start difference. First operand 1576 states and 1741 transitions. Second operand 4 states. [2019-11-20 10:00:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:52,402 INFO L93 Difference]: Finished difference Result 3150 states and 3502 transitions. [2019-11-20 10:00:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:00:52,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-20 10:00:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:52,409 INFO L225 Difference]: With dead ends: 3150 [2019-11-20 10:00:52,410 INFO L226 Difference]: Without dead ends: 1707 [2019-11-20 10:00:52,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-20 10:00:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-20 10:00:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 10:00:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1545 transitions. [2019-11-20 10:00:52,439 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1545 transitions. Word has length 125 [2019-11-20 10:00:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:52,439 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1545 transitions. [2019-11-20 10:00:52,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1545 transitions. [2019-11-20 10:00:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 10:00:52,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:52,443 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:52,443 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 144240950, now seen corresponding path program 1 times [2019-11-20 10:00:52,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:52,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685877305] [2019-11-20 10:00:52,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:00:53,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685877305] [2019-11-20 10:00:53,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:53,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:00:53,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218479892] [2019-11-20 10:00:53,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:00:53,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:00:53,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:00:53,125 INFO L87 Difference]: Start difference. First operand 1445 states and 1545 transitions. Second operand 13 states. [2019-11-20 10:00:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:54,426 INFO L93 Difference]: Finished difference Result 3936 states and 4248 transitions. [2019-11-20 10:00:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 10:00:54,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-11-20 10:00:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:54,441 INFO L225 Difference]: With dead ends: 3936 [2019-11-20 10:00:54,441 INFO L226 Difference]: Without dead ends: 2624 [2019-11-20 10:00:54,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2019-11-20 10:00:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-20 10:00:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1771. [2019-11-20 10:00:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-20 10:00:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1899 transitions. [2019-11-20 10:00:54,478 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1899 transitions. Word has length 138 [2019-11-20 10:00:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:54,479 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 1899 transitions. [2019-11-20 10:00:54,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:00:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1899 transitions. [2019-11-20 10:00:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 10:00:54,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:54,483 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:54,484 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1039496222, now seen corresponding path program 1 times [2019-11-20 10:00:54,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:54,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598305974] [2019-11-20 10:00:54,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 10:00:54,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598305974] [2019-11-20 10:00:54,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:54,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:00:54,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272470897] [2019-11-20 10:00:54,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:54,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:54,596 INFO L87 Difference]: Start difference. First operand 1771 states and 1899 transitions. Second operand 4 states. [2019-11-20 10:00:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:55,186 INFO L93 Difference]: Finished difference Result 3671 states and 3960 transitions. [2019-11-20 10:00:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:00:55,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 10:00:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:55,194 INFO L225 Difference]: With dead ends: 3671 [2019-11-20 10:00:55,194 INFO L226 Difference]: Without dead ends: 1902 [2019-11-20 10:00:55,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-11-20 10:00:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1771. [2019-11-20 10:00:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-20 10:00:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1876 transitions. [2019-11-20 10:00:55,227 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1876 transitions. Word has length 181 [2019-11-20 10:00:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:55,227 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 1876 transitions. [2019-11-20 10:00:55,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1876 transitions. [2019-11-20 10:00:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 10:00:55,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:55,232 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:55,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 293882658, now seen corresponding path program 1 times [2019-11-20 10:00:55,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:55,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98755198] [2019-11-20 10:00:55,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 10:00:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98755198] [2019-11-20 10:00:55,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:55,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:00:55,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956697114] [2019-11-20 10:00:55,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:55,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:55,390 INFO L87 Difference]: Start difference. First operand 1771 states and 1876 transitions. Second operand 4 states. [2019-11-20 10:00:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:56,163 INFO L93 Difference]: Finished difference Result 4652 states and 4929 transitions. [2019-11-20 10:00:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:00:56,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-20 10:00:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:56,177 INFO L225 Difference]: With dead ends: 4652 [2019-11-20 10:00:56,177 INFO L226 Difference]: Without dead ends: 2883 [2019-11-20 10:00:56,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-11-20 10:00:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2295. [2019-11-20 10:00:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-11-20 10:00:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2406 transitions. [2019-11-20 10:00:56,221 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2406 transitions. Word has length 230 [2019-11-20 10:00:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:56,221 INFO L462 AbstractCegarLoop]: Abstraction has 2295 states and 2406 transitions. [2019-11-20 10:00:56,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2406 transitions. [2019-11-20 10:00:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 10:00:56,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:00:56,227 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:00:56,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:00:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:00:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1503326134, now seen corresponding path program 1 times [2019-11-20 10:00:56,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:00:56,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596737961] [2019-11-20 10:00:56,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:00:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:00:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-20 10:00:56,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596737961] [2019-11-20 10:00:56,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:00:56,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:00:56,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759282442] [2019-11-20 10:00:56,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:00:56,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:00:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:00:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:56,412 INFO L87 Difference]: Start difference. First operand 2295 states and 2406 transitions. Second operand 4 states. [2019-11-20 10:00:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:00:57,090 INFO L93 Difference]: Finished difference Result 5110 states and 5357 transitions. [2019-11-20 10:00:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:00:57,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-20 10:00:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:00:57,091 INFO L225 Difference]: With dead ends: 5110 [2019-11-20 10:00:57,091 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:00:57,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:00:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:00:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:00:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:00:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:00:57,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2019-11-20 10:00:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:00:57,095 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:00:57,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:00:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:00:57,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:00:57,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:00:57,836 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-11-20 10:00:58,448 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-11-20 10:00:58,453 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 10:00:58,453 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 10:00:58,453 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,453 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,453 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 10:00:58,454 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 10:00:58,455 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 10:00:58,456 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 10:00:58,457 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse11 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse14 (= ~a17~0 1)) (.cse7 (= ~a16~0 6)) (.cse6 (= 15 ~a8~0)) (.cse17 (= ~a16~0 5))) (let ((.cse12 (<= ~a17~0 0)) (.cse1 (not .cse17)) (.cse8 (= 5 ~a16~0)) (.cse10 (= 14 ~a8~0)) (.cse9 (<= ~a20~0 0)) (.cse2 (not .cse6)) (.cse0 (= 1 ~a7~0)) (.cse13 (not .cse7)) (.cse3 (not (= ~a7~0 1))) (.cse4 (= ~a12~0 8)) (.cse16 (not (= ~a20~0 1))) (.cse15 (and .cse11 .cse5 (not .cse14)))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12 .cse5) (and .cse11 .cse4 .cse12 .cse5) (and .cse13 .cse14 .cse5 .cse1) (and .cse15 .cse2) (and .cse0 .cse5 .cse8 .cse9) (and .cse16 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse10) (and .cse14 .cse5 .cse7 .cse9) (and .cse0 .cse2 .cse14) (and .cse2 .cse14 .cse5 .cse7) (and .cse0 .cse13 .cse14 .cse5) (and .cse3 .cse4 .cse5 .cse6 .cse17) (and .cse16 .cse15)))) [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,458 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 10:00:58,459 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 10:00:58,460 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,461 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,465 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 10:00:58,466 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 10:00:58,467 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 10:00:58,468 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 10:00:58,468 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 10:00:58,468 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 10:00:58,469 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,469 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse11 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse14 (= ~a17~0 1)) (.cse7 (= ~a16~0 6)) (.cse6 (= 15 ~a8~0)) (.cse17 (= ~a16~0 5))) (let ((.cse12 (<= ~a17~0 0)) (.cse1 (not .cse17)) (.cse8 (= 5 ~a16~0)) (.cse10 (= 14 ~a8~0)) (.cse9 (<= ~a20~0 0)) (.cse2 (not .cse6)) (.cse0 (= 1 ~a7~0)) (.cse13 (not .cse7)) (.cse3 (not (= ~a7~0 1))) (.cse4 (= ~a12~0 8)) (.cse16 (not (= ~a20~0 1))) (.cse15 (and .cse11 .cse5 (not .cse14)))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12 .cse5) (and .cse11 .cse4 .cse12 .cse5) (and .cse13 .cse14 .cse5 .cse1) (and .cse15 .cse2) (and .cse0 .cse5 .cse8 .cse9) (and .cse16 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse10) (and .cse14 .cse5 .cse7 .cse9) (and .cse0 .cse2 .cse14) (and .cse2 .cse14 .cse5 .cse7) (and .cse0 .cse13 .cse14 .cse5) (and .cse3 .cse4 .cse5 .cse6 .cse17) (and .cse16 .cse15)))) [2019-11-20 10:00:58,469 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 10:00:58,470 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 10:00:58,471 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 10:00:58,471 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 10:00:58,471 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 10:00:58,471 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 10:00:58,471 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,472 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 10:00:58,473 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 10:00:58,474 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,475 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 10:00:58,476 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 10:00:58,477 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,478 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 10:00:58,479 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 10:00:58,480 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 10:00:58,481 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:00:58,481 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-11-20 10:00:58,481 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 10:00:58,481 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,482 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 10:00:58,483 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 10:00:58,484 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 10:00:58,484 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 10:00:58,484 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 10:00:58,484 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 10:00:58,484 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 10:00:58,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:00:58 BoogieIcfgContainer [2019-11-20 10:00:58,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:00:58,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:00:58,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:00:58,559 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:00:58,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:00:44" (3/4) ... [2019-11-20 10:00:58,563 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:00:58,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 10:00:58,592 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:00:58,743 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e10ca805-b555-4fda-94a6-e5ff5edc2adb/bin/uautomizer/witness.graphml [2019-11-20 10:00:58,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:00:58,744 INFO L168 Benchmark]: Toolchain (without parser) took 16294.91 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 524.8 MB). Free memory was 940.6 MB in the beginning and 1.5 GB in the end (delta: -550.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:00:58,745 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:00:58,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:00:58,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.67 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:00:58,746 INFO L168 Benchmark]: Boogie Preprocessor took 67.32 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-20 10:00:58,746 INFO L168 Benchmark]: RCFGBuilder took 1278.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:00:58,746 INFO L168 Benchmark]: TraceAbstraction took 13935.98 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 349.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -482.8 MB). Peak memory consumption was 424.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:00:58,747 INFO L168 Benchmark]: Witness Printer took 184.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:00:58,749 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.67 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.32 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. * RCFGBuilder took 1278.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13935.98 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 349.7 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -482.8 MB). Peak memory consumption was 424.4 MB. Max. memory is 11.5 GB. * Witness Printer took 184.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && !(a16 == 5)) && !(15 == a8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || (((a21 == 1 && 5 == a16) && a20 <= 0) && 14 == a8)) || (((1 == a7 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && !(a16 == 5))) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(15 == a8))) || (((1 == a7 && a21 == 1) && 5 == a16) && a20 <= 0)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || ((1 == a7 && a21 == 1) && 14 == a8)) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a17 == 1)) || (((!(15 == a8) && a17 == 1) && a21 == 1) && a16 == 6)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (!(a20 == 1) && (a16 == 4 && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && !(a16 == 5)) && !(15 == a8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || (((a21 == 1 && 5 == a16) && a20 <= 0) && 14 == a8)) || (((1 == a7 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && !(a16 == 5))) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(15 == a8))) || (((1 == a7 && a21 == 1) && 5 == a16) && a20 <= 0)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || ((1 == a7 && a21 == 1) && 14 == a8)) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a17 == 1)) || (((!(15 == a8) && a17 == 1) && a21 == 1) && a16 == 6)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (!(a20 == 1) && (a16 == 4 && a21 == 1) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 1188 SDtfs, 3694 SDslu, 158 SDs, 0 SdLazy, 7286 SolverSat, 949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2295occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2494 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 57 NumberOfFragments, 453 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4527 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1554 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1713 NumberOfCodeBlocks, 1713 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 913999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 945/945 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...