./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/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 e2b1b3074ba1970495a934bff93d8ae3ffe89d9a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:35:08,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:35:08,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:35:08,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:35:08,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:35:08,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:35:08,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:35:08,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:35:08,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:35:08,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:35:08,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:35:08,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:35:08,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:35:08,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:35:08,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:35:08,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:35:08,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:35:08,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:35:08,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:35:08,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:35:08,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:35:08,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:35:08,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:35:08,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:35:08,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:35:08,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:35:08,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:35:08,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:35:08,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:35:08,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:35:08,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:35:08,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:35:08,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:35:08,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:35:08,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:35:08,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:35:08,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:35:08,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:35:08,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:35:08,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:35:08,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:35:08,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:35:08,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:35:08,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:35:08,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:35:08,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:35:08,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:35:08,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:35:08,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:35:08,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:35:08,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:35:08,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:35:08,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:35:08,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:35:08,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:35:08,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:35:08,271 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_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/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 -> e2b1b3074ba1970495a934bff93d8ae3ffe89d9a [2019-12-07 18:35:08,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:35:08,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:35:08,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:35:08,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:35:08,384 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:35:08,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2019-12-07 18:35:08,426 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/data/f2cc4a38a/27bbb98eaa84435bb03f456e9ca74fb9/FLAG7ce137a49 [2019-12-07 18:35:08,870 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:35:08,870 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2019-12-07 18:35:08,880 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/data/f2cc4a38a/27bbb98eaa84435bb03f456e9ca74fb9/FLAG7ce137a49 [2019-12-07 18:35:09,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/data/f2cc4a38a/27bbb98eaa84435bb03f456e9ca74fb9 [2019-12-07 18:35:09,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:35:09,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:35:09,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:09,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:35:09,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:35:09,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581f3bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09, skipping insertion in model container [2019-12-07 18:35:09,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:35:09,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:35:09,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:09,570 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:35:09,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:09,669 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:35:09,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09 WrapperNode [2019-12-07 18:35:09,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:09,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:35:09,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:35:09,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:35:09,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:35:09,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:35:09,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:35:09,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:35:09,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... [2019-12-07 18:35:09,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:35:09,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:35:09,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:35:09,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:35:09,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/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-12-07 18:35:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:35:09,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:35:10,576 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:35:10,576 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:35:10,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:10 BoogieIcfgContainer [2019-12-07 18:35:10,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:35:10,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:35:10,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:35:10,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:35:10,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:35:09" (1/3) ... [2019-12-07 18:35:10,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4427fa3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:10, skipping insertion in model container [2019-12-07 18:35:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:09" (2/3) ... [2019-12-07 18:35:10,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4427fa3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:10, skipping insertion in model container [2019-12-07 18:35:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:10" (3/3) ... [2019-12-07 18:35:10,585 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2019-12-07 18:35:10,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:35:10,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:35:10,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:35:10,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:35:10,637 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:35:10,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:35:10,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:35:10,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:35:10,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:35:10,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:35:10,638 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:35:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 18:35:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:35:10,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:10,666 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] [2019-12-07 18:35:10,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-12-07 18:35:10,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:10,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357094641] [2019-12-07 18:35:10,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:10,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357094641] [2019-12-07 18:35:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:10,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:10,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780258865] [2019-12-07 18:35:10,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:10,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:10,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:10,850 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-12-07 18:35:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:11,826 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-12-07 18:35:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:11,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 18:35:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:11,839 INFO L225 Difference]: With dead ends: 850 [2019-12-07 18:35:11,840 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 18:35:11,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 18:35:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 18:35:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 18:35:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 18:35:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-12-07 18:35:11,892 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 32 [2019-12-07 18:35:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:11,892 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-12-07 18:35:11,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-12-07 18:35:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 18:35:11,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:11,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:35:11,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 266816249, now seen corresponding path program 1 times [2019-12-07 18:35:11,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:11,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289981864] [2019-12-07 18:35:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:12,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289981864] [2019-12-07 18:35:12,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:12,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:12,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704195517] [2019-12-07 18:35:12,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:12,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:12,012 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-12-07 18:35:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:12,793 INFO L93 Difference]: Finished difference Result 2144 states and 3249 transitions. [2019-12-07 18:35:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:12,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 18:35:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:12,800 INFO L225 Difference]: With dead ends: 2144 [2019-12-07 18:35:12,800 INFO L226 Difference]: Without dead ends: 1608 [2019-12-07 18:35:12,801 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-12-07 18:35:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-12-07 18:35:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2019-12-07 18:35:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-07 18:35:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2208 transitions. [2019-12-07 18:35:12,833 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2208 transitions. Word has length 114 [2019-12-07 18:35:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:12,833 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 2208 transitions. [2019-12-07 18:35:12,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2208 transitions. [2019-12-07 18:35:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 18:35:12,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:12,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:35:12,836 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:12,836 INFO L82 PathProgramCache]: Analyzing trace with hash -827986371, now seen corresponding path program 1 times [2019-12-07 18:35:12,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:12,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147975735] [2019-12-07 18:35:12,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:13,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147975735] [2019-12-07 18:35:13,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922859325] [2019-12-07 18:35:13,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:13,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:35:13,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 18:35:13,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-12-07 18:35:13,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607332014] [2019-12-07 18:35:13,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:13,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:13,116 INFO L87 Difference]: Start difference. First operand 1606 states and 2208 transitions. Second operand 3 states. [2019-12-07 18:35:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:13,696 INFO L93 Difference]: Finished difference Result 2854 states and 3985 transitions. [2019-12-07 18:35:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:13,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-12-07 18:35:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:13,711 INFO L225 Difference]: With dead ends: 2854 [2019-12-07 18:35:13,711 INFO L226 Difference]: Without dead ends: 2852 [2019-12-07 18:35:13,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-12-07 18:35:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1428. [2019-12-07 18:35:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 18:35:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2019-12-07 18:35:13,743 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 138 [2019-12-07 18:35:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:13,744 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2019-12-07 18:35:13,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2019-12-07 18:35:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 18:35:13,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:13,746 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 18:35:13,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:13,947 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash 819167030, now seen corresponding path program 1 times [2019-12-07 18:35:13,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:13,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725208995] [2019-12-07 18:35:13,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:35:14,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725208995] [2019-12-07 18:35:14,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:14,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:14,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390921580] [2019-12-07 18:35:14,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:14,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:14,014 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2019-12-07 18:35:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:14,824 INFO L93 Difference]: Finished difference Result 4278 states and 5972 transitions. [2019-12-07 18:35:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:14,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-12-07 18:35:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:14,834 INFO L225 Difference]: With dead ends: 4278 [2019-12-07 18:35:14,835 INFO L226 Difference]: Without dead ends: 2852 [2019-12-07 18:35:14,836 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-12-07 18:35:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-12-07 18:35:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2019-12-07 18:35:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-12-07 18:35:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3217 transitions. [2019-12-07 18:35:14,890 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3217 transitions. Word has length 177 [2019-12-07 18:35:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:14,890 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 3217 transitions. [2019-12-07 18:35:14,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3217 transitions. [2019-12-07 18:35:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 18:35:14,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:14,892 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 18:35:14,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 872689753, now seen corresponding path program 1 times [2019-12-07 18:35:14,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:14,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170506699] [2019-12-07 18:35:14,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 132 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:35:15,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170506699] [2019-12-07 18:35:15,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268701749] [2019-12-07 18:35:15,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:15,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:35:15,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:35:15,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:15,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:15,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773345565] [2019-12-07 18:35:15,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:15,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:15,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:35:15,139 INFO L87 Difference]: Start difference. First operand 2496 states and 3217 transitions. Second operand 4 states. [2019-12-07 18:35:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:15,738 INFO L93 Difference]: Finished difference Result 5226 states and 6692 transitions. [2019-12-07 18:35:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:15,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-12-07 18:35:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:15,748 INFO L225 Difference]: With dead ends: 5226 [2019-12-07 18:35:15,748 INFO L226 Difference]: Without dead ends: 2674 [2019-12-07 18:35:15,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:35:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-12-07 18:35:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-12-07 18:35:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 18:35:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2574 transitions. [2019-12-07 18:35:15,783 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2574 transitions. Word has length 191 [2019-12-07 18:35:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:15,784 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2574 transitions. [2019-12-07 18:35:15,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2574 transitions. [2019-12-07 18:35:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-12-07 18:35:15,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:15,787 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:35:15,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:15,989 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash -424271452, now seen corresponding path program 1 times [2019-12-07 18:35:15,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:15,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67657865] [2019-12-07 18:35:15,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 209 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:35:16,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67657865] [2019-12-07 18:35:16,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187646244] [2019-12-07 18:35:16,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:16,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:35:16,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 18:35:16,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:16,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-12-07 18:35:16,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832948836] [2019-12-07 18:35:16,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:35:16,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:35:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:35:16,707 INFO L87 Difference]: Start difference. First operand 2318 states and 2574 transitions. Second operand 7 states. [2019-12-07 18:35:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:17,280 INFO L93 Difference]: Finished difference Result 4912 states and 5436 transitions. [2019-12-07 18:35:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:35:17,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2019-12-07 18:35:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:17,290 INFO L225 Difference]: With dead ends: 4912 [2019-12-07 18:35:17,290 INFO L226 Difference]: Without dead ends: 2496 [2019-12-07 18:35:17,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:35:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2019-12-07 18:35:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2019-12-07 18:35:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 18:35:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2526 transitions. [2019-12-07 18:35:17,327 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2526 transitions. Word has length 286 [2019-12-07 18:35:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:17,328 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2526 transitions. [2019-12-07 18:35:17,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:35:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2526 transitions. [2019-12-07 18:35:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-12-07 18:35:17,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:17,340 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:35:17,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:17,541 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1180337235, now seen corresponding path program 1 times [2019-12-07 18:35:17,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262180134] [2019-12-07 18:35:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 551 proven. 4 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-12-07 18:35:18,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262180134] [2019-12-07 18:35:18,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291733661] [2019-12-07 18:35:18,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:18,255 INFO L264 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:35:18,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:35:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 532 proven. 23 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-12-07 18:35:18,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:18,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 18:35:18,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964381794] [2019-12-07 18:35:18,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:35:18,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:35:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:35:18,596 INFO L87 Difference]: Start difference. First operand 2318 states and 2526 transitions. Second operand 8 states. [2019-12-07 18:35:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:19,657 INFO L93 Difference]: Finished difference Result 5394 states and 5828 transitions. [2019-12-07 18:35:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:35:19,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 521 [2019-12-07 18:35:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:19,667 INFO L225 Difference]: With dead ends: 5394 [2019-12-07 18:35:19,667 INFO L226 Difference]: Without dead ends: 3078 [2019-12-07 18:35:19,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:35:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-12-07 18:35:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2318. [2019-12-07 18:35:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 18:35:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2524 transitions. [2019-12-07 18:35:19,697 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2524 transitions. Word has length 521 [2019-12-07 18:35:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:19,697 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2524 transitions. [2019-12-07 18:35:19,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:35:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2524 transitions. [2019-12-07 18:35:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-12-07 18:35:19,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:19,701 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 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] [2019-12-07 18:35:19,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:19,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1907590994, now seen corresponding path program 1 times [2019-12-07 18:35:19,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:19,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452554902] [2019-12-07 18:35:19,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 628 proven. 174 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-12-07 18:35:20,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452554902] [2019-12-07 18:35:20,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592751643] [2019-12-07 18:35:20,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:21,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:35:21,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 773 proven. 29 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-12-07 18:35:21,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:21,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-12-07 18:35:21,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385673450] [2019-12-07 18:35:21,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:35:21,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:35:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:35:21,724 INFO L87 Difference]: Start difference. First operand 2318 states and 2524 transitions. Second operand 8 states. [2019-12-07 18:35:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:22,480 INFO L93 Difference]: Finished difference Result 5399 states and 5837 transitions. [2019-12-07 18:35:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:35:22,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 655 [2019-12-07 18:35:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:22,494 INFO L225 Difference]: With dead ends: 5399 [2019-12-07 18:35:22,494 INFO L226 Difference]: Without dead ends: 3083 [2019-12-07 18:35:22,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 652 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:35:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-12-07 18:35:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2496. [2019-12-07 18:35:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-12-07 18:35:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2706 transitions. [2019-12-07 18:35:22,534 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2706 transitions. Word has length 655 [2019-12-07 18:35:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:22,535 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 2706 transitions. [2019-12-07 18:35:22,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:35:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2706 transitions. [2019-12-07 18:35:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-12-07 18:35:22,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:22,541 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 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] [2019-12-07 18:35:22,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:22,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1502033299, now seen corresponding path program 1 times [2019-12-07 18:35:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:22,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300325091] [2019-12-07 18:35:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-12-07 18:35:23,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300325091] [2019-12-07 18:35:23,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:23,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:35:23,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125161708] [2019-12-07 18:35:23,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:35:23,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:35:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:23,712 INFO L87 Difference]: Start difference. First operand 2496 states and 2706 transitions. Second operand 7 states. [2019-12-07 18:35:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:24,687 INFO L93 Difference]: Finished difference Result 5580 states and 6016 transitions. [2019-12-07 18:35:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:35:24,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 666 [2019-12-07 18:35:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:24,697 INFO L225 Difference]: With dead ends: 5580 [2019-12-07 18:35:24,697 INFO L226 Difference]: Without dead ends: 3086 [2019-12-07 18:35:24,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:35:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2019-12-07 18:35:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2674. [2019-12-07 18:35:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 18:35:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2887 transitions. [2019-12-07 18:35:24,724 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2887 transitions. Word has length 666 [2019-12-07 18:35:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:24,725 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2887 transitions. [2019-12-07 18:35:24,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:35:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2887 transitions. [2019-12-07 18:35:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-12-07 18:35:24,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:24,729 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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] [2019-12-07 18:35:24,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:24,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:24,730 INFO L82 PathProgramCache]: Analyzing trace with hash -834510759, now seen corresponding path program 1 times [2019-12-07 18:35:24,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:24,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745179828] [2019-12-07 18:35:24,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1037 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-12-07 18:35:25,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745179828] [2019-12-07 18:35:25,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:25,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:25,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793358345] [2019-12-07 18:35:25,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:25,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:25,006 INFO L87 Difference]: Start difference. First operand 2674 states and 2887 transitions. Second operand 3 states. [2019-12-07 18:35:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:25,337 INFO L93 Difference]: Finished difference Result 6592 states and 7106 transitions. [2019-12-07 18:35:25,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:25,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 682 [2019-12-07 18:35:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:25,349 INFO L225 Difference]: With dead ends: 6592 [2019-12-07 18:35:25,349 INFO L226 Difference]: Without dead ends: 3920 [2019-12-07 18:35:25,351 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-12-07 18:35:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-12-07 18:35:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-12-07 18:35:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-12-07 18:35:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4015 transitions. [2019-12-07 18:35:25,387 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4015 transitions. Word has length 682 [2019-12-07 18:35:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:25,387 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 4015 transitions. [2019-12-07 18:35:25,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4015 transitions. [2019-12-07 18:35:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-12-07 18:35:25,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:25,393 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:35:25,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash -907298080, now seen corresponding path program 1 times [2019-12-07 18:35:25,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:25,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508160713] [2019-12-07 18:35:25,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2149 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-12-07 18:35:25,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508160713] [2019-12-07 18:35:25,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:25,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:25,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206246139] [2019-12-07 18:35:25,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:25,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:25,858 INFO L87 Difference]: Start difference. First operand 3742 states and 4015 transitions. Second operand 4 states. [2019-12-07 18:35:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:26,436 INFO L93 Difference]: Finished difference Result 9262 states and 10025 transitions. [2019-12-07 18:35:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:26,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 837 [2019-12-07 18:35:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:26,453 INFO L225 Difference]: With dead ends: 9262 [2019-12-07 18:35:26,454 INFO L226 Difference]: Without dead ends: 5522 [2019-12-07 18:35:26,457 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-12-07 18:35:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-12-07 18:35:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2019-12-07 18:35:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-07 18:35:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5322 transitions. [2019-12-07 18:35:26,508 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5322 transitions. Word has length 837 [2019-12-07 18:35:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:26,509 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5322 transitions. [2019-12-07 18:35:26,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5322 transitions. [2019-12-07 18:35:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2019-12-07 18:35:26,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:26,518 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 18:35:26,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -596181461, now seen corresponding path program 1 times [2019-12-07 18:35:26,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:26,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947369992] [2019-12-07 18:35:26,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1552 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-12-07 18:35:27,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947369992] [2019-12-07 18:35:27,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:27,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:35:27,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344695140] [2019-12-07 18:35:27,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:35:27,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:27,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:35:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:27,836 INFO L87 Difference]: Start difference. First operand 4988 states and 5322 transitions. Second operand 7 states. [2019-12-07 18:35:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:29,073 INFO L93 Difference]: Finished difference Result 10155 states and 10829 transitions. [2019-12-07 18:35:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:35:29,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 858 [2019-12-07 18:35:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:29,088 INFO L225 Difference]: With dead ends: 10155 [2019-12-07 18:35:29,088 INFO L226 Difference]: Without dead ends: 5347 [2019-12-07 18:35:29,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:35:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2019-12-07 18:35:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 4988. [2019-12-07 18:35:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-07 18:35:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5317 transitions. [2019-12-07 18:35:29,138 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5317 transitions. Word has length 858 [2019-12-07 18:35:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:29,138 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5317 transitions. [2019-12-07 18:35:29,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:35:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5317 transitions. [2019-12-07 18:35:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2019-12-07 18:35:29,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:29,144 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 18:35:29,144 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1984770699, now seen corresponding path program 1 times [2019-12-07 18:35:29,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:29,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710918328] [2019-12-07 18:35:29,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-12-07 18:35:29,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710918328] [2019-12-07 18:35:29,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:29,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:29,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031617910] [2019-12-07 18:35:29,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:29,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:29,721 INFO L87 Difference]: Start difference. First operand 4988 states and 5317 transitions. Second operand 4 states. [2019-12-07 18:35:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:30,240 INFO L93 Difference]: Finished difference Result 11398 states and 12149 transitions. [2019-12-07 18:35:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:30,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 935 [2019-12-07 18:35:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:30,246 INFO L225 Difference]: With dead ends: 11398 [2019-12-07 18:35:30,247 INFO L226 Difference]: Without dead ends: 5166 [2019-12-07 18:35:30,250 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-12-07 18:35:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-12-07 18:35:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-12-07 18:35:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 18:35:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4894 transitions. [2019-12-07 18:35:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4894 transitions. Word has length 935 [2019-12-07 18:35:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:30,300 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4894 transitions. [2019-12-07 18:35:30,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4894 transitions. [2019-12-07 18:35:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2019-12-07 18:35:30,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:30,307 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 18:35:30,307 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash 870770276, now seen corresponding path program 1 times [2019-12-07 18:35:30,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:30,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672322449] [2019-12-07 18:35:30,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-12-07 18:35:30,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672322449] [2019-12-07 18:35:30,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:30,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:30,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952790770] [2019-12-07 18:35:30,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:30,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:30,910 INFO L87 Difference]: Start difference. First operand 4632 states and 4894 transitions. Second operand 4 states. [2019-12-07 18:35:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:31,415 INFO L93 Difference]: Finished difference Result 9262 states and 9793 transitions. [2019-12-07 18:35:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:31,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1007 [2019-12-07 18:35:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:31,423 INFO L225 Difference]: With dead ends: 9262 [2019-12-07 18:35:31,423 INFO L226 Difference]: Without dead ends: 4810 [2019-12-07 18:35:31,426 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-12-07 18:35:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-12-07 18:35:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2019-12-07 18:35:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-07 18:35:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4654 transitions. [2019-12-07 18:35:31,466 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4654 transitions. Word has length 1007 [2019-12-07 18:35:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:31,466 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4654 transitions. [2019-12-07 18:35:31,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4654 transitions. [2019-12-07 18:35:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-12-07 18:35:31,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:31,474 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 18:35:31,474 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -730527857, now seen corresponding path program 1 times [2019-12-07 18:35:31,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:31,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020307379] [2019-12-07 18:35:31,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3487 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2019-12-07 18:35:32,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020307379] [2019-12-07 18:35:32,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:32,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:32,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000923984] [2019-12-07 18:35:32,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:32,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:32,532 INFO L87 Difference]: Start difference. First operand 4454 states and 4654 transitions. Second operand 4 states. [2019-12-07 18:35:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:32,918 INFO L93 Difference]: Finished difference Result 8750 states and 9149 transitions. [2019-12-07 18:35:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:32,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1032 [2019-12-07 18:35:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:32,923 INFO L225 Difference]: With dead ends: 8750 [2019-12-07 18:35:32,923 INFO L226 Difference]: Without dead ends: 4454 [2019-12-07 18:35:32,925 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-12-07 18:35:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-12-07 18:35:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-12-07 18:35:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-07 18:35:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4650 transitions. [2019-12-07 18:35:32,962 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4650 transitions. Word has length 1032 [2019-12-07 18:35:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:32,963 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4650 transitions. [2019-12-07 18:35:32,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4650 transitions. [2019-12-07 18:35:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-12-07 18:35:32,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:32,971 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 18:35:32,971 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1412080206, now seen corresponding path program 1 times [2019-12-07 18:35:32,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:32,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566848236] [2019-12-07 18:35:32,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3539 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2648 trivial. 0 not checked. [2019-12-07 18:35:33,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566848236] [2019-12-07 18:35:33,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:33,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:33,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712596590] [2019-12-07 18:35:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:33,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:33,711 INFO L87 Difference]: Start difference. First operand 4454 states and 4650 transitions. Second operand 4 states. [2019-12-07 18:35:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:34,225 INFO L93 Difference]: Finished difference Result 8906 states and 9298 transitions. [2019-12-07 18:35:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:34,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1046 [2019-12-07 18:35:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:34,230 INFO L225 Difference]: With dead ends: 8906 [2019-12-07 18:35:34,230 INFO L226 Difference]: Without dead ends: 4632 [2019-12-07 18:35:34,233 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-12-07 18:35:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-12-07 18:35:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2019-12-07 18:35:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-12-07 18:35:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4443 transitions. [2019-12-07 18:35:34,269 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4443 transitions. Word has length 1046 [2019-12-07 18:35:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:34,269 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4443 transitions. [2019-12-07 18:35:34,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4443 transitions. [2019-12-07 18:35:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2019-12-07 18:35:34,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:34,277 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:34,277 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -166325796, now seen corresponding path program 1 times [2019-12-07 18:35:34,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:34,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056704041] [2019-12-07 18:35:34,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1603 proven. 6 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-12-07 18:35:35,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056704041] [2019-12-07 18:35:35,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613270436] [2019-12-07 18:35:35,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:35,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:35,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-12-07 18:35:36,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:36,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 18:35:36,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732192294] [2019-12-07 18:35:36,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:36,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:36,211 INFO L87 Difference]: Start difference. First operand 4276 states and 4443 transitions. Second operand 4 states. [2019-12-07 18:35:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:36,724 INFO L93 Difference]: Finished difference Result 8728 states and 9105 transitions. [2019-12-07 18:35:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:36,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1055 [2019-12-07 18:35:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:36,727 INFO L225 Difference]: With dead ends: 8728 [2019-12-07 18:35:36,727 INFO L226 Difference]: Without dead ends: 4632 [2019-12-07 18:35:36,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1055 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:35:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-12-07 18:35:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-12-07 18:35:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-07 18:35:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4625 transitions. [2019-12-07 18:35:36,764 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4625 transitions. Word has length 1055 [2019-12-07 18:35:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:36,764 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4625 transitions. [2019-12-07 18:35:36,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4625 transitions. [2019-12-07 18:35:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-12-07 18:35:36,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:36,773 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:36,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:36,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash 199964749, now seen corresponding path program 1 times [2019-12-07 18:35:36,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:36,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071893709] [2019-12-07 18:35:36,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 3390 trivial. 0 not checked. [2019-12-07 18:35:37,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071893709] [2019-12-07 18:35:37,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:37,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:37,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298269916] [2019-12-07 18:35:37,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:37,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:37,748 INFO L87 Difference]: Start difference. First operand 4454 states and 4625 transitions. Second operand 4 states. [2019-12-07 18:35:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:38,265 INFO L93 Difference]: Finished difference Result 9972 states and 10351 transitions. [2019-12-07 18:35:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:38,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1108 [2019-12-07 18:35:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:38,266 INFO L225 Difference]: With dead ends: 9972 [2019-12-07 18:35:38,266 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:35:38,271 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-12-07 18:35:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:35:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:35:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:35:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:35:38,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-12-07 18:35:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:38,271 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:35:38,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:35:38,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:35:38,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:35:38,503 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 195 [2019-12-07 18:35:38,682 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 198 [2019-12-07 18:35:39,212 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 51 [2019-12-07 18:35:39,771 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 51 [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:35:39,774 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:35:39,775 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:35:39,776 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 18:35:39,777 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 18:35:39,778 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 18:35:39,779 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 18:35:39,780 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 18:35:39,781 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 18:35:39,782 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,783 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse2 (= ~a21~0 10))) (let ((.cse3 (<= 0 (+ ~a12~0 41))) (.cse1 (<= 8 ~a15~0)) (.cse4 (not .cse2)) (.cse6 (<= ~a15~0 8)) (.cse0 (= ~a24~0 1)) (.cse7 (not (= ~a15~0 6)))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse0 .cse2) (and .cse0 (<= ~a12~0 11) .cse3) (and .cse0 .cse3 .cse4) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse5 .cse4))) .cse6 .cse7) (and .cse0 .cse6 (= ~a21~0 9)) (and .cse0 (= ~a21~0 8) .cse7) (and .cse0 .cse2 (< 0 (+ ~a12~0 43)) .cse7)))) [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,784 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,785 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse2 (= ~a21~0 10))) (let ((.cse3 (<= 0 (+ ~a12~0 41))) (.cse1 (<= 8 ~a15~0)) (.cse4 (not .cse2)) (.cse6 (<= ~a15~0 8)) (.cse0 (= ~a24~0 1)) (.cse7 (not (= ~a15~0 6)))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse0 .cse2) (and .cse0 (<= ~a12~0 11) .cse3) (and .cse0 .cse3 .cse4) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse5 .cse4))) .cse6 .cse7) (and .cse0 .cse6 (= ~a21~0 9)) (and .cse0 (= ~a21~0 8) .cse7) (and .cse0 .cse2 (< 0 (+ ~a12~0 43)) .cse7)))) [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:35:39,786 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,787 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:35:39,788 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 18:35:39,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:35:39 BoogieIcfgContainer [2019-12-07 18:35:39,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:35:39,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:35:39,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:35:39,806 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:35:39,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:10" (3/4) ... [2019-12-07 18:35:39,810 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:35:39,831 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:35:39,833 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:35:39,932 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_64ebce26-fec1-4dc7-8afd-9e09a23bd6c8/bin/uautomizer/witness.graphml [2019-12-07 18:35:39,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:35:39,933 INFO L168 Benchmark]: Toolchain (without parser) took 30693.18 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 942.5 MB in the beginning and 1.7 GB in the end (delta: -728.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,933 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:35:39,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,934 INFO L168 Benchmark]: Boogie Preprocessor took 49.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,934 INFO L168 Benchmark]: RCFGBuilder took 789.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 914.3 MB in the end (delta: 131.3 MB). Peak memory consumption was 131.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,934 INFO L168 Benchmark]: TraceAbstraction took 29226.72 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 914.3 MB in the beginning and 1.7 GB in the end (delta: -810.0 MB). Peak memory consumption was 944.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,935 INFO L168 Benchmark]: Witness Printer took 126.22 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:39,936 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 789.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 914.3 MB in the end (delta: 131.3 MB). Peak memory consumption was 131.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29226.72 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 914.3 MB in the beginning and 1.7 GB in the end (delta: -810.0 MB). Peak memory consumption was 944.3 MB. Max. memory is 11.5 GB. * Witness Printer took 126.22 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((a15 == 7 && a24 == 1) || ((8 <= a15 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41)) || ((a24 == 1 && 0 <= a12 + 41) && !(a21 == 10))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((8 <= a15 && a12 + 49 <= 0) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8) && !(a15 == 6))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a21 == 8) && !(a15 == 6))) || (((a24 == 1 && a21 == 10) && 0 < a12 + 43) && !(a15 == 6)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((a15 == 7 && a24 == 1) || ((8 <= a15 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41)) || ((a24 == 1 && 0 <= a12 + 41) && !(a21 == 10))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((8 <= a15 && a12 + 49 <= 0) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8) && !(a15 == 6))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a21 == 8) && !(a15 == 6))) || (((a24 == 1 && a21 == 10) && 0 < a12 + 43) && !(a15 == 6)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 27.6s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 722 SDtfs, 4832 SDslu, 234 SDs, 0 SdLazy, 16343 SolverSat, 1773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2939 GetRequests, 2852 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 6570 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 237 HoareAnnotationTreeSize, 3 FomulaSimplifications, 86693 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 34425 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 14186 NumberOfCodeBlocks, 14186 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14162 ConstructedInterpolants, 0 QuantifiedInterpolants, 34634166 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3603 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 35339/35651 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...