./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label46.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_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label46.c -s /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 040c0aaac4458e8ce6521748c6e651f82b542145 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:31:05,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:31:05,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:31:05,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:31:05,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:31:05,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:31:05,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:31:05,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:31:05,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:31:05,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:31:05,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:31:05,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:31:05,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:31:05,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:31:05,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:31:05,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:31:05,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:31:05,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:31:05,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:31:05,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:31:05,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:31:05,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:31:05,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:31:05,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:31:05,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:31:05,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:31:05,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:31:05,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:31:05,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:31:05,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:31:05,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:31:05,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:31:05,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:31:05,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:31:05,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:31:05,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:31:05,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:31:05,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:31:05,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:31:05,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:31:05,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:31:05,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:31:05,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:31:05,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:31:05,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:31:05,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:31:05,457 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:31:05,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:31:05,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:31:05,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:31:05,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:31:05,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:31:05,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:31:05,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:31:05,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:31:05,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:31:05,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:31:05,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:31:05,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:31:05,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:31:05,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:31:05,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:31:05,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:31:05,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:31:05,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:31:05,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:31:05,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:31:05,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:31:05,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:31:05,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:31:05,462 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_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 -> 040c0aaac4458e8ce6521748c6e651f82b542145 [2019-11-20 11:31:05,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:31:05,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:31:05,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:31:05,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:31:05,648 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:31:05,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label46.c [2019-11-20 11:31:05,711 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/data/7b9e83250/3361880885124269853b129e16d7fbed/FLAG3d939a605 [2019-11-20 11:31:06,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:31:06,397 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/sv-benchmarks/c/eca-rers2012/Problem03_label46.c [2019-11-20 11:31:06,421 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/data/7b9e83250/3361880885124269853b129e16d7fbed/FLAG3d939a605 [2019-11-20 11:31:06,722 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/data/7b9e83250/3361880885124269853b129e16d7fbed [2019-11-20 11:31:06,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:31:06,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:31:06,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:06,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:31:06,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:31:06,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:06" (1/1) ... [2019-11-20 11:31:06,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d21809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:06, skipping insertion in model container [2019-11-20 11:31:06,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:06" (1/1) ... [2019-11-20 11:31:06,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:31:06,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:31:07,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:07,676 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:31:08,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:08,025 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:31:08,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08 WrapperNode [2019-11-20 11:31:08,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:08,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:31:08,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:31:08,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:31:08,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:31:08,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:31:08,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:31:08,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:31:08,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... [2019-11-20 11:31:08,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:31:08,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:31:08,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:31:08,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:31:08,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 11:31:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:31:08,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:31:10,681 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:31:10,681 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:31:10,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:10 BoogieIcfgContainer [2019-11-20 11:31:10,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:31:10,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:31:10,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:31:10,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:31:10,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:31:06" (1/3) ... [2019-11-20 11:31:10,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da16235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:10, skipping insertion in model container [2019-11-20 11:31:10,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:08" (2/3) ... [2019-11-20 11:31:10,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da16235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:10, skipping insertion in model container [2019-11-20 11:31:10,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:10" (3/3) ... [2019-11-20 11:31:10,692 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label46.c [2019-11-20 11:31:10,705 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:31:10,715 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:31:10,727 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:31:10,773 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:31:10,773 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:31:10,773 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:31:10,774 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:31:10,774 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:31:10,774 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:31:10,774 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:31:10,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:31:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 11:31:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 11:31:10,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:10,837 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] [2019-11-20 11:31:10,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1730728613, now seen corresponding path program 1 times [2019-11-20 11:31:10,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:10,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062356265] [2019-11-20 11:31:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:11,758 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 11:31:11,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062356265] [2019-11-20 11:31:11,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:11,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:11,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491572253] [2019-11-20 11:31:11,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:11,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:11,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:11,786 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 11:31:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:14,324 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-20 11:31:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:14,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 11:31:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:14,348 INFO L225 Difference]: With dead ends: 1068 [2019-11-20 11:31:14,349 INFO L226 Difference]: Without dead ends: 670 [2019-11-20 11:31:14,355 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 11:31:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-20 11:31:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-20 11:31:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-20 11:31:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-20 11:31:14,474 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 185 [2019-11-20 11:31:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:14,478 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-20 11:31:14,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-20 11:31:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 11:31:14,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:14,484 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:14,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 689139339, now seen corresponding path program 1 times [2019-11-20 11:31:14,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:14,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641680173] [2019-11-20 11:31:14,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:14,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641680173] [2019-11-20 11:31:14,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:14,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:14,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150696871] [2019-11-20 11:31:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:14,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:14,687 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-20 11:31:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:16,402 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-20 11:31:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:16,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-20 11:31:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:16,411 INFO L225 Difference]: With dead ends: 1762 [2019-11-20 11:31:16,411 INFO L226 Difference]: Without dead ends: 1308 [2019-11-20 11:31:16,414 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 11:31:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-20 11:31:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-20 11:31:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-20 11:31:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-20 11:31:16,459 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 190 [2019-11-20 11:31:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:16,460 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-20 11:31:16,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-20 11:31:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 11:31:16,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:16,464 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] [2019-11-20 11:31:16,465 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1152691044, now seen corresponding path program 1 times [2019-11-20 11:31:16,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:16,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133253870] [2019-11-20 11:31:16,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:16,553 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 11:31:16,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133253870] [2019-11-20 11:31:16,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:16,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:31:16,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926815851] [2019-11-20 11:31:16,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:16,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:16,555 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-20 11:31:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:17,807 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-20 11:31:17,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:17,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-20 11:31:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:17,817 INFO L225 Difference]: With dead ends: 2567 [2019-11-20 11:31:17,820 INFO L226 Difference]: Without dead ends: 1700 [2019-11-20 11:31:17,821 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 11:31:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-20 11:31:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-20 11:31:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-20 11:31:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-20 11:31:17,882 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 193 [2019-11-20 11:31:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:17,882 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-20 11:31:17,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-20 11:31:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-20 11:31:17,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:17,898 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-20 11:31:17,898 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1740913381, now seen corresponding path program 1 times [2019-11-20 11:31:17,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:17,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199378882] [2019-11-20 11:31:17,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 11:31:18,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199378882] [2019-11-20 11:31:18,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:18,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:31:18,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461636730] [2019-11-20 11:31:18,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:18,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:18,045 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-20 11:31:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:19,116 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-20 11:31:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-20 11:31:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:19,131 INFO L225 Difference]: With dead ends: 4189 [2019-11-20 11:31:19,132 INFO L226 Difference]: Without dead ends: 2508 [2019-11-20 11:31:19,135 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 11:31:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-20 11:31:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-20 11:31:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-20 11:31:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-20 11:31:19,197 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 200 [2019-11-20 11:31:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:19,197 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-20 11:31:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-20 11:31:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 11:31:19,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:19,206 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:19,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1587791275, now seen corresponding path program 1 times [2019-11-20 11:31:19,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:19,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149570504] [2019-11-20 11:31:19,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 11:31:19,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149570504] [2019-11-20 11:31:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:31:19,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021408514] [2019-11-20 11:31:19,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:19,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:19,303 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-20 11:31:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:19,769 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-20 11:31:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:19,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-20 11:31:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:19,800 INFO L225 Difference]: With dead ends: 7497 [2019-11-20 11:31:19,800 INFO L226 Difference]: Without dead ends: 4992 [2019-11-20 11:31:19,806 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 11:31:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-20 11:31:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-20 11:31:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-20 11:31:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-20 11:31:19,935 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 205 [2019-11-20 11:31:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:19,935 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-20 11:31:19,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-20 11:31:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-20 11:31:19,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:19,950 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 11:31:19,950 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1507804289, now seen corresponding path program 1 times [2019-11-20 11:31:19,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:19,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066145709] [2019-11-20 11:31:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 11:31:20,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066145709] [2019-11-20 11:31:20,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859717925] [2019-11-20 11:31:20,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 11:31:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:20,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:31:20,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 11:31:20,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:31:20,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 11:31:20,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585428622] [2019-11-20 11:31:20,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:20,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:20,448 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-20 11:31:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:20,896 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-20 11:31:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:20,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-20 11:31:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:20,957 INFO L225 Difference]: With dead ends: 14957 [2019-11-20 11:31:20,958 INFO L226 Difference]: Without dead ends: 9970 [2019-11-20 11:31:20,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 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 11:31:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-20 11:31:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-20 11:31:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-20 11:31:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-20 11:31:21,208 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 214 [2019-11-20 11:31:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:21,213 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-20 11:31:21,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-20 11:31:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 11:31:21,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:21,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:21,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:31:21,437 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1558518551, now seen corresponding path program 1 times [2019-11-20 11:31:21,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:21,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850159942] [2019-11-20 11:31:21,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:21,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850159942] [2019-11-20 11:31:21,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:21,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:31:21,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751422934] [2019-11-20 11:31:21,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:31:21,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:31:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:31:21,648 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-20 11:31:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:24,298 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-20 11:31:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:31:24,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-11-20 11:31:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:24,351 INFO L225 Difference]: With dead ends: 22448 [2019-11-20 11:31:24,351 INFO L226 Difference]: Without dead ends: 12482 [2019-11-20 11:31:24,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:31:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-20 11:31:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-20 11:31:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-20 11:31:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-20 11:31:24,577 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 223 [2019-11-20 11:31:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:24,578 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-20 11:31:24,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:31:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-20 11:31:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 11:31:24,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:24,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:24,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1779815714, now seen corresponding path program 1 times [2019-11-20 11:31:24,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:24,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719216622] [2019-11-20 11:31:24,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 11:31:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719216622] [2019-11-20 11:31:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:24,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880967629] [2019-11-20 11:31:24,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:24,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:24,725 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-20 11:31:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:25,947 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-20 11:31:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:25,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-20 11:31:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:25,970 INFO L225 Difference]: With dead ends: 21582 [2019-11-20 11:31:25,970 INFO L226 Difference]: Without dead ends: 10804 [2019-11-20 11:31:25,985 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 11:31:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-20 11:31:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-20 11:31:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-20 11:31:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-20 11:31:26,160 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 223 [2019-11-20 11:31:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:26,161 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-20 11:31:26,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-20 11:31:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 11:31:26,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:26,181 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:26,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1292769297, now seen corresponding path program 1 times [2019-11-20 11:31:26,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:26,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698815306] [2019-11-20 11:31:26,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 11:31:26,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698815306] [2019-11-20 11:31:26,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:26,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:26,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426356993] [2019-11-20 11:31:26,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:26,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:26,296 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-20 11:31:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:28,476 INFO L93 Difference]: Finished difference Result 39484 states and 52680 transitions. [2019-11-20 11:31:28,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:28,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-20 11:31:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:28,539 INFO L225 Difference]: With dead ends: 39484 [2019-11-20 11:31:28,539 INFO L226 Difference]: Without dead ends: 28706 [2019-11-20 11:31:28,559 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 11:31:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-11-20 11:31:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 20132. [2019-11-20 11:31:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-20 11:31:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26029 transitions. [2019-11-20 11:31:28,930 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26029 transitions. Word has length 223 [2019-11-20 11:31:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:28,930 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26029 transitions. [2019-11-20 11:31:28,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26029 transitions. [2019-11-20 11:31:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 11:31:28,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:28,967 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:28,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash 959111984, now seen corresponding path program 1 times [2019-11-20 11:31:28,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:28,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528016666] [2019-11-20 11:31:28,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 11:31:29,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528016666] [2019-11-20 11:31:29,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:29,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:29,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785875474] [2019-11-20 11:31:29,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:29,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:29,077 INFO L87 Difference]: Start difference. First operand 20132 states and 26029 transitions. Second operand 3 states. [2019-11-20 11:31:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:30,501 INFO L93 Difference]: Finished difference Result 55495 states and 71447 transitions. [2019-11-20 11:31:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:30,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 11:31:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:30,594 INFO L225 Difference]: With dead ends: 55495 [2019-11-20 11:31:30,594 INFO L226 Difference]: Without dead ends: 35365 [2019-11-20 11:31:30,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 11:31:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-20 11:31:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-20 11:31:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-20 11:31:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41636 transitions. [2019-11-20 11:31:31,421 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41636 transitions. Word has length 229 [2019-11-20 11:31:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:31,421 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41636 transitions. [2019-11-20 11:31:31,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41636 transitions. [2019-11-20 11:31:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-20 11:31:31,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:31,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:31,492 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1066196502, now seen corresponding path program 1 times [2019-11-20 11:31:31,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:31,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126821218] [2019-11-20 11:31:31,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:31,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126821218] [2019-11-20 11:31:31,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:31,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:31,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943283255] [2019-11-20 11:31:31,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:31,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:31,662 INFO L87 Difference]: Start difference. First operand 35357 states and 41636 transitions. Second operand 4 states. [2019-11-20 11:31:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:33,726 INFO L93 Difference]: Finished difference Result 83915 states and 100059 transitions. [2019-11-20 11:31:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:33,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-20 11:31:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:33,819 INFO L225 Difference]: With dead ends: 83915 [2019-11-20 11:31:33,819 INFO L226 Difference]: Without dead ends: 48560 [2019-11-20 11:31:33,842 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 11:31:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2019-11-20 11:31:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 48552. [2019-11-20 11:31:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-11-20 11:31:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 55757 transitions. [2019-11-20 11:31:34,458 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 55757 transitions. Word has length 240 [2019-11-20 11:31:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:34,459 INFO L462 AbstractCegarLoop]: Abstraction has 48552 states and 55757 transitions. [2019-11-20 11:31:34,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 55757 transitions. [2019-11-20 11:31:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-20 11:31:34,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:34,489 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-20 11:31:34,489 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1317057987, now seen corresponding path program 1 times [2019-11-20 11:31:34,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:34,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007508499] [2019-11-20 11:31:34,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 11:31:35,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007508499] [2019-11-20 11:31:35,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:35,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:31:35,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624046730] [2019-11-20 11:31:35,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:35,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:35,006 INFO L87 Difference]: Start difference. First operand 48552 states and 55757 transitions. Second operand 3 states. [2019-11-20 11:31:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:35,883 INFO L93 Difference]: Finished difference Result 96192 states and 110404 transitions. [2019-11-20 11:31:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:35,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-20 11:31:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:35,951 INFO L225 Difference]: With dead ends: 96192 [2019-11-20 11:31:35,951 INFO L226 Difference]: Without dead ends: 47642 [2019-11-20 11:31:35,978 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 11:31:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47642 states. [2019-11-20 11:31:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47642 to 47642. [2019-11-20 11:31:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47642 states. [2019-11-20 11:31:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47642 states to 47642 states and 54149 transitions. [2019-11-20 11:31:36,601 INFO L78 Accepts]: Start accepts. Automaton has 47642 states and 54149 transitions. Word has length 272 [2019-11-20 11:31:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:36,601 INFO L462 AbstractCegarLoop]: Abstraction has 47642 states and 54149 transitions. [2019-11-20 11:31:36,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 47642 states and 54149 transitions. [2019-11-20 11:31:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-20 11:31:36,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:36,623 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:31:36,623 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2040139229, now seen corresponding path program 1 times [2019-11-20 11:31:36,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:36,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562891795] [2019-11-20 11:31:36,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 11:31:36,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562891795] [2019-11-20 11:31:36,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:36,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:36,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557265897] [2019-11-20 11:31:36,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:36,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:36,833 INFO L87 Difference]: Start difference. First operand 47642 states and 54149 transitions. Second operand 4 states. [2019-11-20 11:31:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:39,333 INFO L93 Difference]: Finished difference Result 130676 states and 148947 transitions. [2019-11-20 11:31:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:39,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-11-20 11:31:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:39,446 INFO L225 Difference]: With dead ends: 130676 [2019-11-20 11:31:39,447 INFO L226 Difference]: Without dead ends: 83036 [2019-11-20 11:31:39,473 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 11:31:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-11-20 11:31:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 60228. [2019-11-20 11:31:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60228 states. [2019-11-20 11:31:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60228 states to 60228 states and 69021 transitions. [2019-11-20 11:31:40,449 INFO L78 Accepts]: Start accepts. Automaton has 60228 states and 69021 transitions. Word has length 283 [2019-11-20 11:31:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:40,450 INFO L462 AbstractCegarLoop]: Abstraction has 60228 states and 69021 transitions. [2019-11-20 11:31:40,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 60228 states and 69021 transitions. [2019-11-20 11:31:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-20 11:31:40,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:40,485 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2019-11-20 11:31:40,485 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1305533371, now seen corresponding path program 1 times [2019-11-20 11:31:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279584542] [2019-11-20 11:31:40,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 11:31:40,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279584542] [2019-11-20 11:31:40,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:31:40,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628261222] [2019-11-20 11:31:40,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:40,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:40,707 INFO L87 Difference]: Start difference. First operand 60228 states and 69021 transitions. Second operand 3 states. [2019-11-20 11:31:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:41,415 INFO L93 Difference]: Finished difference Result 120446 states and 138032 transitions. [2019-11-20 11:31:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:41,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-20 11:31:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:41,476 INFO L225 Difference]: With dead ends: 120446 [2019-11-20 11:31:41,476 INFO L226 Difference]: Without dead ends: 60220 [2019-11-20 11:31:41,506 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 11:31:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60220 states. [2019-11-20 11:31:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60220 to 60220. [2019-11-20 11:31:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-20 11:31:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 69005 transitions. [2019-11-20 11:31:42,681 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 69005 transitions. Word has length 310 [2019-11-20 11:31:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:42,681 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 69005 transitions. [2019-11-20 11:31:42,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 69005 transitions. [2019-11-20 11:31:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-20 11:31:42,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:42,712 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:42,712 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1481379333, now seen corresponding path program 1 times [2019-11-20 11:31:42,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:42,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199666670] [2019-11-20 11:31:42,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-20 11:31:42,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199666670] [2019-11-20 11:31:42,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879801297] [2019-11-20 11:31:42,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 11:31:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:43,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:31:43,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 11:31:43,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:31:43,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 11:31:43,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526906486] [2019-11-20 11:31:43,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:43,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:31:43,182 INFO L87 Difference]: Start difference. First operand 60220 states and 69005 transitions. Second operand 3 states. [2019-11-20 11:31:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:44,271 INFO L93 Difference]: Finished difference Result 123720 states and 141411 transitions. [2019-11-20 11:31:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:44,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-11-20 11:31:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:44,332 INFO L225 Difference]: With dead ends: 123720 [2019-11-20 11:31:44,332 INFO L226 Difference]: Without dead ends: 63502 [2019-11-20 11:31:44,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 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 11:31:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63502 states. [2019-11-20 11:31:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63502 to 63468. [2019-11-20 11:31:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63468 states. [2019-11-20 11:31:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63468 states to 63468 states and 71542 transitions. [2019-11-20 11:31:45,076 INFO L78 Accepts]: Start accepts. Automaton has 63468 states and 71542 transitions. Word has length 316 [2019-11-20 11:31:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:45,077 INFO L462 AbstractCegarLoop]: Abstraction has 63468 states and 71542 transitions. [2019-11-20 11:31:45,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 63468 states and 71542 transitions. [2019-11-20 11:31:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-20 11:31:45,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:45,112 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:31:45,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:31:45,793 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 970355755, now seen corresponding path program 1 times [2019-11-20 11:31:45,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:45,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626760057] [2019-11-20 11:31:45,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:46,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626760057] [2019-11-20 11:31:46,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:46,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:46,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889416294] [2019-11-20 11:31:46,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:46,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:46,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:46,094 INFO L87 Difference]: Start difference. First operand 63468 states and 71542 transitions. Second operand 3 states. [2019-11-20 11:31:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:47,257 INFO L93 Difference]: Finished difference Result 130213 states and 147030 transitions. [2019-11-20 11:31:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:47,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-20 11:31:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:47,321 INFO L225 Difference]: With dead ends: 130213 [2019-11-20 11:31:47,322 INFO L226 Difference]: Without dead ends: 66747 [2019-11-20 11:31:47,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66747 states. [2019-11-20 11:31:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66747 to 66745. [2019-11-20 11:31:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66745 states. [2019-11-20 11:31:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66745 states to 66745 states and 74820 transitions. [2019-11-20 11:31:48,030 INFO L78 Accepts]: Start accepts. Automaton has 66745 states and 74820 transitions. Word has length 336 [2019-11-20 11:31:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:48,031 INFO L462 AbstractCegarLoop]: Abstraction has 66745 states and 74820 transitions. [2019-11-20 11:31:48,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 66745 states and 74820 transitions. [2019-11-20 11:31:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-20 11:31:48,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:48,057 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:31:48,057 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1175765495, now seen corresponding path program 1 times [2019-11-20 11:31:48,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:48,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011020908] [2019-11-20 11:31:48,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 11:31:48,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011020908] [2019-11-20 11:31:48,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:48,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:31:48,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168440502] [2019-11-20 11:31:48,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:48,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:48,289 INFO L87 Difference]: Start difference. First operand 66745 states and 74820 transitions. Second operand 4 states. [2019-11-20 11:31:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:50,394 INFO L93 Difference]: Finished difference Result 140841 states and 158227 transitions. [2019-11-20 11:31:50,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:50,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2019-11-20 11:31:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:50,473 INFO L225 Difference]: With dead ends: 140841 [2019-11-20 11:31:50,473 INFO L226 Difference]: Without dead ends: 74098 [2019-11-20 11:31:50,501 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 11:31:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74098 states. [2019-11-20 11:31:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74098 to 74071. [2019-11-20 11:31:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74071 states. [2019-11-20 11:31:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74071 states to 74071 states and 82953 transitions. [2019-11-20 11:31:51,248 INFO L78 Accepts]: Start accepts. Automaton has 74071 states and 82953 transitions. Word has length 342 [2019-11-20 11:31:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:51,248 INFO L462 AbstractCegarLoop]: Abstraction has 74071 states and 82953 transitions. [2019-11-20 11:31:51,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 74071 states and 82953 transitions. [2019-11-20 11:31:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-20 11:31:51,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:51,276 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:51,276 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:31:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1010752569, now seen corresponding path program 1 times [2019-11-20 11:31:51,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:31:51,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057763425] [2019-11-20 11:31:51,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:31:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 11:31:51,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057763425] [2019-11-20 11:31:51,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438682390] [2019-11-20 11:31:51,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/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 11:31:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:51,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:31:51,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-20 11:31:51,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:31:51,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 11:31:51,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212814302] [2019-11-20 11:31:51,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:51,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:31:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:31:51,834 INFO L87 Difference]: Start difference. First operand 74071 states and 82953 transitions. Second operand 3 states. [2019-11-20 11:31:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:52,956 INFO L93 Difference]: Finished difference Result 145701 states and 163234 transitions. [2019-11-20 11:31:52,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-20 11:31:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:52,958 INFO L225 Difference]: With dead ends: 145701 [2019-11-20 11:31:52,958 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 11:31:52,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 347 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 11:31:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 11:31:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 11:31:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 11:31:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 11:31:52,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 348 [2019-11-20 11:31:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:53,000 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:31:53,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:31:53,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 11:31:53,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:31:53,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 11:31:55,206 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 742 DAG size of output: 406 [2019-11-20 11:31:56,951 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 742 DAG size of output: 406 [2019-11-20 11:31:59,701 WARN L191 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 373 DAG size of output: 76 [2019-11-20 11:32:01,909 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 373 DAG size of output: 76 [2019-11-20 11:32:01,912 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 11:32:01,912 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 11:32:01,912 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,912 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,913 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,914 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,915 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 11:32:01,916 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 11:32:01,917 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 11:32:01,918 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,919 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,920 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,921 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 11:32:01,922 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 11:32:01,923 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse16 (not .cse5)) (.cse8 (not (= 1 ~a11~0)))) (let ((.cse9 (and .cse16 .cse8)) (.cse7 (= ~a5~0 1)) (.cse2 (= 1 ~a6~0)) (.cse14 (not .cse1)) (.cse10 (= ~a16~0 1))) (let ((.cse17 (and .cse14 .cse10 .cse8)) (.cse4 (= 1 ~a3~0)) (.cse12 (= ~a26~0 1)) (.cse18 (<= ~a20~0 0)) (.cse11 (not .cse2)) (.cse13 (<= ~a3~0 0)) (.cse6 (<= ~a26~0 0)) (.cse0 (= ~a18~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse3 (and .cse9 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and (and .cse4 (and (and .cse9 .cse10) .cse11) .cse7) .cse0) (and .cse0 .cse7 .cse12 .cse8) (and .cse13 .cse0 .cse1 .cse7 .cse10) (and .cse13 .cse0 .cse7 .cse12) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 (and .cse14 .cse10)) (and .cse0 .cse15 .cse1 .cse7 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse12 .cse10) (and .cse0 .cse15 .cse1 (and .cse7 .cse10 .cse8)) (and (<= ~a6~0 0) .cse0 .cse7 .cse12) (and (and (and .cse16 .cse1 .cse11 .cse10) .cse7) .cse0) (and .cse0 .cse15 .cse1 .cse2 .cse5 .cse7 .cse10) (and .cse0 .cse15 (and (and .cse16 .cse1 .cse11) .cse7)) (and .cse13 .cse0 .cse17 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse17 .cse2 .cse6 .cse7) (and .cse0 (and .cse4 (and .cse9 .cse11 .cse18) .cse7)) (and .cse0 .cse15 .cse6 .cse7 (and .cse16 .cse11)) (and .cse0 .cse1 (and (and .cse16 .cse11 .cse18) .cse7)) (and .cse16 .cse0 .cse7 .cse12) (and .cse13 .cse0 .cse1 .cse7 .cse18) (and .cse13 .cse0 .cse6 .cse7 (and .cse5 .cse11 .cse8)) (and .cse0 .cse15 .cse1 .cse6 .cse7 .cse8) (and .cse13 .cse16 .cse0 .cse1 .cse7) (and .cse16 .cse0 .cse15 .cse1 .cse6 .cse7) (and .cse0 .cse15 .cse3)))))) [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,924 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1590) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 11:32:01,925 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,928 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,928 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 11:32:01,929 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse16 (not .cse5)) (.cse8 (not (= 1 ~a11~0)))) (let ((.cse9 (and .cse16 .cse8)) (.cse7 (= ~a5~0 1)) (.cse2 (= 1 ~a6~0)) (.cse14 (not .cse1)) (.cse10 (= ~a16~0 1))) (let ((.cse17 (and .cse14 .cse10 .cse8)) (.cse4 (= 1 ~a3~0)) (.cse12 (= ~a26~0 1)) (.cse18 (<= ~a20~0 0)) (.cse11 (not .cse2)) (.cse13 (<= ~a3~0 0)) (.cse6 (<= ~a26~0 0)) (.cse0 (= ~a18~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse3 (and .cse9 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and (and .cse4 (and (and .cse9 .cse10) .cse11) .cse7) .cse0) (and .cse0 .cse7 .cse12 .cse8) (and .cse13 .cse0 .cse1 .cse7 .cse10) (and .cse13 .cse0 .cse7 .cse12) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 (and .cse14 .cse10)) (and .cse0 .cse15 .cse1 .cse7 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse12 .cse10) (and .cse0 .cse15 .cse1 (and .cse7 .cse10 .cse8)) (and (<= ~a6~0 0) .cse0 .cse7 .cse12) (and (and (and .cse16 .cse1 .cse11 .cse10) .cse7) .cse0) (and .cse0 .cse15 .cse1 .cse2 .cse5 .cse7 .cse10) (and .cse0 .cse15 (and (and .cse16 .cse1 .cse11) .cse7)) (and .cse13 .cse0 .cse17 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse17 .cse2 .cse6 .cse7) (and .cse0 (and .cse4 (and .cse9 .cse11 .cse18) .cse7)) (and .cse0 .cse15 .cse6 .cse7 (and .cse16 .cse11)) (and .cse0 .cse1 (and (and .cse16 .cse11 .cse18) .cse7)) (and .cse16 .cse0 .cse7 .cse12) (and .cse13 .cse0 .cse1 .cse7 .cse18) (and .cse13 .cse0 .cse6 .cse7 (and .cse5 .cse11 .cse8)) (and .cse0 .cse15 .cse1 .cse6 .cse7 .cse8) (and .cse13 .cse16 .cse0 .cse1 .cse7) (and .cse16 .cse0 .cse15 .cse1 .cse6 .cse7) (and .cse0 .cse15 .cse3)))))) [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,930 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 11:32:01,931 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,932 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 11:32:01,933 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,934 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,935 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,936 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,937 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,938 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,939 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 11:32:01,940 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 11:32:01,941 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,942 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,943 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 11:32:01,944 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,945 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,946 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 11:32:01,947 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 11:32:01,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:32:01 BoogieIcfgContainer [2019-11-20 11:32:01,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:32:01,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:32:01,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:32:01,983 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:32:01,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:10" (3/4) ... [2019-11-20 11:32:01,987 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 11:32:02,044 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 11:32:02,049 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 11:32:02,320 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_56a18c27-6172-4a57-a892-f30b4e1b9ba8/bin/uautomizer/witness.graphml [2019-11-20 11:32:02,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:32:02,321 INFO L168 Benchmark]: Toolchain (without parser) took 55594.86 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,322 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:32:02,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1298.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,323 INFO L168 Benchmark]: Boogie Preprocessor took 130.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,323 INFO L168 Benchmark]: RCFGBuilder took 2356.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.0 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,324 INFO L168 Benchmark]: TraceAbstraction took 51296.73 ms. Allocated memory was 1.3 GB in the beginning and 3.3 GB in the end (delta: 2.0 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 122.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,324 INFO L168 Benchmark]: Witness Printer took 337.49 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:32:02,326 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1298.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2356.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.0 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51296.73 ms. Allocated memory was 1.3 GB in the beginning and 3.3 GB in the end (delta: 2.0 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 122.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 337.49 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1590]: 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: (((((((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a6) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || (((1 == a3 && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && !(1 == a6)) && a5 == 1) && a18 == 1)) || (((a18 == 1 && a5 == 1) && a26 == 1) && !(1 == a11))) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a5 == 1) && !(1 == a6)) && a26 == 1)) || ((((a18 == 1 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || (((a18 == 1 && 2 <= a3) && a27 == 1) && (a5 == 1 && a16 == 1) && !(1 == a11))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1)) || ((a18 == 1 && 2 <= a3) && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && 2 <= a3) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1)) || (a18 == 1 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || ((a18 == 1 && a27 == 1) && ((!(a12 == 1) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a20 <= 0)) || ((((a3 <= 0 && a18 == 1) && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11))) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a3 <= 0 && !(a12 == 1)) && a18 == 1) && a27 == 1) && a5 == 1)) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1)) || ((a18 == 1 && 2 <= a3) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a6) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || (((1 == a3 && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && !(1 == a6)) && a5 == 1) && a18 == 1)) || (((a18 == 1 && a5 == 1) && a26 == 1) && !(1 == a11))) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a5 == 1) && !(1 == a6)) && a26 == 1)) || ((((a18 == 1 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || (((a18 == 1 && 2 <= a3) && a27 == 1) && (a5 == 1 && a16 == 1) && !(1 == a11))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1)) || ((a18 == 1 && 2 <= a3) && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && 2 <= a3) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1)) || (a18 == 1 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || ((a18 == 1 && a27 == 1) && ((!(a12 == 1) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a20 <= 0)) || ((((a3 <= 0 && a18 == 1) && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11))) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a3 <= 0 && !(a12 == 1)) && a18 == 1) && a27 == 1) && a5 == 1)) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1)) || ((a18 == 1 && 2 <= a3) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 51.1s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.6s, HoareTripleCheckerStatistics: 3544 SDtfs, 5860 SDslu, 1376 SDs, 0 SdLazy, 13312 SolverSat, 2184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 894 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74071occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 33863 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 624 NumberOfFragments, 1091 HoareAnnotationTreeSize, 3 FomulaSimplifications, 25178 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 21320 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 5410 NumberOfCodeBlocks, 5410 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5389 ConstructedInterpolants, 0 QuantifiedInterpolants, 2431439 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1640 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 2243/2257 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...