./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.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_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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 65f69a82f917cd816f2caa8fef857cdeb22603b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:34:30,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:34:30,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:34:30,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:34:30,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:34:30,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:34:30,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:34:30,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:34:30,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:34:30,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:34:30,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:34:30,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:34:30,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:34:30,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:34:30,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:34:30,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:34:30,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:34:30,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:34:30,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:34:30,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:34:30,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:34:30,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:34:30,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:34:30,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:34:30,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:34:30,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:34:30,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:34:30,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:34:30,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:34:30,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:34:30,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:34:30,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:34:30,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:34:30,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:34:30,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:34:30,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:34:30,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:34:30,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:34:30,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:34:30,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:34:30,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:34:30,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:34:30,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:34:30,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:34:30,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:34:30,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:34:30,490 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:34:30,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:34:30,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:34:30,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:34:30,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:34:30,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:34:30,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:34:30,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:34:30,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:34:30,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:34:30,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:34:30,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:34:30,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:34:30,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:34:30,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:34:30,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:34:30,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:34:30,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:34:30,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:34:30,494 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_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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 -> 65f69a82f917cd816f2caa8fef857cdeb22603b5 [2019-11-19 23:34:30,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:34:30,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:34:30,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:34:30,687 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:34:30,687 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:34:30,688 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-11-19 23:34:30,752 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/data/0d1d5b436/9db9d8da2d544b21b8f79f7d2dab48c0/FLAG26cc73ac9 [2019-11-19 23:34:31,272 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:34:31,283 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-11-19 23:34:31,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/data/0d1d5b436/9db9d8da2d544b21b8f79f7d2dab48c0/FLAG26cc73ac9 [2019-11-19 23:34:31,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/data/0d1d5b436/9db9d8da2d544b21b8f79f7d2dab48c0 [2019-11-19 23:34:31,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:34:31,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:34:31,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:34:31,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:34:31,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:34:31,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:34:31" (1/1) ... [2019-11-19 23:34:31,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f1b7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:31, skipping insertion in model container [2019-11-19 23:34:31,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:34:31" (1/1) ... [2019-11-19 23:34:31,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:34:31,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:34:32,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:34:32,510 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:34:32,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:34:32,687 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:34:32,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32 WrapperNode [2019-11-19 23:34:32,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:34:32,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:34:32,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:34:32,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:34:32,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:34:32,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:34:32,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:34:32,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:34:32,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... [2019-11-19 23:34:32,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:34:32,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:34:32,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:34:32,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:34:32,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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-19 23:34:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:34:32,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:34:34,722 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:34:34,723 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:34:34,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:34 BoogieIcfgContainer [2019-11-19 23:34:34,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:34:34,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:34:34,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:34:34,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:34:34,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:34:31" (1/3) ... [2019-11-19 23:34:34,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68797d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:34:34, skipping insertion in model container [2019-11-19 23:34:34,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:32" (2/3) ... [2019-11-19 23:34:34,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68797d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:34:34, skipping insertion in model container [2019-11-19 23:34:34,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:34" (3/3) ... [2019-11-19 23:34:34,732 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2019-11-19 23:34:34,745 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:34:34,752 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:34:34,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:34:34,797 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:34:34,797 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:34:34,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:34:34,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:34:34,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:34:34,798 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:34:34,798 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:34:34,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:34:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-19 23:34:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 23:34:34,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:34,836 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] [2019-11-19 23:34:34,837 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-11-19 23:34:34,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:34,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959680788] [2019-11-19 23:34:34,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:35,161 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-19 23:34:35,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959680788] [2019-11-19 23:34:35,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:35,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:35,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125890787] [2019-11-19 23:34:35,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:35,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:35,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:35,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:35,183 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-19 23:34:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:37,366 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-11-19 23:34:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:37,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-19 23:34:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:37,386 INFO L225 Difference]: With dead ends: 966 [2019-11-19 23:34:37,387 INFO L226 Difference]: Without dead ends: 616 [2019-11-19 23:34:37,391 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-19 23:34:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-19 23:34:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-11-19 23:34:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-19 23:34:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-19 23:34:37,467 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 54 [2019-11-19 23:34:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:37,467 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-19 23:34:37,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-19 23:34:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 23:34:37,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:37,473 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, 1, 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-19 23:34:37,473 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1089723297, now seen corresponding path program 1 times [2019-11-19 23:34:37,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:37,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559279575] [2019-11-19 23:34:37,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:37,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559279575] [2019-11-19 23:34:37,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:37,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:37,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663264474] [2019-11-19 23:34:37,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:37,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:37,617 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-11-19 23:34:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:39,266 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-11-19 23:34:39,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:39,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-19 23:34:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:39,278 INFO L225 Difference]: With dead ends: 2309 [2019-11-19 23:34:39,278 INFO L226 Difference]: Without dead ends: 1711 [2019-11-19 23:34:39,281 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-19 23:34:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-19 23:34:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1343. [2019-11-19 23:34:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-19 23:34:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1799 transitions. [2019-11-19 23:34:39,338 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1799 transitions. Word has length 125 [2019-11-19 23:34:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1799 transitions. [2019-11-19 23:34:39,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1799 transitions. [2019-11-19 23:34:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-19 23:34:39,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:39,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:34:39,343 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1383649082, now seen corresponding path program 1 times [2019-11-19 23:34:39,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:39,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499921363] [2019-11-19 23:34:39,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:39,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499921363] [2019-11-19 23:34:39,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:39,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:39,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664863955] [2019-11-19 23:34:39,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:39,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:39,476 INFO L87 Difference]: Start difference. First operand 1343 states and 1799 transitions. Second operand 4 states. [2019-11-19 23:34:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:41,009 INFO L93 Difference]: Finished difference Result 4722 states and 6448 transitions. [2019-11-19 23:34:41,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:41,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-19 23:34:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:41,028 INFO L225 Difference]: With dead ends: 4722 [2019-11-19 23:34:41,029 INFO L226 Difference]: Without dead ends: 3381 [2019-11-19 23:34:41,031 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-19 23:34:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-11-19 23:34:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2447. [2019-11-19 23:34:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-19 23:34:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-11-19 23:34:41,100 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 138 [2019-11-19 23:34:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:41,101 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-11-19 23:34:41,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-11-19 23:34:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-19 23:34:41,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:41,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:34:41,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash -728761857, now seen corresponding path program 1 times [2019-11-19 23:34:41,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:41,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801743578] [2019-11-19 23:34:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:41,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801743578] [2019-11-19 23:34:41,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:41,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:41,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327803245] [2019-11-19 23:34:41,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:41,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:41,465 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 4 states. [2019-11-19 23:34:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:42,862 INFO L93 Difference]: Finished difference Result 7122 states and 9244 transitions. [2019-11-19 23:34:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:42,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-19 23:34:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:42,886 INFO L225 Difference]: With dead ends: 7122 [2019-11-19 23:34:42,887 INFO L226 Difference]: Without dead ends: 4861 [2019-11-19 23:34:42,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2019-11-19 23:34:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3364. [2019-11-19 23:34:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-11-19 23:34:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4177 transitions. [2019-11-19 23:34:42,962 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4177 transitions. Word has length 181 [2019-11-19 23:34:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:42,962 INFO L462 AbstractCegarLoop]: Abstraction has 3364 states and 4177 transitions. [2019-11-19 23:34:42,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4177 transitions. [2019-11-19 23:34:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-19 23:34:42,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:42,969 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 23:34:42,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1752037152, now seen corresponding path program 1 times [2019-11-19 23:34:42,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:42,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992931339] [2019-11-19 23:34:42,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:43,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992931339] [2019-11-19 23:34:43,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:43,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:43,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906597] [2019-11-19 23:34:43,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:34:43,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:34:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:34:43,257 INFO L87 Difference]: Start difference. First operand 3364 states and 4177 transitions. Second operand 5 states. [2019-11-19 23:34:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:45,270 INFO L93 Difference]: Finished difference Result 11534 states and 14528 transitions. [2019-11-19 23:34:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:34:45,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2019-11-19 23:34:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:45,312 INFO L225 Difference]: With dead ends: 11534 [2019-11-19 23:34:45,312 INFO L226 Difference]: Without dead ends: 8356 [2019-11-19 23:34:45,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:34:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8356 states. [2019-11-19 23:34:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8356 to 6503. [2019-11-19 23:34:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-11-19 23:34:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 7962 transitions. [2019-11-19 23:34:45,453 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 7962 transitions. Word has length 281 [2019-11-19 23:34:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:45,454 INFO L462 AbstractCegarLoop]: Abstraction has 6503 states and 7962 transitions. [2019-11-19 23:34:45,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:34:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 7962 transitions. [2019-11-19 23:34:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-19 23:34:45,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:45,464 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:45,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1357238772, now seen corresponding path program 1 times [2019-11-19 23:34:45,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:45,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943284392] [2019-11-19 23:34:45,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:45,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943284392] [2019-11-19 23:34:45,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:45,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:45,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285757924] [2019-11-19 23:34:45,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:45,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:45,799 INFO L87 Difference]: Start difference. First operand 6503 states and 7962 transitions. Second operand 4 states. [2019-11-19 23:34:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:47,337 INFO L93 Difference]: Finished difference Result 15593 states and 19175 transitions. [2019-11-19 23:34:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:47,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-11-19 23:34:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:47,382 INFO L225 Difference]: With dead ends: 15593 [2019-11-19 23:34:47,382 INFO L226 Difference]: Without dead ends: 9276 [2019-11-19 23:34:47,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-11-19 23:34:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9079. [2019-11-19 23:34:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9079 states. [2019-11-19 23:34:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9079 states to 9079 states and 10766 transitions. [2019-11-19 23:34:47,561 INFO L78 Accepts]: Start accepts. Automaton has 9079 states and 10766 transitions. Word has length 324 [2019-11-19 23:34:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:47,562 INFO L462 AbstractCegarLoop]: Abstraction has 9079 states and 10766 transitions. [2019-11-19 23:34:47,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9079 states and 10766 transitions. [2019-11-19 23:34:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-19 23:34:47,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:47,576 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:47,576 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1634065239, now seen corresponding path program 1 times [2019-11-19 23:34:47,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:47,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230505960] [2019-11-19 23:34:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-19 23:34:47,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230505960] [2019-11-19 23:34:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:47,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:47,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022606579] [2019-11-19 23:34:47,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:47,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:47,828 INFO L87 Difference]: Start difference. First operand 9079 states and 10766 transitions. Second operand 3 states. [2019-11-19 23:34:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:48,652 INFO L93 Difference]: Finished difference Result 17414 states and 20745 transitions. [2019-11-19 23:34:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:48,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-19 23:34:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:48,680 INFO L225 Difference]: With dead ends: 17414 [2019-11-19 23:34:48,680 INFO L226 Difference]: Without dead ends: 9077 [2019-11-19 23:34:48,690 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-19 23:34:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2019-11-19 23:34:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 8525. [2019-11-19 23:34:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8525 states. [2019-11-19 23:34:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8525 states to 8525 states and 9767 transitions. [2019-11-19 23:34:48,809 INFO L78 Accepts]: Start accepts. Automaton has 8525 states and 9767 transitions. Word has length 335 [2019-11-19 23:34:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:48,809 INFO L462 AbstractCegarLoop]: Abstraction has 8525 states and 9767 transitions. [2019-11-19 23:34:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 9767 transitions. [2019-11-19 23:34:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-19 23:34:48,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:48,821 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:48,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -87231958, now seen corresponding path program 1 times [2019-11-19 23:34:48,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:48,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270791138] [2019-11-19 23:34:48,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 175 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:49,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270791138] [2019-11-19 23:34:49,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118083045] [2019-11-19 23:34:49,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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-19 23:34:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:49,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:34:49,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:34:49,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:49,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 103 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:34:49,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:34:49,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-11-19 23:34:49,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184762123] [2019-11-19 23:34:49,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:34:49,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:34:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:34:49,674 INFO L87 Difference]: Start difference. First operand 8525 states and 9767 transitions. Second operand 7 states. [2019-11-19 23:34:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:58,124 INFO L93 Difference]: Finished difference Result 27370 states and 31608 transitions. [2019-11-19 23:34:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 23:34:58,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2019-11-19 23:34:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:58,162 INFO L225 Difference]: With dead ends: 27370 [2019-11-19 23:34:58,162 INFO L226 Difference]: Without dead ends: 19031 [2019-11-19 23:34:58,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:34:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-11-19 23:34:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 10727. [2019-11-19 23:34:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-11-19 23:34:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 12139 transitions. [2019-11-19 23:34:58,401 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 12139 transitions. Word has length 356 [2019-11-19 23:34:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:58,402 INFO L462 AbstractCegarLoop]: Abstraction has 10727 states and 12139 transitions. [2019-11-19 23:34:58,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:34:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 12139 transitions. [2019-11-19 23:34:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-11-19 23:34:58,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:58,427 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:58,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:34:58,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -474601086, now seen corresponding path program 1 times [2019-11-19 23:34:58,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:58,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857938677] [2019-11-19 23:34:58,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 23:34:59,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857938677] [2019-11-19 23:34:59,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:59,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:59,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585356376] [2019-11-19 23:34:59,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:59,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:59,175 INFO L87 Difference]: Start difference. First operand 10727 states and 12139 transitions. Second operand 4 states. [2019-11-19 23:35:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:00,665 INFO L93 Difference]: Finished difference Result 24418 states and 27727 transitions. [2019-11-19 23:35:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:35:00,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2019-11-19 23:35:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:00,683 INFO L225 Difference]: With dead ends: 24418 [2019-11-19 23:35:00,683 INFO L226 Difference]: Without dead ends: 13693 [2019-11-19 23:35:00,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:35:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13693 states. [2019-11-19 23:35:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13693 to 12935. [2019-11-19 23:35:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12935 states. [2019-11-19 23:35:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12935 states to 12935 states and 14483 transitions. [2019-11-19 23:35:00,868 INFO L78 Accepts]: Start accepts. Automaton has 12935 states and 14483 transitions. Word has length 483 [2019-11-19 23:35:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:00,869 INFO L462 AbstractCegarLoop]: Abstraction has 12935 states and 14483 transitions. [2019-11-19 23:35:00,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:35:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12935 states and 14483 transitions. [2019-11-19 23:35:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-19 23:35:00,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:00,897 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:35:00,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash 46233324, now seen corresponding path program 1 times [2019-11-19 23:35:00,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:00,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192390559] [2019-11-19 23:35:00,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 210 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:35:01,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192390559] [2019-11-19 23:35:01,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788950217] [2019-11-19 23:35:01,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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-19 23:35:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:02,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:35:02,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:35:02,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:02,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 23:35:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:35:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-19 23:35:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919555195] [2019-11-19 23:35:02,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:35:02,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:02,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:35:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:35:02,801 INFO L87 Difference]: Start difference. First operand 12935 states and 14483 transitions. Second operand 3 states. [2019-11-19 23:35:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:03,953 INFO L93 Difference]: Finished difference Result 28260 states and 31722 transitions. [2019-11-19 23:35:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:35:03,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 512 [2019-11-19 23:35:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:03,970 INFO L225 Difference]: With dead ends: 28260 [2019-11-19 23:35:03,971 INFO L226 Difference]: Without dead ends: 15511 [2019-11-19 23:35:03,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:35:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15511 states. [2019-11-19 23:35:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15511 to 13855. [2019-11-19 23:35:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13855 states. [2019-11-19 23:35:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13855 states to 13855 states and 15450 transitions. [2019-11-19 23:35:04,150 INFO L78 Accepts]: Start accepts. Automaton has 13855 states and 15450 transitions. Word has length 512 [2019-11-19 23:35:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:04,151 INFO L462 AbstractCegarLoop]: Abstraction has 13855 states and 15450 transitions. [2019-11-19 23:35:04,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:35:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13855 states and 15450 transitions. [2019-11-19 23:35:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-11-19 23:35:04,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:04,184 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:35:04,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:04,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -191395542, now seen corresponding path program 1 times [2019-11-19 23:35:04,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:04,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707866456] [2019-11-19 23:35:04,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-19 23:35:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707866456] [2019-11-19 23:35:04,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:35:04,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:35:04,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748733044] [2019-11-19 23:35:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:35:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:35:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:35:04,950 INFO L87 Difference]: Start difference. First operand 13855 states and 15450 transitions. Second operand 5 states. [2019-11-19 23:35:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:06,494 INFO L93 Difference]: Finished difference Result 26256 states and 29284 transitions. [2019-11-19 23:35:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:35:06,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 569 [2019-11-19 23:35:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:06,506 INFO L225 Difference]: With dead ends: 26256 [2019-11-19 23:35:06,506 INFO L226 Difference]: Without dead ends: 14431 [2019-11-19 23:35:06,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:35:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2019-11-19 23:35:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 13677. [2019-11-19 23:35:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-19 23:35:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15247 transitions. [2019-11-19 23:35:06,836 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15247 transitions. Word has length 569 [2019-11-19 23:35:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:06,837 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15247 transitions. [2019-11-19 23:35:06,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:35:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15247 transitions. [2019-11-19 23:35:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-11-19 23:35:06,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:06,861 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 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] [2019-11-19 23:35:06,862 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash -965769477, now seen corresponding path program 1 times [2019-11-19 23:35:06,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:06,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774892927] [2019-11-19 23:35:06,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-19 23:35:07,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774892927] [2019-11-19 23:35:07,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:35:07,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:35:07,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737169973] [2019-11-19 23:35:07,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:35:07,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:35:07,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:35:07,337 INFO L87 Difference]: Start difference. First operand 13677 states and 15247 transitions. Second operand 3 states. [2019-11-19 23:35:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:08,119 INFO L93 Difference]: Finished difference Result 25695 states and 28606 transitions. [2019-11-19 23:35:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:35:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 572 [2019-11-19 23:35:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:08,132 INFO L225 Difference]: With dead ends: 25695 [2019-11-19 23:35:08,133 INFO L226 Difference]: Without dead ends: 14048 [2019-11-19 23:35:08,139 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-19 23:35:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14048 states. [2019-11-19 23:35:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14048 to 13677. [2019-11-19 23:35:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-19 23:35:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15241 transitions. [2019-11-19 23:35:08,271 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15241 transitions. Word has length 572 [2019-11-19 23:35:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:08,272 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15241 transitions. [2019-11-19 23:35:08,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:35:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15241 transitions. [2019-11-19 23:35:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-11-19 23:35:08,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:08,289 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:35:08,289 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1592835932, now seen corresponding path program 1 times [2019-11-19 23:35:08,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:08,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141293341] [2019-11-19 23:35:08,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-19 23:35:08,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141293341] [2019-11-19 23:35:08,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:35:08,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:35:08,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464905621] [2019-11-19 23:35:08,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:35:08,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:08,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:35:08,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:35:08,959 INFO L87 Difference]: Start difference. First operand 13677 states and 15241 transitions. Second operand 4 states. [2019-11-19 23:35:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:10,116 INFO L93 Difference]: Finished difference Result 25692 states and 28583 transitions. [2019-11-19 23:35:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:35:10,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 573 [2019-11-19 23:35:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:10,126 INFO L225 Difference]: With dead ends: 25692 [2019-11-19 23:35:10,126 INFO L226 Difference]: Without dead ends: 14045 [2019-11-19 23:35:10,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:35:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14045 states. [2019-11-19 23:35:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14045 to 13677. [2019-11-19 23:35:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-11-19 23:35:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15235 transitions. [2019-11-19 23:35:10,250 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15235 transitions. Word has length 573 [2019-11-19 23:35:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:10,251 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15235 transitions. [2019-11-19 23:35:10,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:35:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15235 transitions. [2019-11-19 23:35:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-11-19 23:35:10,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:10,264 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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-19 23:35:10,265 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash -534851769, now seen corresponding path program 1 times [2019-11-19 23:35:10,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:10,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787536345] [2019-11-19 23:35:10,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1357 proven. 437 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-19 23:35:11,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787536345] [2019-11-19 23:35:11,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762915422] [2019-11-19 23:35:11,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/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-19 23:35:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:11,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:35:11,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:35:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:11,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1562 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-11-19 23:35:12,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:35:12,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-19 23:35:12,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778913842] [2019-11-19 23:35:12,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:35:12,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:35:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:35:12,411 INFO L87 Difference]: Start difference. First operand 13677 states and 15235 transitions. Second operand 3 states. [2019-11-19 23:35:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:13,318 INFO L93 Difference]: Finished difference Result 32138 states and 35832 transitions. [2019-11-19 23:35:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:35:13,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 774 [2019-11-19 23:35:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:13,436 INFO L225 Difference]: With dead ends: 32138 [2019-11-19 23:35:13,436 INFO L226 Difference]: Without dead ends: 18647 [2019-11-19 23:35:13,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 773 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:35:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2019-11-19 23:35:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 17726. [2019-11-19 23:35:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17726 states. [2019-11-19 23:35:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 19343 transitions. [2019-11-19 23:35:13,594 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 19343 transitions. Word has length 774 [2019-11-19 23:35:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:13,594 INFO L462 AbstractCegarLoop]: Abstraction has 17726 states and 19343 transitions. [2019-11-19 23:35:13,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:35:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 19343 transitions. [2019-11-19 23:35:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-11-19 23:35:13,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:13,615 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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-19 23:35:13,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:13,818 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:13,819 INFO L82 PathProgramCache]: Analyzing trace with hash -473048623, now seen corresponding path program 1 times [2019-11-19 23:35:13,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:13,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393503983] [2019-11-19 23:35:13,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1342 proven. 163 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2019-11-19 23:35:14,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393503983] [2019-11-19 23:35:14,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440710225] [2019-11-19 23:35:14,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:14,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:35:14,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:35:14,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:14,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1125 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:35:15,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:35:15,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-11-19 23:35:15,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453191466] [2019-11-19 23:35:15,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:35:15,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:35:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:35:15,231 INFO L87 Difference]: Start difference. First operand 17726 states and 19343 transitions. Second operand 4 states. [2019-11-19 23:35:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:18,459 INFO L93 Difference]: Finished difference Result 43930 states and 47957 transitions. [2019-11-19 23:35:18,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:35:18,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2019-11-19 23:35:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:18,478 INFO L225 Difference]: With dead ends: 43930 [2019-11-19 23:35:18,478 INFO L226 Difference]: Without dead ends: 26390 [2019-11-19 23:35:18,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 784 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:35:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26390 states. [2019-11-19 23:35:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26390 to 19204. [2019-11-19 23:35:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-19 23:35:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 20873 transitions. [2019-11-19 23:35:18,648 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 20873 transitions. Word has length 785 [2019-11-19 23:35:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:18,648 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 20873 transitions. [2019-11-19 23:35:18,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:35:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 20873 transitions. [2019-11-19 23:35:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-11-19 23:35:18,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:18,668 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-19 23:35:18,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:18,872 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1732636127, now seen corresponding path program 1 times [2019-11-19 23:35:18,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:18,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255030906] [2019-11-19 23:35:18,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1199 proven. 3 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:35:19,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255030906] [2019-11-19 23:35:19,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594705999] [2019-11-19 23:35:19,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:19,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:35:19,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:35:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1202 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:35:20,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:35:20,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-19 23:35:20,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633188706] [2019-11-19 23:35:20,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:35:20,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:35:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:35:20,278 INFO L87 Difference]: Start difference. First operand 19204 states and 20873 transitions. Second operand 4 states. [2019-11-19 23:35:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:21,345 INFO L93 Difference]: Finished difference Result 37306 states and 40503 transitions. [2019-11-19 23:35:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:35:21,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 819 [2019-11-19 23:35:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:21,358 INFO L225 Difference]: With dead ends: 37306 [2019-11-19 23:35:21,359 INFO L226 Difference]: Without dead ends: 20316 [2019-11-19 23:35:21,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:35:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20316 states. [2019-11-19 23:35:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20316 to 17548. [2019-11-19 23:35:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-11-19 23:35:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 19055 transitions. [2019-11-19 23:35:21,500 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 19055 transitions. Word has length 819 [2019-11-19 23:35:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:21,501 INFO L462 AbstractCegarLoop]: Abstraction has 17548 states and 19055 transitions. [2019-11-19 23:35:21,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:35:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 19055 transitions. [2019-11-19 23:35:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2019-11-19 23:35:21,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:21,514 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:35:21,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:21,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -972459443, now seen corresponding path program 1 times [2019-11-19 23:35:21,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:35:21,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499993611] [2019-11-19 23:35:21,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:35:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1554 proven. 82 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2019-11-19 23:35:22,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499993611] [2019-11-19 23:35:22,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251293568] [2019-11-19 23:35:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:35:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:35:22,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:35:22,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:35:22,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:24,830 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-11-19 23:35:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-19 23:35:26,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:35:26,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:35:26,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737131466] [2019-11-19 23:35:26,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:35:26,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:35:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:35:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:35:26,706 INFO L87 Difference]: Start difference. First operand 17548 states and 19055 transitions. Second operand 4 states. [2019-11-19 23:36:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:32,250 INFO L93 Difference]: Finished difference Result 39647 states and 42803 transitions. [2019-11-19 23:36:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:32,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 852 [2019-11-19 23:36:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:32,266 INFO L225 Difference]: With dead ends: 39647 [2019-11-19 23:36:32,266 INFO L226 Difference]: Without dead ends: 24313 [2019-11-19 23:36:32,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 851 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24313 states. [2019-11-19 23:36:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24313 to 19958. [2019-11-19 23:36:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19958 states. [2019-11-19 23:36:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 21614 transitions. [2019-11-19 23:36:32,499 INFO L78 Accepts]: Start accepts. Automaton has 19958 states and 21614 transitions. Word has length 852 [2019-11-19 23:36:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:32,500 INFO L462 AbstractCegarLoop]: Abstraction has 19958 states and 21614 transitions. [2019-11-19 23:36:32,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 19958 states and 21614 transitions. [2019-11-19 23:36:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-11-19 23:36:32,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:32,519 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-19 23:36:32,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:36:32,719 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1305893410, now seen corresponding path program 1 times [2019-11-19 23:36:32,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539416200] [2019-11-19 23:36:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2973 backedges. 1715 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-11-19 23:36:33,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539416200] [2019-11-19 23:36:33,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:33,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:33,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365789101] [2019-11-19 23:36:33,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:33,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:33,261 INFO L87 Difference]: Start difference. First operand 19958 states and 21614 transitions. Second operand 4 states. [2019-11-19 23:36:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:34,437 INFO L93 Difference]: Finished difference Result 42876 states and 46380 transitions. [2019-11-19 23:36:34,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:34,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 868 [2019-11-19 23:36:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:34,460 INFO L225 Difference]: With dead ends: 42876 [2019-11-19 23:36:34,460 INFO L226 Difference]: Without dead ends: 22919 [2019-11-19 23:36:34,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22919 states. [2019-11-19 23:36:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22919 to 17949. [2019-11-19 23:36:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17949 states. [2019-11-19 23:36:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17949 states to 17949 states and 19318 transitions. [2019-11-19 23:36:34,624 INFO L78 Accepts]: Start accepts. Automaton has 17949 states and 19318 transitions. Word has length 868 [2019-11-19 23:36:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:34,625 INFO L462 AbstractCegarLoop]: Abstraction has 17949 states and 19318 transitions. [2019-11-19 23:36:34,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17949 states and 19318 transitions. [2019-11-19 23:36:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2019-11-19 23:36:34,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:34,639 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 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] [2019-11-19 23:36:34,640 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash -975481696, now seen corresponding path program 1 times [2019-11-19 23:36:34,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:34,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105215752] [2019-11-19 23:36:34,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 2021 proven. 179 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-19 23:36:35,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105215752] [2019-11-19 23:36:35,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554572721] [2019-11-19 23:36:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:36:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:35,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 23:36:35,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:36:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 1869 proven. 312 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-19 23:36:37,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:36:37,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-19 23:36:37,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001127153] [2019-11-19 23:36:37,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:36:37,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:36:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:36:37,444 INFO L87 Difference]: Start difference. First operand 17949 states and 19318 transitions. Second operand 11 states. [2019-11-19 23:36:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:47,526 INFO L93 Difference]: Finished difference Result 40766 states and 44009 transitions. [2019-11-19 23:36:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-19 23:36:47,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 885 [2019-11-19 23:36:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:47,540 INFO L225 Difference]: With dead ends: 40766 [2019-11-19 23:36:47,540 INFO L226 Difference]: Without dead ends: 21714 [2019-11-19 23:36:47,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 897 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-11-19 23:36:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21714 states. [2019-11-19 23:36:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21714 to 12385. [2019-11-19 23:36:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12385 states. [2019-11-19 23:36:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12385 states to 12385 states and 13159 transitions. [2019-11-19 23:36:47,674 INFO L78 Accepts]: Start accepts. Automaton has 12385 states and 13159 transitions. Word has length 885 [2019-11-19 23:36:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:47,675 INFO L462 AbstractCegarLoop]: Abstraction has 12385 states and 13159 transitions. [2019-11-19 23:36:47,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:36:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 12385 states and 13159 transitions. [2019-11-19 23:36:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2019-11-19 23:36:47,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:47,685 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:36:47,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:36:47,888 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1141570522, now seen corresponding path program 1 times [2019-11-19 23:36:47,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:47,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043475752] [2019-11-19 23:36:47,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 2025 proven. 0 refuted. 0 times theorem prover too weak. 1049 trivial. 0 not checked. [2019-11-19 23:36:48,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043475752] [2019-11-19 23:36:48,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:48,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:48,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003980035] [2019-11-19 23:36:48,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:48,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:48,615 INFO L87 Difference]: Start difference. First operand 12385 states and 13159 transitions. Second operand 3 states. [2019-11-19 23:36:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:49,310 INFO L93 Difference]: Finished difference Result 24028 states and 25547 transitions. [2019-11-19 23:36:49,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:49,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 931 [2019-11-19 23:36:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:49,320 INFO L225 Difference]: With dead ends: 24028 [2019-11-19 23:36:49,320 INFO L226 Difference]: Without dead ends: 11645 [2019-11-19 23:36:49,326 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-19 23:36:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11645 states. [2019-11-19 23:36:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11645 to 9801. [2019-11-19 23:36:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9801 states. [2019-11-19 23:36:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9801 states to 9801 states and 10363 transitions. [2019-11-19 23:36:49,408 INFO L78 Accepts]: Start accepts. Automaton has 9801 states and 10363 transitions. Word has length 931 [2019-11-19 23:36:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:49,409 INFO L462 AbstractCegarLoop]: Abstraction has 9801 states and 10363 transitions. [2019-11-19 23:36:49,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 9801 states and 10363 transitions. [2019-11-19 23:36:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-11-19 23:36:49,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:49,418 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:36:49,418 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1635298975, now seen corresponding path program 1 times [2019-11-19 23:36:49,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:49,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231711807] [2019-11-19 23:36:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3156 backedges. 1319 proven. 0 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2019-11-19 23:36:50,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231711807] [2019-11-19 23:36:50,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:50,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:36:50,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206729819] [2019-11-19 23:36:50,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:50,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:50,415 INFO L87 Difference]: Start difference. First operand 9801 states and 10363 transitions. Second operand 3 states. [2019-11-19 23:36:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:50,762 INFO L93 Difference]: Finished difference Result 18486 states and 19554 transitions. [2019-11-19 23:36:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:50,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 970 [2019-11-19 23:36:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:50,768 INFO L225 Difference]: With dead ends: 18486 [2019-11-19 23:36:50,768 INFO L226 Difference]: Without dead ends: 9424 [2019-11-19 23:36:50,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 23:36:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9424 states. [2019-11-19 23:36:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9424 to 9422. [2019-11-19 23:36:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9422 states. [2019-11-19 23:36:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9422 states to 9422 states and 9952 transitions. [2019-11-19 23:36:50,844 INFO L78 Accepts]: Start accepts. Automaton has 9422 states and 9952 transitions. Word has length 970 [2019-11-19 23:36:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:50,845 INFO L462 AbstractCegarLoop]: Abstraction has 9422 states and 9952 transitions. [2019-11-19 23:36:50,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9422 states and 9952 transitions. [2019-11-19 23:36:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2019-11-19 23:36:50,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:50,854 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2019-11-19 23:36:50,855 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -875898049, now seen corresponding path program 1 times [2019-11-19 23:36:50,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:50,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058627501] [2019-11-19 23:36:50,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 1813 proven. 249 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:36:52,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058627501] [2019-11-19 23:36:52,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393761643] [2019-11-19 23:36:52,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:36:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 23:36:52,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:36:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:36:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:52,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:36:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 1813 proven. 249 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:36:54,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:36:54,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-19 23:36:54,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422386467] [2019-11-19 23:36:54,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 23:36:54,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:36:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:36:54,939 INFO L87 Difference]: Start difference. First operand 9422 states and 9952 transitions. Second operand 13 states. [2019-11-19 23:36:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:58,398 INFO L93 Difference]: Finished difference Result 19880 states and 20973 transitions. [2019-11-19 23:36:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 23:36:58,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 992 [2019-11-19 23:36:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:58,407 INFO L225 Difference]: With dead ends: 19880 [2019-11-19 23:36:58,407 INFO L226 Difference]: Without dead ends: 11197 [2019-11-19 23:36:58,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 989 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2019-11-19 23:36:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11197 states. [2019-11-19 23:36:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11197 to 9050. [2019-11-19 23:36:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9050 states. [2019-11-19 23:36:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9050 states to 9050 states and 9556 transitions. [2019-11-19 23:36:58,507 INFO L78 Accepts]: Start accepts. Automaton has 9050 states and 9556 transitions. Word has length 992 [2019-11-19 23:36:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:58,508 INFO L462 AbstractCegarLoop]: Abstraction has 9050 states and 9556 transitions. [2019-11-19 23:36:58,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 23:36:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 9050 states and 9556 transitions. [2019-11-19 23:36:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2019-11-19 23:36:58,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:58,522 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 23:36:58,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:36:58,725 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1435520139, now seen corresponding path program 1 times [2019-11-19 23:36:58,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:58,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576243779] [2019-11-19 23:36:58,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2540 proven. 0 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2019-11-19 23:36:59,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576243779] [2019-11-19 23:36:59,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:59,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:59,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689328245] [2019-11-19 23:36:59,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:59,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:59,644 INFO L87 Difference]: Start difference. First operand 9050 states and 9556 transitions. Second operand 3 states. [2019-11-19 23:37:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:00,189 INFO L93 Difference]: Finished difference Result 17731 states and 18726 transitions. [2019-11-19 23:37:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:00,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1021 [2019-11-19 23:37:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:00,195 INFO L225 Difference]: With dead ends: 17731 [2019-11-19 23:37:00,196 INFO L226 Difference]: Without dead ends: 9421 [2019-11-19 23:37:00,198 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-19 23:37:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9421 states. [2019-11-19 23:37:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9421 to 8498. [2019-11-19 23:37:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8498 states. [2019-11-19 23:37:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8498 states to 8498 states and 8966 transitions. [2019-11-19 23:37:00,263 INFO L78 Accepts]: Start accepts. Automaton has 8498 states and 8966 transitions. Word has length 1021 [2019-11-19 23:37:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:00,263 INFO L462 AbstractCegarLoop]: Abstraction has 8498 states and 8966 transitions. [2019-11-19 23:37:00,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8498 states and 8966 transitions. [2019-11-19 23:37:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-11-19 23:37:00,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:00,272 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:00,273 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:00,273 INFO L82 PathProgramCache]: Analyzing trace with hash -896726607, now seen corresponding path program 1 times [2019-11-19 23:37:00,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:00,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183503659] [2019-11-19 23:37:00,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3310 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 23:37:01,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183503659] [2019-11-19 23:37:01,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:01,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:37:01,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713052831] [2019-11-19 23:37:01,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:37:01,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:01,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:37:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:01,930 INFO L87 Difference]: Start difference. First operand 8498 states and 8966 transitions. Second operand 7 states. [2019-11-19 23:37:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:03,833 INFO L93 Difference]: Finished difference Result 18281 states and 19290 transitions. [2019-11-19 23:37:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:37:03,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1036 [2019-11-19 23:37:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:03,839 INFO L225 Difference]: With dead ends: 18281 [2019-11-19 23:37:03,840 INFO L226 Difference]: Without dead ends: 10707 [2019-11-19 23:37:03,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10707 states. [2019-11-19 23:37:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10707 to 9234. [2019-11-19 23:37:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-11-19 23:37:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 9744 transitions. [2019-11-19 23:37:03,916 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 9744 transitions. Word has length 1036 [2019-11-19 23:37:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:03,917 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 9744 transitions. [2019-11-19 23:37:03,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:37:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 9744 transitions. [2019-11-19 23:37:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-11-19 23:37:03,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:03,926 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 23:37:03,926 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1488105761, now seen corresponding path program 1 times [2019-11-19 23:37:03,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:03,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220532462] [2019-11-19 23:37:03,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4066 backedges. 2776 proven. 0 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2019-11-19 23:37:04,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220532462] [2019-11-19 23:37:04,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:04,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377954677] [2019-11-19 23:37:04,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:04,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:04,860 INFO L87 Difference]: Start difference. First operand 9234 states and 9744 transitions. Second operand 5 states. [2019-11-19 23:37:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:06,067 INFO L93 Difference]: Finished difference Result 20126 states and 21277 transitions. [2019-11-19 23:37:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:37:06,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1046 [2019-11-19 23:37:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:06,074 INFO L225 Difference]: With dead ends: 20126 [2019-11-19 23:37:06,074 INFO L226 Difference]: Without dead ends: 11816 [2019-11-19 23:37:06,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2019-11-19 23:37:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 10710. [2019-11-19 23:37:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10710 states. [2019-11-19 23:37:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10710 states to 10710 states and 11296 transitions. [2019-11-19 23:37:06,164 INFO L78 Accepts]: Start accepts. Automaton has 10710 states and 11296 transitions. Word has length 1046 [2019-11-19 23:37:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:06,164 INFO L462 AbstractCegarLoop]: Abstraction has 10710 states and 11296 transitions. [2019-11-19 23:37:06,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10710 states and 11296 transitions. [2019-11-19 23:37:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2019-11-19 23:37:06,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:06,174 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:06,175 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1700393044, now seen corresponding path program 1 times [2019-11-19 23:37:06,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:06,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254298095] [2019-11-19 23:37:06,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3334 backedges. 2417 proven. 0 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-11-19 23:37:07,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254298095] [2019-11-19 23:37:07,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:07,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:07,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412772175] [2019-11-19 23:37:07,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:07,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:07,119 INFO L87 Difference]: Start difference. First operand 10710 states and 11296 transitions. Second operand 5 states. [2019-11-19 23:37:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:08,152 INFO L93 Difference]: Finished difference Result 18277 states and 19270 transitions. [2019-11-19 23:37:08,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:37:08,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1053 [2019-11-19 23:37:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:08,153 INFO L225 Difference]: With dead ends: 18277 [2019-11-19 23:37:08,153 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:37:08,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 23:37:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:37:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:37:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:37:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:37:08,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1053 [2019-11-19 23:37:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:08,158 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:37:08,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:37:08,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:37:08,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:37:09,901 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 957 DAG size of output: 768 [2019-11-19 23:37:10,959 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 951 DAG size of output: 766 [2019-11-19 23:37:17,476 WARN L191 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 709 DAG size of output: 173 [2019-11-19 23:37:24,065 WARN L191 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 709 DAG size of output: 173 [2019-11-19 23:37:24,067 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,068 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,069 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-19 23:37:24,070 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-19 23:37:24,070 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-19 23:37:24,070 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,070 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse28 (= 10 ~a25~0)) (.cse13 (<= ~a29~0 140)) (.cse34 (+ ~a23~0 43)) (.cse18 (= 12 ~a25~0)) (.cse33 (= ~a4~0 1))) (let ((.cse12 (not .cse33)) (.cse5 (not .cse18)) (.cse22 (<= .cse34 0)) (.cse10 (<= 130 ~a29~0)) (.cse8 (< 138 ~a23~0)) (.cse24 (= ~a25~0 13)) (.cse31 (<= ~a23~0 312)) (.cse9 (<= 0 (+ ~a23~0 21))) (.cse11 (and .cse28 .cse13)) (.cse7 (= 1 ~a4~0))) (let ((.cse1 (or (and (and .cse8 .cse13) .cse31 (not .cse24) .cse7) (and .cse13 .cse31 .cse18 .cse9 .cse7) (and .cse31 .cse9 .cse11 .cse7))) (.cse16 (<= ~a4~0 0)) (.cse25 (<= ~a23~0 306)) (.cse26 (<= ~a29~0 220)) (.cse4 (<= ~a29~0 161)) (.cse27 (and (and (and .cse5 .cse22) .cse7) .cse10)) (.cse29 (<= 141 ~a29~0)) (.cse19 (<= ~a29~0 277)) (.cse15 (= ~a25~0 9)) (.cse20 (and .cse12 .cse22)) (.cse21 (<= ~a29~0 274)) (.cse32 (< 140 ~a29~0)) (.cse14 (<= (+ ~a23~0 55) 0)) (.cse3 (<= ~a23~0 600000)) (.cse6 (= ~a25~0 11)) (.cse30 (<= ~a25~0 9)) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (not .cse6) .cse0 .cse2 .cse7 (or .cse8 (and .cse9 .cse10))) (and (and .cse0 .cse2 (or .cse11 (and (and .cse12 .cse13) .cse6))) (<= 0 (+ ~a29~0 28553)) .cse14) (and .cse15 .cse1) (let ((.cse17 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0))))) (or (and .cse0 (and .cse16 .cse17 (and .cse18 .cse19)) .cse2) (and .cse18 .cse0 .cse20 .cse21 .cse17 .cse2) (and .cse0 .cse15 .cse2 .cse22 (exists ((v_~a29~0_508 Int)) (let ((.cse23 (mod v_~a29~0_508 299861))) (and (<= (+ .cse23 10250) ~a29~0) (< 140 v_~a29~0_508) (= 0 .cse23))))))) (and .cse18 .cse16 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse14 .cse2 .cse13) (and .cse24 .cse25 .cse26 .cse7 .cse10 .cse8) (and .cse27 .cse6) (and .cse3 .cse0 .cse28 .cse2 .cse7) (and .cse3 (and .cse0 (and (and .cse24 (<= ~a29~0 245) .cse7) .cse29) .cse2)) (and .cse27 .cse30) (and .cse24 .cse0 .cse25 .cse2 (and .cse8 .cse7)) (and .cse31 .cse18 .cse0 .cse2 .cse7 .cse8) (and .cse3 .cse15 .cse32 .cse0 .cse33 .cse2) (and .cse24 .cse0 .cse27 .cse2 .cse26) (and (and .cse28 .cse22) .cse7) (and (and .cse0 (and .cse4 (or (and .cse15 (and .cse13 .cse12)) .cse27)) .cse2) .cse14) (and .cse3 (and (and (or (and .cse18 .cse8) .cse6) .cse0 .cse2 .cse29) .cse33 .cse19)) (and .cse0 .cse2 (and (and .cse31 (< 0 .cse34)) .cse15 .cse7)) (and .cse3 .cse24 .cse0 (<= ~a29~0 599998) .cse2 .cse7 .cse8) (and (and .cse0 .cse2 (and .cse18 .cse20 .cse21)) .cse32 .cse14) (and .cse3 (or (and (and .cse7 .cse6) .cse0 .cse2 (< 277 ~a29~0)) (and (and .cse30 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse8)) .cse0 .cse2 .cse7))))))) [2019-11-19 23:37:24,070 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-19 23:37:24,071 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-19 23:37:24,072 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,073 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,074 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-19 23:37:24,075 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,076 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-19 23:37:24,077 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-19 23:37:24,078 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-19 23:37:24,079 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 23:37:24,080 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-19 23:37:24,080 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-19 23:37:24,080 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,083 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-19 23:37:24,084 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-19 23:37:24,085 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,086 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-19 23:37:24,087 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,088 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,089 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-19 23:37:24,090 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,091 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,092 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:37:24,093 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-19 23:37:24,094 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,095 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,096 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,097 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,097 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse28 (= 10 ~a25~0)) (.cse13 (<= ~a29~0 140)) (.cse34 (+ ~a23~0 43)) (.cse18 (= 12 ~a25~0)) (.cse33 (= ~a4~0 1))) (let ((.cse12 (not .cse33)) (.cse5 (not .cse18)) (.cse22 (<= .cse34 0)) (.cse10 (<= 130 ~a29~0)) (.cse8 (< 138 ~a23~0)) (.cse24 (= ~a25~0 13)) (.cse31 (<= ~a23~0 312)) (.cse9 (<= 0 (+ ~a23~0 21))) (.cse11 (and .cse28 .cse13)) (.cse7 (= 1 ~a4~0))) (let ((.cse1 (or (and (and .cse8 .cse13) .cse31 (not .cse24) .cse7) (and .cse13 .cse31 .cse18 .cse9 .cse7) (and .cse31 .cse9 .cse11 .cse7))) (.cse16 (<= ~a4~0 0)) (.cse25 (<= ~a23~0 306)) (.cse26 (<= ~a29~0 220)) (.cse4 (<= ~a29~0 161)) (.cse27 (and (and (and .cse5 .cse22) .cse7) .cse10)) (.cse29 (<= 141 ~a29~0)) (.cse19 (<= ~a29~0 277)) (.cse15 (= ~a25~0 9)) (.cse20 (and .cse12 .cse22)) (.cse21 (<= ~a29~0 274)) (.cse32 (< 140 ~a29~0)) (.cse14 (<= (+ ~a23~0 55) 0)) (.cse3 (<= ~a23~0 600000)) (.cse6 (= ~a25~0 11)) (.cse30 (<= ~a25~0 9)) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (not .cse6) .cse0 .cse2 .cse7 (or .cse8 (and .cse9 .cse10))) (and (and .cse0 .cse2 (or .cse11 (and (and .cse12 .cse13) .cse6))) (<= 0 (+ ~a29~0 28553)) .cse14) (and .cse15 .cse1) (let ((.cse17 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0))))) (or (and .cse0 (and .cse16 .cse17 (and .cse18 .cse19)) .cse2) (and .cse18 .cse0 .cse20 .cse21 .cse17 .cse2) (and .cse0 .cse15 .cse2 .cse22 (exists ((v_~a29~0_508 Int)) (let ((.cse23 (mod v_~a29~0_508 299861))) (and (<= (+ .cse23 10250) ~a29~0) (< 140 v_~a29~0_508) (= 0 .cse23))))))) (and .cse18 .cse16 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse14 .cse2 .cse13) (and .cse24 .cse25 .cse26 .cse7 .cse10 .cse8) (and .cse27 .cse6) (and .cse3 .cse0 .cse28 .cse2 .cse7) (and .cse3 (and .cse0 (and (and .cse24 (<= ~a29~0 245) .cse7) .cse29) .cse2)) (and .cse27 .cse30) (and .cse24 .cse0 .cse25 .cse2 (and .cse8 .cse7)) (and .cse31 .cse18 .cse0 .cse2 .cse7 .cse8) (and .cse3 .cse15 .cse32 .cse0 .cse33 .cse2) (and .cse24 .cse0 .cse27 .cse2 .cse26) (and (and .cse28 .cse22) .cse7) (and (and .cse0 (and .cse4 (or (and .cse15 (and .cse13 .cse12)) .cse27)) .cse2) .cse14) (and .cse3 (and (and (or (and .cse18 .cse8) .cse6) .cse0 .cse2 .cse29) .cse33 .cse19)) (and .cse0 .cse2 (and (and .cse31 (< 0 .cse34)) .cse15 .cse7)) (and .cse3 .cse24 .cse0 (<= ~a29~0 599998) .cse2 .cse7 .cse8) (and (and .cse0 .cse2 (and .cse18 .cse20 .cse21)) .cse32 .cse14) (and .cse3 (or (and (and .cse7 .cse6) .cse0 .cse2 (< 277 ~a29~0)) (and (and .cse30 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse8)) .cse0 .cse2 .cse7))))))) [2019-11-19 23:37:24,097 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,098 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 23:37:24,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:37:24 BoogieIcfgContainer [2019-11-19 23:37:24,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:37:24,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:37:24,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:37:24,155 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:37:24,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:34" (3/4) ... [2019-11-19 23:37:24,158 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:37:24,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 23:37:24,185 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:37:24,211 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == a3 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) && 15 == a8) || (((((((a23 <= 600000 && a29 <= 161) && !(12 == a25)) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && (138 < a23 || (0 <= a23 + 21 && 130 <= a29)))) || ((((1 == a3 && 15 == a8) && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11))) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)))) || (((1 == a3 && (a4 <= 0 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 12 == a25 && a29 <= 277) && 15 == a8) || (((((12 == a25 && 1 == a3) && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 15 == a8)) || ((((1 == a3 && a25 == 9) && 15 == a8) && a23 + 43 <= 0) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 % 299861 + 10250 <= a29 && 140 < v_~a29~0_508) && 0 == v_~a29~0_508 % 299861))) || ((((((12 == a25 && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 == 11)) || ((((a23 <= 600000 && 1 == a3) && 10 == a25) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && (1 == a3 && ((a25 == 13 && a29 <= 245) && 1 == a4) && 141 <= a29) && 15 == a8)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 <= 9)) || ((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 138 < a23 && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a23 <= 600000 && a25 == 9) && 140 < a29) && 1 == a3) && a4 == 1) && 15 == a8)) || ((((a25 == 13 && 1 == a3) && ((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && 15 == a8) && a29 <= 220)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (((1 == a3 && a29 <= 161 && ((a25 == 9 && a29 <= 140 && !(a4 == 1)) || (((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29))) && 15 == a8) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((((12 == a25 && 138 < a23) || a25 == 11) && 1 == a3) && 15 == a8) && 141 <= a29) && a4 == 1) && a29 <= 277)) || ((1 == a3 && 15 == a8) && ((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a4)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && (12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((((1 == a4 && a25 == 11) && 1 == a3) && 15 == a8) && 277 < a29) || ((((a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a3) && 15 == a8) && 1 == a4))) [2019-11-19 23:37:24,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 == a3 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) && 15 == a8) || (((((((a23 <= 600000 && a29 <= 161) && !(12 == a25)) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && (138 < a23 || (0 <= a23 + 21 && 130 <= a29)))) || ((((1 == a3 && 15 == a8) && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11))) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)))) || (((1 == a3 && (a4 <= 0 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 12 == a25 && a29 <= 277) && 15 == a8) || (((((12 == a25 && 1 == a3) && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 15 == a8)) || ((((1 == a3 && a25 == 9) && 15 == a8) && a23 + 43 <= 0) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 % 299861 + 10250 <= a29 && 140 < v_~a29~0_508) && 0 == v_~a29~0_508 % 299861))) || ((((((12 == a25 && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 == 11)) || ((((a23 <= 600000 && 1 == a3) && 10 == a25) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && (1 == a3 && ((a25 == 13 && a29 <= 245) && 1 == a4) && 141 <= a29) && 15 == a8)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 <= 9)) || ((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 138 < a23 && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a23 <= 600000 && a25 == 9) && 140 < a29) && 1 == a3) && a4 == 1) && 15 == a8)) || ((((a25 == 13 && 1 == a3) && ((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && 15 == a8) && a29 <= 220)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (((1 == a3 && a29 <= 161 && ((a25 == 9 && a29 <= 140 && !(a4 == 1)) || (((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29))) && 15 == a8) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((((12 == a25 && 138 < a23) || a25 == 11) && 1 == a3) && 15 == a8) && 141 <= a29) && a4 == 1) && a29 <= 277)) || ((1 == a3 && 15 == a8) && ((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a4)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && (12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((((1 == a4 && a25 == 11) && 1 == a3) && 15 == a8) && 277 < a29) || ((((a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a3) && 15 == a8) && 1 == a4))) [2019-11-19 23:37:24,318 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd4dbac7-135e-4d5c-aab8-d1401d0836f7/bin/uautomizer/witness.graphml [2019-11-19 23:37:24,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:37:24,319 INFO L168 Benchmark]: Toolchain (without parser) took 172590.96 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 939.4 MB in the beginning and 1.5 GB in the end (delta: -513.6 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,320 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:37:24,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 958.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.59 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,321 INFO L168 Benchmark]: Boogie Preprocessor took 90.31 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,321 INFO L168 Benchmark]: RCFGBuilder took 1801.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.9 MB in the end (delta: 176.6 MB). Peak memory consumption was 176.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,321 INFO L168 Benchmark]: TraceAbstraction took 169429.41 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 919.9 MB in the beginning and 1.6 GB in the end (delta: -632.3 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,322 INFO L168 Benchmark]: Witness Printer took 163.76 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:37:24,323 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 958.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.59 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.31 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1801.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.9 MB in the end (delta: 176.6 MB). Peak memory consumption was 176.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 169429.41 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 919.9 MB in the beginning and 1.6 GB in the end (delta: -632.3 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 163.76 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 168]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-19 23:37:24,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((1 == a3 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) && 15 == a8) || (((((((a23 <= 600000 && a29 <= 161) && !(12 == a25)) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && (138 < a23 || (0 <= a23 + 21 && 130 <= a29)))) || ((((1 == a3 && 15 == a8) && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11))) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)))) || (((1 == a3 && (a4 <= 0 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 12 == a25 && a29 <= 277) && 15 == a8) || (((((12 == a25 && 1 == a3) && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 15 == a8)) || ((((1 == a3 && a25 == 9) && 15 == a8) && a23 + 43 <= 0) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 % 299861 + 10250 <= a29 && 140 < v_~a29~0_508) && 0 == v_~a29~0_508 % 299861))) || ((((((12 == a25 && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 == 11)) || ((((a23 <= 600000 && 1 == a3) && 10 == a25) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && (1 == a3 && ((a25 == 13 && a29 <= 245) && 1 == a4) && 141 <= a29) && 15 == a8)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 <= 9)) || ((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 138 < a23 && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a23 <= 600000 && a25 == 9) && 140 < a29) && 1 == a3) && a4 == 1) && 15 == a8)) || ((((a25 == 13 && 1 == a3) && ((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && 15 == a8) && a29 <= 220)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (((1 == a3 && a29 <= 161 && ((a25 == 9 && a29 <= 140 && !(a4 == 1)) || (((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29))) && 15 == a8) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((((12 == a25 && 138 < a23) || a25 == 11) && 1 == a3) && 15 == a8) && 141 <= a29) && a4 == 1) && a29 <= 277)) || ((1 == a3 && 15 == a8) && ((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a4)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && (12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((((1 == a4 && a25 == 11) && 1 == a3) && 15 == a8) && 277 < a29) || ((((a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a3) && 15 == a8) && 1 == a4))) - InvariantResult [Line: 22]: Loop Invariant [2019-11-19 23:37:24,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-19 23:37:24,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-19 23:37:24,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-19 23:37:24,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((1 == a3 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4))) && 15 == a8) || (((((((a23 <= 600000 && a29 <= 161) && !(12 == a25)) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && (138 < a23 || (0 <= a23 + 21 && 130 <= a29)))) || ((((1 == a3 && 15 == a8) && ((10 == a25 && a29 <= 140) || ((!(a4 == 1) && a29 <= 140) && a25 == 11))) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (a25 == 9 && ((((((138 < a23 && a29 <= 140) && a23 <= 312) && !(a25 == 13)) && 1 == a4) || ((((a29 <= 140 && a23 <= 312) && 12 == a25) && 0 <= a23 + 21) && 1 == a4)) || (((a23 <= 312 && 0 <= a23 + 21) && 10 == a25 && a29 <= 140) && 1 == a4)))) || (((1 == a3 && (a4 <= 0 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 12 == a25 && a29 <= 277) && 15 == a8) || (((((12 == a25 && 1 == a3) && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 15 == a8)) || ((((1 == a3 && a25 == 9) && 15 == a8) && a23 + 43 <= 0) && (\exists v_~a29~0_508 : int :: (v_~a29~0_508 % 299861 + 10250 <= a29 && 140 < v_~a29~0_508) && 0 == v_~a29~0_508 % 299861))) || ((((((12 == a25 && a4 <= 0) && !(3 == input)) && 1 == a3) && a23 + 55 <= 0) && 15 == a8) && a29 <= 140)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 == 11)) || ((((a23 <= 600000 && 1 == a3) && 10 == a25) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && (1 == a3 && ((a25 == 13 && a29 <= 245) && 1 == a4) && 141 <= a29) && 15 == a8)) || ((((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && a25 <= 9)) || ((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 138 < a23 && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a23 <= 600000 && a25 == 9) && 140 < a29) && 1 == a3) && a4 == 1) && 15 == a8)) || ((((a25 == 13 && 1 == a3) && ((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29) && 15 == a8) && a29 <= 220)) || ((10 == a25 && a23 + 43 <= 0) && 1 == a4)) || (((1 == a3 && a29 <= 161 && ((a25 == 9 && a29 <= 140 && !(a4 == 1)) || (((!(12 == a25) && a23 + 43 <= 0) && 1 == a4) && 130 <= a29))) && 15 == a8) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((((12 == a25 && 138 < a23) || a25 == 11) && 1 == a3) && 15 == a8) && 141 <= a29) && a4 == 1) && a29 <= 277)) || ((1 == a3 && 15 == a8) && ((a23 <= 312 && 0 < a23 + 43) && a25 == 9) && 1 == a4)) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && (12 == a25 && !(a4 == 1) && a23 + 43 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && (((((1 == a4 && a25 == 11) && 1 == a3) && 15 == a8) && 277 < a29) || ((((a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a3) && 15 == a8) && 1 == a4))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 169.3s, OverallIterations: 26, TraceHistogramMax: 10, AutomataDifference: 117.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.9s, HoareTripleCheckerStatistics: 3643 SDtfs, 14612 SDslu, 1195 SDs, 0 SdLazy, 35029 SolverSat, 4863 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 106.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6166 GetRequests, 6017 SyntacticMatches, 12 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19958occurred 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: 3.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 54652 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 122 NumberOfFragments, 1497 HoareAnnotationTreeSize, 3 FomulaSimplifications, 644011 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 404088 FormulaSimplificationTreeSizeReductionInter, 13.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 22510 NumberOfCodeBlocks, 22510 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 22476 ConstructedInterpolants, 714 QuantifiedInterpolants, 59660647 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7741 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 60716/63193 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...