./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/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 28b1d24b851fc193321d917a51d82cffe4d9ea6e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:28:56,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:28:56,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:28:56,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:28:56,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:28:56,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:28:56,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:28:56,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:28:56,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:28:56,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:28:56,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:28:56,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:28:56,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:28:56,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:28:56,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:28:56,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:28:56,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:28:56,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:28:56,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:28:56,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:28:56,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:28:56,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:28:56,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:28:56,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:28:56,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:28:56,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:28:56,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:28:56,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:28:56,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:28:56,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:28:56,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:28:56,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:28:56,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:28:56,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:28:56,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:28:56,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:28:56,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:28:56,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:28:56,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:28:56,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:28:56,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:28:56,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:28:56,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:28:56,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:28:56,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:28:56,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:28:56,469 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:28:56,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:28:56,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:28:56,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:28:56,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:28:56,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:28:56,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:28:56,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:28:56,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:28:56,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:28:56,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:28:56,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:28:56,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:28:56,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:28:56,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:28:56,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:28:56,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:28:56,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:28:56,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:28:56,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:28:56,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:28:56,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:28:56,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:28:56,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:28:56,473 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_213b725d-5e50-485f-be4a-bb3c965e9811/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 -> 28b1d24b851fc193321d917a51d82cffe4d9ea6e [2019-11-20 00:28:56,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:28:56,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:28:56,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:28:56,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:28:56,635 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:28:56,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-20 00:28:56,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/data/b95ad983e/22ced1da659b4c5a909f4a865d3887be/FLAG1b3d58de8 [2019-11-20 00:28:57,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:28:57,311 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-20 00:28:57,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/data/b95ad983e/22ced1da659b4c5a909f4a865d3887be/FLAG1b3d58de8 [2019-11-20 00:28:57,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/data/b95ad983e/22ced1da659b4c5a909f4a865d3887be [2019-11-20 00:28:57,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:28:57,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:28:57,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:28:57,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:28:57,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:28:57,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:28:57" (1/1) ... [2019-11-20 00:28:57,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6709ef4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:57, skipping insertion in model container [2019-11-20 00:28:57,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:28:57" (1/1) ... [2019-11-20 00:28:57,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:28:57,606 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:28:58,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:28:58,290 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:28:58,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:28:58,594 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:28:58,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58 WrapperNode [2019-11-20 00:28:58,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:28:58,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:28:58,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:28:58,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:28:58,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:28:58,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:28:58,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:28:58,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:28:58,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... [2019-11-20 00:28:58,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:28:58,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:28:58,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:28:58,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:28:58,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:28:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:28:58,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:29:01,054 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:29:01,055 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:29:01,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:29:01 BoogieIcfgContainer [2019-11-20 00:29:01,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:29:01,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:29:01,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:29:01,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:29:01,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:28:57" (1/3) ... [2019-11-20 00:29:01,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2500c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:29:01, skipping insertion in model container [2019-11-20 00:29:01,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:28:58" (2/3) ... [2019-11-20 00:29:01,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2500c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:29:01, skipping insertion in model container [2019-11-20 00:29:01,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:29:01" (3/3) ... [2019-11-20 00:29:01,067 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label32.c [2019-11-20 00:29:01,076 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:29:01,085 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:29:01,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:29:01,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:29:01,136 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:29:01,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:29:01,136 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:29:01,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:29:01,136 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:29:01,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:29:01,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:29:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 00:29:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 00:29:01,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:01,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:01,182 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash -570388181, now seen corresponding path program 1 times [2019-11-20 00:29:01,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:01,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862922297] [2019-11-20 00:29:01,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:01,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862922297] [2019-11-20 00:29:01,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:01,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:01,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680547403] [2019-11-20 00:29:01,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:29:01,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:29:01,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:01,909 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 00:29:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:04,288 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-20 00:29:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:29:04,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-20 00:29:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:04,309 INFO L225 Difference]: With dead ends: 1075 [2019-11-20 00:29:04,309 INFO L226 Difference]: Without dead ends: 677 [2019-11-20 00:29:04,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-20 00:29:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-20 00:29:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-20 00:29:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-20 00:29:04,392 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 189 [2019-11-20 00:29:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:04,393 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-20 00:29:04,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:29:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-20 00:29:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 00:29:04,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:04,400 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:04,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash -811782164, now seen corresponding path program 1 times [2019-11-20 00:29:04,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:04,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095358950] [2019-11-20 00:29:04,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:04,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095358950] [2019-11-20 00:29:04,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:04,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:29:04,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907781482] [2019-11-20 00:29:04,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:04,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:04,552 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-20 00:29:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:05,599 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-20 00:29:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:05,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 00:29:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:05,605 INFO L225 Difference]: With dead ends: 1323 [2019-11-20 00:29:05,605 INFO L226 Difference]: Without dead ends: 874 [2019-11-20 00:29:05,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-20 00:29:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-20 00:29:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-20 00:29:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-20 00:29:05,649 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 197 [2019-11-20 00:29:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:05,649 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-20 00:29:05,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-20 00:29:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 00:29:05,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:05,658 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:05,659 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash -104919451, now seen corresponding path program 1 times [2019-11-20 00:29:05,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:05,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734413918] [2019-11-20 00:29:05,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:05,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734413918] [2019-11-20 00:29:05,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:05,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:05,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541011084] [2019-11-20 00:29:05,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:29:05,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:29:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:05,742 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-20 00:29:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:07,489 INFO L93 Difference]: Finished difference Result 3364 states and 5170 transitions. [2019-11-20 00:29:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:29:07,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 00:29:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:07,505 INFO L225 Difference]: With dead ends: 3364 [2019-11-20 00:29:07,506 INFO L226 Difference]: Without dead ends: 2507 [2019-11-20 00:29:07,508 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-11-20 00:29:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-11-20 00:29:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1682. [2019-11-20 00:29:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-20 00:29:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-11-20 00:29:07,559 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 198 [2019-11-20 00:29:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:07,560 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-11-20 00:29:07,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:29:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-11-20 00:29:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 00:29:07,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:07,575 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:07,576 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash 48899105, now seen corresponding path program 1 times [2019-11-20 00:29:07,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:07,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690550319] [2019-11-20 00:29:07,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:29:07,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690550319] [2019-11-20 00:29:07,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:07,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:29:07,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868697348] [2019-11-20 00:29:07,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:29:07,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:29:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:07,892 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 4 states. [2019-11-20 00:29:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:09,778 INFO L93 Difference]: Finished difference Result 6614 states and 9588 transitions. [2019-11-20 00:29:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:29:09,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 00:29:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:09,807 INFO L225 Difference]: With dead ends: 6614 [2019-11-20 00:29:09,807 INFO L226 Difference]: Without dead ends: 4934 [2019-11-20 00:29:09,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-20 00:29:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-20 00:29:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-20 00:29:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6537 transitions. [2019-11-20 00:29:09,918 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6537 transitions. Word has length 204 [2019-11-20 00:29:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:09,918 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 6537 transitions. [2019-11-20 00:29:09,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:29:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6537 transitions. [2019-11-20 00:29:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 00:29:09,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:09,931 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:09,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1217776380, now seen corresponding path program 1 times [2019-11-20 00:29:09,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:09,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783217317] [2019-11-20 00:29:09,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:10,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783217317] [2019-11-20 00:29:10,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:10,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:29:10,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014075616] [2019-11-20 00:29:10,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:10,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:10,090 INFO L87 Difference]: Start difference. First operand 4932 states and 6537 transitions. Second operand 3 states. [2019-11-20 00:29:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:11,179 INFO L93 Difference]: Finished difference Result 11905 states and 15682 transitions. [2019-11-20 00:29:11,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:11,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-20 00:29:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:11,216 INFO L225 Difference]: With dead ends: 11905 [2019-11-20 00:29:11,216 INFO L226 Difference]: Without dead ends: 6975 [2019-11-20 00:29:11,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2019-11-20 00:29:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6974. [2019-11-20 00:29:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-20 00:29:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8983 transitions. [2019-11-20 00:29:11,357 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8983 transitions. Word has length 230 [2019-11-20 00:29:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:11,358 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8983 transitions. [2019-11-20 00:29:11,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8983 transitions. [2019-11-20 00:29:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-20 00:29:11,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:11,377 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:11,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1656032921, now seen corresponding path program 1 times [2019-11-20 00:29:11,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:11,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255152587] [2019-11-20 00:29:11,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:11,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255152587] [2019-11-20 00:29:11,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471232919] [2019-11-20 00:29:11,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:11,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:29:11,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:29:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:29:11,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:29:11,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 00:29:11,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444221240] [2019-11-20 00:29:11,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:11,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:11,986 INFO L87 Difference]: Start difference. First operand 6974 states and 8983 transitions. Second operand 3 states. [2019-11-20 00:29:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:13,152 INFO L93 Difference]: Finished difference Result 13963 states and 17998 transitions. [2019-11-20 00:29:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:13,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-11-20 00:29:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:13,188 INFO L225 Difference]: With dead ends: 13963 [2019-11-20 00:29:13,188 INFO L226 Difference]: Without dead ends: 6991 [2019-11-20 00:29:13,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2019-11-20 00:29:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6974. [2019-11-20 00:29:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-20 00:29:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8848 transitions. [2019-11-20 00:29:13,326 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8848 transitions. Word has length 237 [2019-11-20 00:29:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:13,336 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8848 transitions. [2019-11-20 00:29:13,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8848 transitions. [2019-11-20 00:29:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:29:13,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:13,355 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:13,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:13,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1468503162, now seen corresponding path program 1 times [2019-11-20 00:29:13,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:13,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871064461] [2019-11-20 00:29:13,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:13,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871064461] [2019-11-20 00:29:13,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:13,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:13,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149040485] [2019-11-20 00:29:13,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:29:13,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:29:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:13,798 INFO L87 Difference]: Start difference. First operand 6974 states and 8848 transitions. Second operand 4 states. [2019-11-20 00:29:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:15,769 INFO L93 Difference]: Finished difference Result 17239 states and 21713 transitions. [2019-11-20 00:29:15,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:29:15,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-20 00:29:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:15,816 INFO L225 Difference]: With dead ends: 17239 [2019-11-20 00:29:15,816 INFO L226 Difference]: Without dead ends: 10267 [2019-11-20 00:29:15,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2019-11-20 00:29:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 8206. [2019-11-20 00:29:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-11-20 00:29:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 10221 transitions. [2019-11-20 00:29:15,961 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 10221 transitions. Word has length 252 [2019-11-20 00:29:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:15,962 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 10221 transitions. [2019-11-20 00:29:15,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:29:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 10221 transitions. [2019-11-20 00:29:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-20 00:29:15,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:15,983 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:15,984 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1641424082, now seen corresponding path program 1 times [2019-11-20 00:29:15,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:15,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874329017] [2019-11-20 00:29:15,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-20 00:29:16,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874329017] [2019-11-20 00:29:16,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:16,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:16,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940929163] [2019-11-20 00:29:16,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:29:16,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:29:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:29:16,110 INFO L87 Difference]: Start difference. First operand 8206 states and 10221 transitions. Second operand 4 states. [2019-11-20 00:29:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:18,037 INFO L93 Difference]: Finished difference Result 29430 states and 36498 transitions. [2019-11-20 00:29:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:29:18,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-20 00:29:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:18,072 INFO L225 Difference]: With dead ends: 29430 [2019-11-20 00:29:18,072 INFO L226 Difference]: Without dead ends: 21226 [2019-11-20 00:29:18,082 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-11-20 00:29:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2019-11-20 00:29:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 14503. [2019-11-20 00:29:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14503 states. [2019-11-20 00:29:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14503 states to 14503 states and 17335 transitions. [2019-11-20 00:29:18,338 INFO L78 Accepts]: Start accepts. Automaton has 14503 states and 17335 transitions. Word has length 254 [2019-11-20 00:29:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:18,339 INFO L462 AbstractCegarLoop]: Abstraction has 14503 states and 17335 transitions. [2019-11-20 00:29:18,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:29:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14503 states and 17335 transitions. [2019-11-20 00:29:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-20 00:29:18,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:18,380 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:18,381 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash -590016379, now seen corresponding path program 1 times [2019-11-20 00:29:18,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:18,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354934295] [2019-11-20 00:29:18,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 00:29:18,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354934295] [2019-11-20 00:29:18,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509424621] [2019-11-20 00:29:18,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:18,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:29:18,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:29:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:29:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:29:18,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 00:29:18,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812668557] [2019-11-20 00:29:18,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:18,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:18,986 INFO L87 Difference]: Start difference. First operand 14503 states and 17335 transitions. Second operand 3 states. [2019-11-20 00:29:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:19,588 INFO L93 Difference]: Finished difference Result 28767 states and 34387 transitions. [2019-11-20 00:29:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:19,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-20 00:29:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:19,615 INFO L225 Difference]: With dead ends: 28767 [2019-11-20 00:29:19,616 INFO L226 Difference]: Without dead ends: 14266 [2019-11-20 00:29:19,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14266 states. [2019-11-20 00:29:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14266 to 13251. [2019-11-20 00:29:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-20 00:29:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15809 transitions. [2019-11-20 00:29:19,942 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15809 transitions. Word has length 330 [2019-11-20 00:29:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:19,942 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15809 transitions. [2019-11-20 00:29:19,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15809 transitions. [2019-11-20 00:29:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-20 00:29:19,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:19,977 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-20 00:29:20,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:20,186 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 106936724, now seen corresponding path program 1 times [2019-11-20 00:29:20,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:20,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011186242] [2019-11-20 00:29:20,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:29:20,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011186242] [2019-11-20 00:29:20,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661241715] [2019-11-20 00:29:20,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:20,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:29:20,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:29:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:29:20,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:29:20,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 00:29:20,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546649676] [2019-11-20 00:29:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:20,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:20,681 INFO L87 Difference]: Start difference. First operand 13251 states and 15809 transitions. Second operand 3 states. [2019-11-20 00:29:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:21,654 INFO L93 Difference]: Finished difference Result 26503 states and 31621 transitions. [2019-11-20 00:29:21,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:21,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-11-20 00:29:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:21,682 INFO L225 Difference]: With dead ends: 26503 [2019-11-20 00:29:21,683 INFO L226 Difference]: Without dead ends: 13254 [2019-11-20 00:29:21,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:29:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13254 states. [2019-11-20 00:29:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13254 to 13251. [2019-11-20 00:29:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-20 00:29:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15155 transitions. [2019-11-20 00:29:22,140 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15155 transitions. Word has length 346 [2019-11-20 00:29:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:22,141 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15155 transitions. [2019-11-20 00:29:22,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15155 transitions. [2019-11-20 00:29:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-11-20 00:29:22,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:22,177 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, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-20 00:29:22,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:22,391 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:22,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1570706907, now seen corresponding path program 1 times [2019-11-20 00:29:22,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:22,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883844713] [2019-11-20 00:29:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:29:22,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883844713] [2019-11-20 00:29:22,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:22,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:22,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501718010] [2019-11-20 00:29:22,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:22,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:22,719 INFO L87 Difference]: Start difference. First operand 13251 states and 15155 transitions. Second operand 3 states. [2019-11-20 00:29:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:23,924 INFO L93 Difference]: Finished difference Result 26501 states and 30310 transitions. [2019-11-20 00:29:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:23,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-11-20 00:29:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:23,944 INFO L225 Difference]: With dead ends: 26501 [2019-11-20 00:29:23,945 INFO L226 Difference]: Without dead ends: 13252 [2019-11-20 00:29:23,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2019-11-20 00:29:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 13251. [2019-11-20 00:29:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-20 00:29:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 14735 transitions. [2019-11-20 00:29:24,143 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 14735 transitions. Word has length 394 [2019-11-20 00:29:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:24,144 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 14735 transitions. [2019-11-20 00:29:24,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 14735 transitions. [2019-11-20 00:29:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 00:29:24,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:24,160 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-20 00:29:24,161 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1164857076, now seen corresponding path program 1 times [2019-11-20 00:29:24,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:24,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797449949] [2019-11-20 00:29:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:29:24,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797449949] [2019-11-20 00:29:24,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:24,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:24,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737755442] [2019-11-20 00:29:24,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:24,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:24,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:24,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:24,486 INFO L87 Difference]: Start difference. First operand 13251 states and 14735 transitions. Second operand 3 states. [2019-11-20 00:29:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:26,011 INFO L93 Difference]: Finished difference Result 26300 states and 29259 transitions. [2019-11-20 00:29:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:26,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-20 00:29:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:26,027 INFO L225 Difference]: With dead ends: 26300 [2019-11-20 00:29:26,028 INFO L226 Difference]: Without dead ends: 13051 [2019-11-20 00:29:26,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2019-11-20 00:29:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12439. [2019-11-20 00:29:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12439 states. [2019-11-20 00:29:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 13550 transitions. [2019-11-20 00:29:26,200 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 13550 transitions. Word has length 421 [2019-11-20 00:29:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:26,200 INFO L462 AbstractCegarLoop]: Abstraction has 12439 states and 13550 transitions. [2019-11-20 00:29:26,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 13550 transitions. [2019-11-20 00:29:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-20 00:29:26,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:26,217 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:26,217 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1167417895, now seen corresponding path program 1 times [2019-11-20 00:29:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:26,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901565111] [2019-11-20 00:29:26,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-20 00:29:26,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901565111] [2019-11-20 00:29:26,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:26,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:26,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547793540] [2019-11-20 00:29:26,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:26,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:26,521 INFO L87 Difference]: Start difference. First operand 12439 states and 13550 transitions. Second operand 3 states. [2019-11-20 00:29:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:27,666 INFO L93 Difference]: Finished difference Result 29966 states and 32694 transitions. [2019-11-20 00:29:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:27,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-20 00:29:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:27,684 INFO L225 Difference]: With dead ends: 29966 [2019-11-20 00:29:27,684 INFO L226 Difference]: Without dead ends: 17529 [2019-11-20 00:29:27,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2019-11-20 00:29:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13657. [2019-11-20 00:29:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-11-20 00:29:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 14892 transitions. [2019-11-20 00:29:27,896 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 14892 transitions. Word has length 443 [2019-11-20 00:29:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:27,897 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 14892 transitions. [2019-11-20 00:29:27,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 14892 transitions. [2019-11-20 00:29:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-20 00:29:27,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:27,914 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:27,915 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1549945789, now seen corresponding path program 1 times [2019-11-20 00:29:27,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:27,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112335187] [2019-11-20 00:29:27,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 263 proven. 14 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-20 00:29:28,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112335187] [2019-11-20 00:29:28,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615230837] [2019-11-20 00:29:28,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:28,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:29:28,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:29:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 00:29:28,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:29:28,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 00:29:28,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327786501] [2019-11-20 00:29:28,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:28,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:29:28,792 INFO L87 Difference]: Start difference. First operand 13657 states and 14892 transitions. Second operand 3 states. [2019-11-20 00:29:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:29,265 INFO L93 Difference]: Finished difference Result 38502 states and 41959 transitions. [2019-11-20 00:29:29,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:29,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-11-20 00:29:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:29,286 INFO L225 Difference]: With dead ends: 38502 [2019-11-20 00:29:29,286 INFO L226 Difference]: Without dead ends: 24847 [2019-11-20 00:29:29,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:29:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24847 states. [2019-11-20 00:29:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24847 to 24847. [2019-11-20 00:29:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24847 states. [2019-11-20 00:29:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24847 states to 24847 states and 26857 transitions. [2019-11-20 00:29:29,575 INFO L78 Accepts]: Start accepts. Automaton has 24847 states and 26857 transitions. Word has length 453 [2019-11-20 00:29:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:29,576 INFO L462 AbstractCegarLoop]: Abstraction has 24847 states and 26857 transitions. [2019-11-20 00:29:29,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24847 states and 26857 transitions. [2019-11-20 00:29:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-11-20 00:29:29,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:29:29,601 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:29:29,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:29:29,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:29:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:29:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -852721927, now seen corresponding path program 1 times [2019-11-20 00:29:29,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:29:29,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395407827] [2019-11-20 00:29:29,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:29:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 00:29:30,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395407827] [2019-11-20 00:29:30,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:29:30,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:29:30,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638858521] [2019-11-20 00:29:30,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:29:30,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:29:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:29:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:30,280 INFO L87 Difference]: Start difference. First operand 24847 states and 26857 transitions. Second operand 3 states. [2019-11-20 00:29:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:29:31,436 INFO L93 Difference]: Finished difference Result 54783 states and 59135 transitions. [2019-11-20 00:29:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:29:31,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 455 [2019-11-20 00:29:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:29:31,438 INFO L225 Difference]: With dead ends: 54783 [2019-11-20 00:29:31,438 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:29:31,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:29:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:29:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:29:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:29:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:29:31,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 455 [2019-11-20 00:29:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:29:31,450 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:29:31,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:29:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:29:31,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:29:31,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:29:32,391 WARN L191 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 325 [2019-11-20 00:29:33,242 WARN L191 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 325 [2019-11-20 00:29:35,570 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 323 DAG size of output: 54 [2019-11-20 00:29:37,882 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 323 DAG size of output: 54 [2019-11-20 00:29:37,884 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,885 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 00:29:37,886 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,887 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,888 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 00:29:37,889 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 00:29:37,890 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 00:29:37,891 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 00:29:37,892 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,893 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0))) (let ((.cse4 (not (= ~a12~0 1))) (.cse13 (not .cse3)) (.cse0 (not (= 1 ~a11~0))) (.cse7 (= ~a27~0 1)) (.cse8 (= ~a5~0 1))) (let ((.cse6 (= 0 ~a3~0)) (.cse12 (and .cse0 .cse7 .cse8)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a11~0 1)) (.cse10 (not (= 1 ~a3~0))) (.cse11 (<= ~a3~0 1)) (.cse14 (and .cse4 .cse13)) (.cse1 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse1) (and .cse2 .cse6 .cse5 .cse1) (and .cse7 .cse8 .cse9 .cse5) (and (and .cse0 .cse7 .cse10) .cse2) (and .cse11 (not .cse5) .cse2 .cse3 .cse1) (and .cse2 (and .cse0 .cse6 .cse1)) (and (<= ~a10~0 0) .cse12 .cse5) (and .cse0 (and .cse7 .cse4 .cse8)) (and .cse7 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse5 .cse1 .cse13) (and .cse3 .cse12 .cse5) (and (and .cse1 .cse13 .cse10) .cse2 .cse5) (and .cse2 .cse9 .cse14 .cse1 .cse10) (and .cse11 .cse2 (and .cse0 .cse14 .cse1)) (and .cse2 (and .cse4 .cse7 .cse13)))))) [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 00:29:37,894 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1602) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,895 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,896 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0))) (let ((.cse4 (not (= ~a12~0 1))) (.cse13 (not .cse3)) (.cse0 (not (= 1 ~a11~0))) (.cse7 (= ~a27~0 1)) (.cse8 (= ~a5~0 1))) (let ((.cse6 (= 0 ~a3~0)) (.cse12 (and .cse0 .cse7 .cse8)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a11~0 1)) (.cse10 (not (= 1 ~a3~0))) (.cse11 (<= ~a3~0 1)) (.cse14 (and .cse4 .cse13)) (.cse1 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse1) (and .cse2 .cse6 .cse5 .cse1) (and .cse7 .cse8 .cse9 .cse5) (and (and .cse0 .cse7 .cse10) .cse2) (and .cse11 (not .cse5) .cse2 .cse3 .cse1) (and .cse2 (and .cse0 .cse6 .cse1)) (and (<= ~a10~0 0) .cse12 .cse5) (and .cse0 (and .cse7 .cse4 .cse8)) (and .cse7 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse5 .cse1 .cse13) (and .cse3 .cse12 .cse5) (and (and .cse1 .cse13 .cse10) .cse2 .cse5) (and .cse2 .cse9 .cse14 .cse1 .cse10) (and .cse11 .cse2 (and .cse0 .cse14 .cse1)) (and .cse2 (and .cse4 .cse7 .cse13)))))) [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,897 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,898 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,898 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,898 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,901 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,902 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,903 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,904 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 00:29:37,905 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,906 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,907 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,908 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 00:29:37,909 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,910 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,911 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,912 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:29:37,913 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,914 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 00:29:37,915 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,916 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 00:29:37,917 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 00:29:37,917 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,917 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 00:29:37,917 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 00:29:37,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:29:37 BoogieIcfgContainer [2019-11-20 00:29:37,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:29:37,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:29:37,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:29:37,940 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:29:37,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:29:01" (3/4) ... [2019-11-20 00:29:37,945 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:29:37,978 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 00:29:37,982 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:29:38,200 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_213b725d-5e50-485f-be4a-bb3c965e9811/bin/uautomizer/witness.graphml [2019-11-20 00:29:38,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:29:38,202 INFO L168 Benchmark]: Toolchain (without parser) took 40674.32 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 939.3 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 571.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,202 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:29:38,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1068.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,203 INFO L168 Benchmark]: Boogie Preprocessor took 109.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,203 INFO L168 Benchmark]: RCFGBuilder took 2212.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.8 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,204 INFO L168 Benchmark]: TraceAbstraction took 36882.91 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,204 INFO L168 Benchmark]: Witness Printer took 260.41 ms. Allocated memory is still 2.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:29:38,206 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1068.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2212.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.8 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36882.91 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 260.41 ms. Allocated memory is still 2.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1602]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == a11) && a27 <= 0) && 1 == a5) && 1 == a6) || (((!(a12 == 1) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((!(1 == a11) && a27 == 1) && !(1 == a3)) && 1 == a5)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (1 == a5 && (!(1 == a11) && 0 == a3) && a27 <= 0)) || ((a10 <= 0 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || (!(1 == a11) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && 1 == a6) && a5 == 1) && !(1 == a3))) || ((((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0) && !(1 == a6))) || ((1 == a6 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a27 <= 0 && !(1 == a6)) && !(1 == a3)) && 1 == a5) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || ((a3 <= 1 && 1 == a5) && (!(1 == a11) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (1 == a5 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == a11) && a27 <= 0) && 1 == a5) && 1 == a6) || (((!(a12 == 1) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((!(1 == a11) && a27 == 1) && !(1 == a3)) && 1 == a5)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (1 == a5 && (!(1 == a11) && 0 == a3) && a27 <= 0)) || ((a10 <= 0 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || (!(1 == a11) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && 1 == a6) && a5 == 1) && !(1 == a3))) || ((((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0) && !(1 == a6))) || ((1 == a6 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a27 <= 0 && !(1 == a6)) && !(1 == a3)) && 1 == a5) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || ((a3 <= 1 && 1 == a5) && (!(1 == a11) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (1 == a5 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 36.7s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, HoareTripleCheckerStatistics: 3282 SDtfs, 3603 SDslu, 690 SDs, 0 SdLazy, 11041 SolverSat, 2003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1416 GetRequests, 1378 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24847occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 15373 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 300 NumberOfFragments, 539 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7358 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 31384 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 5969 NumberOfCodeBlocks, 5969 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5950 ConstructedInterpolants, 0 QuantifiedInterpolants, 3769545 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 3763/3786 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...