./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.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_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:42,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:46:42,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:46:42,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:46:42,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:46:42,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:46:42,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:46:42,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:46:42,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:46:42,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:46:42,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:46:42,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:46:42,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:46:42,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:46:42,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:46:42,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:46:42,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:46:42,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:46:42,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:46:42,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:46:42,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:46:42,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:46:42,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:46:42,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:46:42,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:46:42,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:46:42,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:46:42,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:46:42,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:46:42,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:46:42,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:46:42,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:46:42,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:46:42,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:46:42,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:46:42,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:46:42,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:46:42,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:46:42,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:46:42,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:46:42,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:46:42,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:46:42,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:46:42,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:46:42,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:46:42,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:46:42,866 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:46:42,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:46:42,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:46:42,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:46:42,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:46:42,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:46:42,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:46:42,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:46:42,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:46:42,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:46:42,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:46:42,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:46:42,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:46:42,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:46:42,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:46:42,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:46:42,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:46:42,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:46:42,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:46:42,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:46:42,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:46:42,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:46:42,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:46:42,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:46:42,873 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_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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 -> 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 [2019-11-19 23:46:43,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:46:43,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:46:43,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:46:43,117 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:46:43,117 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:46:43,118 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-11-19 23:46:43,185 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/data/a35af4c03/92ba943c4c284350b7d3af801cc25314/FLAGce02368b2 [2019-11-19 23:46:43,756 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:46:43,757 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-11-19 23:46:43,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/data/a35af4c03/92ba943c4c284350b7d3af801cc25314/FLAGce02368b2 [2019-11-19 23:46:43,985 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/data/a35af4c03/92ba943c4c284350b7d3af801cc25314 [2019-11-19 23:46:43,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:46:43,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:46:43,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:46:43,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:46:44,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:46:44,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:46:43" (1/1) ... [2019-11-19 23:46:44,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e8c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:44, skipping insertion in model container [2019-11-19 23:46:44,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:46:43" (1/1) ... [2019-11-19 23:46:44,018 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:46:44,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:46:44,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:46:44,931 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:46:45,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:46:45,542 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:46:45,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45 WrapperNode [2019-11-19 23:46:45,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:46:45,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:46:45,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:46:45,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:46:45,553 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:46:45" (1/1) ... [2019-11-19 23:46:45,598 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:46:45" (1/1) ... [2019-11-19 23:46:45,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:46:45,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:46:45,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:46:45,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:46:45,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... [2019-11-19 23:46:45,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:46:45,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:46:45,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:46:45,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:46:45,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:46:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:46:46,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:46:50,127 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:46:50,127 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 23:46:50,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:46:50 BoogieIcfgContainer [2019-11-19 23:46:50,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:46:50,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:46:50,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:46:50,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:46:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:46:43" (1/3) ... [2019-11-19 23:46:50,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d22dc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:46:50, skipping insertion in model container [2019-11-19 23:46:50,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:46:45" (2/3) ... [2019-11-19 23:46:50,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d22dc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:46:50, skipping insertion in model container [2019-11-19 23:46:50,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:46:50" (3/3) ... [2019-11-19 23:46:50,138 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label01.c [2019-11-19 23:46:50,146 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:46:50,154 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:46:50,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:46:50,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:46:50,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:46:50,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:46:50,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:46:50,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:46:50,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:46:50,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:46:50,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:46:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-19 23:46:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 23:46:50,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:46:50,236 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] [2019-11-19 23:46:50,237 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:46:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:46:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-11-19 23:46:50,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:46:50,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83756742] [2019-11-19 23:46:50,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:46:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:50,532 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:46:50,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83756742] [2019-11-19 23:46:50,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:46:50,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:46:50,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927197278] [2019-11-19 23:46:50,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:46:50,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:46:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:46:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:46:50,555 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-19 23:46:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:46:54,956 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-19 23:46:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:46:54,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-19 23:46:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:46:54,981 INFO L225 Difference]: With dead ends: 1470 [2019-11-19 23:46:54,981 INFO L226 Difference]: Without dead ends: 978 [2019-11-19 23:46:54,986 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:46:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-19 23:46:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-19 23:46:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-19 23:46:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-19 23:46:55,090 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 44 [2019-11-19 23:46:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:46:55,091 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-19 23:46:55,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:46:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-19 23:46:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-19 23:46:55,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:46:55,096 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, 1, 1, 1, 1, 1, 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:46:55,096 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:46:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:46:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1760666973, now seen corresponding path program 1 times [2019-11-19 23:46:55,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:46:55,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626545172] [2019-11-19 23:46:55,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:46:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:55,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626545172] [2019-11-19 23:46:55,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:46:55,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:46:55,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329167814] [2019-11-19 23:46:55,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:46:55,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:46:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:46:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:46:55,350 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 5 states. [2019-11-19 23:47:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:01,282 INFO L93 Difference]: Finished difference Result 3167 states and 4696 transitions. [2019-11-19 23:47:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:01,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-19 23:47:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:01,309 INFO L225 Difference]: With dead ends: 3167 [2019-11-19 23:47:01,310 INFO L226 Difference]: Without dead ends: 2193 [2019-11-19 23:47:01,313 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:47:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2019-11-19 23:47:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1886. [2019-11-19 23:47:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-19 23:47:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2622 transitions. [2019-11-19 23:47:01,371 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2622 transitions. Word has length 109 [2019-11-19 23:47:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:01,373 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2622 transitions. [2019-11-19 23:47:01,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:47:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2622 transitions. [2019-11-19 23:47:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-19 23:47:01,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:01,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,380 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1367533996, now seen corresponding path program 1 times [2019-11-19 23:47:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:01,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319469732] [2019-11-19 23:47:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:01,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319469732] [2019-11-19 23:47:01,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:01,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:47:01,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119257498] [2019-11-19 23:47:01,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:01,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:01,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:01,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:01,547 INFO L87 Difference]: Start difference. First operand 1886 states and 2622 transitions. Second operand 4 states. [2019-11-19 23:47:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:04,041 INFO L93 Difference]: Finished difference Result 7067 states and 9932 transitions. [2019-11-19 23:47:04,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:04,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-19 23:47:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:04,070 INFO L225 Difference]: With dead ends: 7067 [2019-11-19 23:47:04,070 INFO L226 Difference]: Without dead ends: 5183 [2019-11-19 23:47:04,074 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:47:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2019-11-19 23:47:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4878. [2019-11-19 23:47:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4878 states. [2019-11-19 23:47:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6341 transitions. [2019-11-19 23:47:04,171 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6341 transitions. Word has length 114 [2019-11-19 23:47:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:04,173 INFO L462 AbstractCegarLoop]: Abstraction has 4878 states and 6341 transitions. [2019-11-19 23:47:04,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6341 transitions. [2019-11-19 23:47:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-19 23:47:04,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:04,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1300079150, now seen corresponding path program 1 times [2019-11-19 23:47:04,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:04,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444868235] [2019-11-19 23:47:04,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:04,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444868235] [2019-11-19 23:47:04,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112450229] [2019-11-19 23:47:04,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:47:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:04,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:47:04,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:04,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:47:04,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-19 23:47:04,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021563024] [2019-11-19 23:47:04,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:04,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:04,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:47:04,538 INFO L87 Difference]: Start difference. First operand 4878 states and 6341 transitions. Second operand 4 states. [2019-11-19 23:47:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:08,586 INFO L93 Difference]: Finished difference Result 14287 states and 18930 transitions. [2019-11-19 23:47:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:08,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-19 23:47:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:08,626 INFO L225 Difference]: With dead ends: 14287 [2019-11-19 23:47:08,626 INFO L226 Difference]: Without dead ends: 9411 [2019-11-19 23:47:08,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:47:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-11-19 23:47:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 9380. [2019-11-19 23:47:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9380 states. [2019-11-19 23:47:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9380 states to 9380 states and 11899 transitions. [2019-11-19 23:47:08,808 INFO L78 Accepts]: Start accepts. Automaton has 9380 states and 11899 transitions. Word has length 135 [2019-11-19 23:47:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:08,810 INFO L462 AbstractCegarLoop]: Abstraction has 9380 states and 11899 transitions. [2019-11-19 23:47:08,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9380 states and 11899 transitions. [2019-11-19 23:47:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-19 23:47:08,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:08,813 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:47:09,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:09,017 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2006286439, now seen corresponding path program 1 times [2019-11-19 23:47:09,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:09,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958601521] [2019-11-19 23:47:09,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 23:47:09,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958601521] [2019-11-19 23:47:09,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355704272] [2019-11-19 23:47:09,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:47:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:09,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:47:09,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:09,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:47:09,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-19 23:47:09,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303311537] [2019-11-19 23:47:09,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:47:09,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:47:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:09,617 INFO L87 Difference]: Start difference. First operand 9380 states and 11899 transitions. Second operand 3 states. [2019-11-19 23:47:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:11,323 INFO L93 Difference]: Finished difference Result 23540 states and 30243 transitions. [2019-11-19 23:47:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:47:11,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-19 23:47:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:11,383 INFO L225 Difference]: With dead ends: 23540 [2019-11-19 23:47:11,383 INFO L226 Difference]: Without dead ends: 14461 [2019-11-19 23:47:11,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-11-19 23:47:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 9376. [2019-11-19 23:47:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-11-19 23:47:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 11687 transitions. [2019-11-19 23:47:11,604 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 11687 transitions. Word has length 214 [2019-11-19 23:47:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:11,605 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 11687 transitions. [2019-11-19 23:47:11,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:47:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 11687 transitions. [2019-11-19 23:47:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 23:47:11,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:11,611 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:11,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:11,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -92208819, now seen corresponding path program 1 times [2019-11-19 23:47:11,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:11,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460533356] [2019-11-19 23:47:11,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 23:47:12,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460533356] [2019-11-19 23:47:12,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:12,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:12,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345181511] [2019-11-19 23:47:12,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:47:12,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:47:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:47:12,389 INFO L87 Difference]: Start difference. First operand 9376 states and 11687 transitions. Second operand 5 states. [2019-11-19 23:47:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:14,131 INFO L93 Difference]: Finished difference Result 20547 states and 25311 transitions. [2019-11-19 23:47:14,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:14,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-11-19 23:47:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:14,153 INFO L225 Difference]: With dead ends: 20547 [2019-11-19 23:47:14,153 INFO L226 Difference]: Without dead ends: 11173 [2019-11-19 23:47:14,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:47:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11173 states. [2019-11-19 23:47:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11173 to 10871. [2019-11-19 23:47:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10871 states. [2019-11-19 23:47:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10871 states to 10871 states and 13244 transitions. [2019-11-19 23:47:14,299 INFO L78 Accepts]: Start accepts. Automaton has 10871 states and 13244 transitions. Word has length 305 [2019-11-19 23:47:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:14,300 INFO L462 AbstractCegarLoop]: Abstraction has 10871 states and 13244 transitions. [2019-11-19 23:47:14,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:47:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 10871 states and 13244 transitions. [2019-11-19 23:47:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-19 23:47:14,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:14,309 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,309 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1024558271, now seen corresponding path program 1 times [2019-11-19 23:47:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:14,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178896879] [2019-11-19 23:47:14,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 23:47:14,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178896879] [2019-11-19 23:47:14,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:14,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:14,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336533256] [2019-11-19 23:47:14,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:14,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:14,622 INFO L87 Difference]: Start difference. First operand 10871 states and 13244 transitions. Second operand 4 states. [2019-11-19 23:47:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:17,965 INFO L93 Difference]: Finished difference Result 25031 states and 30699 transitions. [2019-11-19 23:47:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:17,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-19 23:47:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:17,981 INFO L225 Difference]: With dead ends: 25031 [2019-11-19 23:47:17,981 INFO L226 Difference]: Without dead ends: 14162 [2019-11-19 23:47:17,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 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:47:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2019-11-19 23:47:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 12665. [2019-11-19 23:47:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12665 states. [2019-11-19 23:47:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12665 states to 12665 states and 14798 transitions. [2019-11-19 23:47:18,163 INFO L78 Accepts]: Start accepts. Automaton has 12665 states and 14798 transitions. Word has length 390 [2019-11-19 23:47:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:18,164 INFO L462 AbstractCegarLoop]: Abstraction has 12665 states and 14798 transitions. [2019-11-19 23:47:18,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12665 states and 14798 transitions. [2019-11-19 23:47:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-19 23:47:18,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:18,174 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,174 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -289447111, now seen corresponding path program 1 times [2019-11-19 23:47:18,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:18,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612414307] [2019-11-19 23:47:18,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:18,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612414307] [2019-11-19 23:47:18,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966055626] [2019-11-19 23:47:18,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:47:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:18,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:47:18,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:33,678 WARN L191 SmtUtils]: Spent 14.77 s on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-11-19 23:47:34,590 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_894 Int)) (let ((.cse0 (div v_~a29~0_894 5))) (and (< .cse0 0) (not (= (mod .cse0 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse0 5) 4460))))) (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) is different from true [2019-11-19 23:47:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 105 not checked. [2019-11-19 23:47:35,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:47:35,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-19 23:47:35,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973430390] [2019-11-19 23:47:35,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:47:35,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:47:35,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=22, Unknown=1, NotChecked=10, Total=56 [2019-11-19 23:47:35,708 INFO L87 Difference]: Start difference. First operand 12665 states and 14798 transitions. Second operand 8 states. [2019-11-19 23:47:37,300 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse3 (div v_~a29~0_894 5))) (and (< .cse3 0) (not (= (mod .cse3 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse3 5) 4460))))))) (and (or .cse0 (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) (or .cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse2 (div v_~a29~0_894 5))) (and (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse2 5) 4459)) (= (mod .cse2 5) 0))))))) is different from true [2019-11-19 23:47:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:47,550 INFO L93 Difference]: Finished difference Result 35267 states and 41876 transitions. [2019-11-19 23:47:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:47:47,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-11-19 23:47:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:47,574 INFO L225 Difference]: With dead ends: 35267 [2019-11-19 23:47:47,574 INFO L226 Difference]: Without dead ends: 22604 [2019-11-19 23:47:47,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 388 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=25, Invalid=23, Unknown=2, NotChecked=22, Total=72 [2019-11-19 23:47:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22604 states. [2019-11-19 23:47:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22604 to 17751. [2019-11-19 23:47:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17751 states. [2019-11-19 23:47:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17751 states to 17751 states and 21096 transitions. [2019-11-19 23:47:47,807 INFO L78 Accepts]: Start accepts. Automaton has 17751 states and 21096 transitions. Word has length 391 [2019-11-19 23:47:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:47,808 INFO L462 AbstractCegarLoop]: Abstraction has 17751 states and 21096 transitions. [2019-11-19 23:47:47,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:47:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17751 states and 21096 transitions. [2019-11-19 23:47:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-11-19 23:47:47,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:47,820 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:48,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:48,023 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1505436081, now seen corresponding path program 1 times [2019-11-19 23:47:48,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:48,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046143403] [2019-11-19 23:47:48,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:48,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046143403] [2019-11-19 23:47:48,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:48,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:48,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239445875] [2019-11-19 23:47:48,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:48,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:48,339 INFO L87 Difference]: Start difference. First operand 17751 states and 21096 transitions. Second operand 4 states. [2019-11-19 23:47:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:51,056 INFO L93 Difference]: Finished difference Result 38793 states and 46339 transitions. [2019-11-19 23:47:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:51,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2019-11-19 23:47:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:51,070 INFO L225 Difference]: With dead ends: 38793 [2019-11-19 23:47:51,071 INFO L226 Difference]: Without dead ends: 21044 [2019-11-19 23:47:51,080 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:47:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21044 states. [2019-11-19 23:47:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21044 to 19842. [2019-11-19 23:47:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19842 states. [2019-11-19 23:47:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19842 states to 19842 states and 23112 transitions. [2019-11-19 23:47:51,292 INFO L78 Accepts]: Start accepts. Automaton has 19842 states and 23112 transitions. Word has length 445 [2019-11-19 23:47:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:51,292 INFO L462 AbstractCegarLoop]: Abstraction has 19842 states and 23112 transitions. [2019-11-19 23:47:51,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19842 states and 23112 transitions. [2019-11-19 23:47:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-19 23:47:51,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:51,297 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -377920542, now seen corresponding path program 1 times [2019-11-19 23:47:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:51,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124194438] [2019-11-19 23:47:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 299 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 23:47:52,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124194438] [2019-11-19 23:47:52,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038181660] [2019-11-19 23:47:52,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:47:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:52,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:47:52,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:52,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 263 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 23:47:52,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:47:52,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-19 23:47:52,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826256957] [2019-11-19 23:47:52,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:47:52,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:47:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:47:52,918 INFO L87 Difference]: Start difference. First operand 19842 states and 23112 transitions. Second operand 9 states. [2019-11-19 23:47:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:58,647 INFO L93 Difference]: Finished difference Result 47064 states and 54313 transitions. [2019-11-19 23:47:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:47:58,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 447 [2019-11-19 23:47:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:58,661 INFO L225 Difference]: With dead ends: 47064 [2019-11-19 23:47:58,662 INFO L226 Difference]: Without dead ends: 19840 [2019-11-19 23:47:58,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 444 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:47:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19840 states. [2019-11-19 23:47:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19840 to 17446. [2019-11-19 23:47:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-11-19 23:47:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 18768 transitions. [2019-11-19 23:47:58,816 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 18768 transitions. Word has length 447 [2019-11-19 23:47:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:58,816 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 18768 transitions. [2019-11-19 23:47:58,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:47:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 18768 transitions. [2019-11-19 23:47:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-11-19 23:47:58,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:58,820 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:59,023 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 319650045, now seen corresponding path program 1 times [2019-11-19 23:47:59,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:59,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121185818] [2019-11-19 23:47:59,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 42 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:59,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121185818] [2019-11-19 23:47:59,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723205197] [2019-11-19 23:47:59,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:47:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:59,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:47:59,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:59,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 236 proven. 106 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 23:48:00,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:48:00,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-11-19 23:48:00,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955745312] [2019-11-19 23:48:00,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:48:00,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:48:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:00,567 INFO L87 Difference]: Start difference. First operand 17446 states and 18768 transitions. Second operand 8 states. [2019-11-19 23:49:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:01,537 INFO L93 Difference]: Finished difference Result 48422 states and 51948 transitions. [2019-11-19 23:49:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:49:01,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 498 [2019-11-19 23:49:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:01,559 INFO L225 Difference]: With dead ends: 48422 [2019-11-19 23:49:01,559 INFO L226 Difference]: Without dead ends: 30679 [2019-11-19 23:49:01,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:49:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30679 states. [2019-11-19 23:49:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30679 to 24332. [2019-11-19 23:49:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24332 states. [2019-11-19 23:49:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24332 states to 24332 states and 26160 transitions. [2019-11-19 23:49:01,775 INFO L78 Accepts]: Start accepts. Automaton has 24332 states and 26160 transitions. Word has length 498 [2019-11-19 23:49:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:01,776 INFO L462 AbstractCegarLoop]: Abstraction has 24332 states and 26160 transitions. [2019-11-19 23:49:01,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:49:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24332 states and 26160 transitions. [2019-11-19 23:49:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-19 23:49:01,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:01,780 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:49:01,980 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1407121983, now seen corresponding path program 1 times [2019-11-19 23:49:01,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:01,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080991534] [2019-11-19 23:49:01,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 87 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:02,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080991534] [2019-11-19 23:49:02,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315353467] [2019-11-19 23:49:02,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:49:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:02,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:49:02,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:02,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:02,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:03,997 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2019-11-19 23:49:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:04,231 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-11-19 23:49:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 125 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:49:05,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:49:05,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-19 23:49:05,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902172836] [2019-11-19 23:49:05,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:49:05,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:49:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:49:05,280 INFO L87 Difference]: Start difference. First operand 24332 states and 26160 transitions. Second operand 9 states. [2019-11-19 23:50:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:00,881 INFO L93 Difference]: Finished difference Result 61918 states and 66521 transitions. [2019-11-19 23:50:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:50:00,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 510 [2019-11-19 23:50:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:00,912 INFO L225 Difference]: With dead ends: 61918 [2019-11-19 23:50:00,912 INFO L226 Difference]: Without dead ends: 37289 [2019-11-19 23:50:00,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:50:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37289 states. [2019-11-19 23:50:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37289 to 26731. [2019-11-19 23:50:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26731 states. [2019-11-19 23:50:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26731 states to 26731 states and 28795 transitions. [2019-11-19 23:50:01,285 INFO L78 Accepts]: Start accepts. Automaton has 26731 states and 28795 transitions. Word has length 510 [2019-11-19 23:50:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:01,286 INFO L462 AbstractCegarLoop]: Abstraction has 26731 states and 28795 transitions. [2019-11-19 23:50:01,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:50:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26731 states and 28795 transitions. [2019-11-19 23:50:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-11-19 23:50:01,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:01,291 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:50:01,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1741362260, now seen corresponding path program 1 times [2019-11-19 23:50:01,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:01,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665022566] [2019-11-19 23:50:01,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 390 proven. 132 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-19 23:50:02,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665022566] [2019-11-19 23:50:02,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826561317] [2019-11-19 23:50:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:50:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:02,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:50:02,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-19 23:50:02,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:50:02,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-19 23:50:02,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306007690] [2019-11-19 23:50:02,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:50:02,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:50:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:50:02,646 INFO L87 Difference]: Start difference. First operand 26731 states and 28795 transitions. Second operand 3 states. [2019-11-19 23:50:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:03,802 INFO L93 Difference]: Finished difference Result 53160 states and 57286 transitions. [2019-11-19 23:50:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:50:03,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2019-11-19 23:50:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:03,821 INFO L225 Difference]: With dead ends: 53160 [2019-11-19 23:50:03,821 INFO L226 Difference]: Without dead ends: 26730 [2019-11-19 23:50:03,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:50:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26730 states. [2019-11-19 23:50:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26730 to 26130. [2019-11-19 23:50:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26130 states. [2019-11-19 23:50:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26130 states to 26130 states and 27968 transitions. [2019-11-19 23:50:04,028 INFO L78 Accepts]: Start accepts. Automaton has 26130 states and 27968 transitions. Word has length 567 [2019-11-19 23:50:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:04,028 INFO L462 AbstractCegarLoop]: Abstraction has 26130 states and 27968 transitions. [2019-11-19 23:50:04,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:50:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26130 states and 27968 transitions. [2019-11-19 23:50:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-11-19 23:50:04,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:04,038 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 23:50:04,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:50:04,241 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 588763416, now seen corresponding path program 1 times [2019-11-19 23:50:04,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:04,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438932010] [2019-11-19 23:50:04,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 190 proven. 131 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-19 23:50:05,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438932010] [2019-11-19 23:50:05,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454474146] [2019-11-19 23:50:05,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/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:50:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:05,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:50:05,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:05,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:20,665 WARN L191 SmtUtils]: Spent 14.60 s on a formula simplification. DAG size of input: 191 DAG size of output: 33 [2019-11-19 23:50:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 212 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-19 23:50:21,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:50:21,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-11-19 23:50:21,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407150662] [2019-11-19 23:50:21,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:50:21,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:50:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:50:21,139 INFO L87 Difference]: Start difference. First operand 26130 states and 27968 transitions. Second operand 11 states. [2019-11-19 23:50:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:44,824 INFO L93 Difference]: Finished difference Result 57934 states and 61916 transitions. [2019-11-19 23:50:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 23:50:44,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 626 [2019-11-19 23:50:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:44,847 INFO L225 Difference]: With dead ends: 57934 [2019-11-19 23:50:44,847 INFO L226 Difference]: Without dead ends: 31803 [2019-11-19 23:50:44,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 634 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:50:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31803 states. [2019-11-19 23:50:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31803 to 23131. [2019-11-19 23:50:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-11-19 23:50:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 24329 transitions. [2019-11-19 23:50:45,072 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 24329 transitions. Word has length 626 [2019-11-19 23:50:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:45,074 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 24329 transitions. [2019-11-19 23:50:45,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:50:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 24329 transitions. [2019-11-19 23:50:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-11-19 23:50:45,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:45,082 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:50:45,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:50:45,286 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash -197045537, now seen corresponding path program 1 times [2019-11-19 23:50:45,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:45,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662137990] [2019-11-19 23:50:45,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-19 23:50:45,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662137990] [2019-11-19 23:50:45,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:45,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:50:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887187017] [2019-11-19 23:50:45,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:50:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:50:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:50:45,798 INFO L87 Difference]: Start difference. First operand 23131 states and 24329 transitions. Second operand 5 states. [2019-11-19 23:50:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:50,424 INFO L93 Difference]: Finished difference Result 55272 states and 58070 transitions. [2019-11-19 23:50:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:50:50,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 630 [2019-11-19 23:50:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:50,456 INFO L225 Difference]: With dead ends: 55272 [2019-11-19 23:50:50,456 INFO L226 Difference]: Without dead ends: 31844 [2019-11-19 23:50:50,466 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:50:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31844 states. [2019-11-19 23:50:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31844 to 23733. [2019-11-19 23:50:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23733 states. [2019-11-19 23:50:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23733 states to 23733 states and 24982 transitions. [2019-11-19 23:50:50,685 INFO L78 Accepts]: Start accepts. Automaton has 23733 states and 24982 transitions. Word has length 630 [2019-11-19 23:50:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:50,686 INFO L462 AbstractCegarLoop]: Abstraction has 23733 states and 24982 transitions. [2019-11-19 23:50:50,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:50:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23733 states and 24982 transitions. [2019-11-19 23:50:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-11-19 23:50:50,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:50,694 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:50:50,694 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash -623330870, now seen corresponding path program 1 times [2019-11-19 23:50:50,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:50,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786095344] [2019-11-19 23:50:50,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-19 23:50:51,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786095344] [2019-11-19 23:50:51,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:51,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:50:51,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843978922] [2019-11-19 23:50:51,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:50:51,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:50:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:50:51,091 INFO L87 Difference]: Start difference. First operand 23733 states and 24982 transitions. Second operand 3 states. [2019-11-19 23:50:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:52,200 INFO L93 Difference]: Finished difference Result 51065 states and 53778 transitions. [2019-11-19 23:50:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:50:52,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2019-11-19 23:50:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:52,224 INFO L225 Difference]: With dead ends: 51065 [2019-11-19 23:50:52,224 INFO L226 Difference]: Without dead ends: 27035 [2019-11-19 23:50:52,234 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:50:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27035 states. [2019-11-19 23:50:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27035 to 27025. [2019-11-19 23:50:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27025 states. [2019-11-19 23:50:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27025 states to 27025 states and 28227 transitions. [2019-11-19 23:50:52,456 INFO L78 Accepts]: Start accepts. Automaton has 27025 states and 28227 transitions. Word has length 632 [2019-11-19 23:50:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:52,457 INFO L462 AbstractCegarLoop]: Abstraction has 27025 states and 28227 transitions. [2019-11-19 23:50:52,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:50:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 27025 states and 28227 transitions. [2019-11-19 23:50:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-11-19 23:50:52,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:52,466 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 23:50:52,467 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1435228887, now seen corresponding path program 1 times [2019-11-19 23:50:52,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:52,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356718151] [2019-11-19 23:50:52,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-19 23:50:53,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356718151] [2019-11-19 23:50:53,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:53,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:50:53,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762780645] [2019-11-19 23:50:53,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:50:53,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:50:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:50:53,008 INFO L87 Difference]: Start difference. First operand 27025 states and 28227 transitions. Second operand 3 states. [2019-11-19 23:50:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:54,211 INFO L93 Difference]: Finished difference Result 56140 states and 58626 transitions. [2019-11-19 23:50:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:50:54,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 684 [2019-11-19 23:50:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:54,237 INFO L225 Difference]: With dead ends: 56140 [2019-11-19 23:50:54,237 INFO L226 Difference]: Without dead ends: 29117 [2019-11-19 23:50:54,247 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:50:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29117 states. [2019-11-19 23:50:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29117 to 26725. [2019-11-19 23:50:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26725 states. [2019-11-19 23:50:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26725 states to 26725 states and 27904 transitions. [2019-11-19 23:50:54,471 INFO L78 Accepts]: Start accepts. Automaton has 26725 states and 27904 transitions. Word has length 684 [2019-11-19 23:50:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:54,472 INFO L462 AbstractCegarLoop]: Abstraction has 26725 states and 27904 transitions. [2019-11-19 23:50:54,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:50:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 26725 states and 27904 transitions. [2019-11-19 23:50:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-19 23:50:54,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:54,483 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:54,483 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash -749809954, now seen corresponding path program 1 times [2019-11-19 23:50:54,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:50:54,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096988258] [2019-11-19 23:50:54,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:50:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 334 proven. 412 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-19 23:50:56,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096988258] [2019-11-19 23:50:56,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983014094] [2019-11-19 23:50:56,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:50:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:56,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:50:56,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:56,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:56,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:56,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 557 proven. 119 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-19 23:50:57,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:50:57,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-19 23:50:57,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47312048] [2019-11-19 23:50:57,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:50:57,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:50:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:50:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:50:57,540 INFO L87 Difference]: Start difference. First operand 26725 states and 27904 transitions. Second operand 16 states. [2019-11-19 23:51:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:44,430 INFO L93 Difference]: Finished difference Result 66939 states and 69750 transitions. [2019-11-19 23:51:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-19 23:51:44,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 732 [2019-11-19 23:51:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:44,466 INFO L225 Difference]: With dead ends: 66939 [2019-11-19 23:51:44,466 INFO L226 Difference]: Without dead ends: 39612 [2019-11-19 23:51:44,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 772 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=839, Invalid=2821, Unknown=0, NotChecked=0, Total=3660 [2019-11-19 23:51:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39612 states. [2019-11-19 23:51:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39612 to 22827. [2019-11-19 23:51:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2019-11-19 23:51:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 23816 transitions. [2019-11-19 23:51:44,750 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 23816 transitions. Word has length 732 [2019-11-19 23:51:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:44,751 INFO L462 AbstractCegarLoop]: Abstraction has 22827 states and 23816 transitions. [2019-11-19 23:51:44,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:51:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 23816 transitions. [2019-11-19 23:51:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-11-19 23:51:44,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:44,761 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:44,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:44,962 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 578201737, now seen corresponding path program 1 times [2019-11-19 23:51:44,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:44,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861011188] [2019-11-19 23:51:44,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-11-19 23:51:45,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861011188] [2019-11-19 23:51:45,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:51:45,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:51:45,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281568998] [2019-11-19 23:51:45,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:51:45,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:51:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:51:45,461 INFO L87 Difference]: Start difference. First operand 22827 states and 23816 transitions. Second operand 3 states. [2019-11-19 23:51:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:46,534 INFO L93 Difference]: Finished difference Result 45949 states and 47941 transitions. [2019-11-19 23:51:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:51:46,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2019-11-19 23:51:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:46,551 INFO L225 Difference]: With dead ends: 45949 [2019-11-19 23:51:46,551 INFO L226 Difference]: Without dead ends: 23124 [2019-11-19 23:51:46,560 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:51:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23124 states. [2019-11-19 23:51:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23124 to 22825. [2019-11-19 23:51:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22825 states. [2019-11-19 23:51:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22825 states to 22825 states and 23812 transitions. [2019-11-19 23:51:46,754 INFO L78 Accepts]: Start accepts. Automaton has 22825 states and 23812 transitions. Word has length 758 [2019-11-19 23:51:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:46,755 INFO L462 AbstractCegarLoop]: Abstraction has 22825 states and 23812 transitions. [2019-11-19 23:51:46,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:51:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 22825 states and 23812 transitions. [2019-11-19 23:51:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2019-11-19 23:51:46,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:46,766 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:46,767 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1706100167, now seen corresponding path program 1 times [2019-11-19 23:51:46,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:46,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652495541] [2019-11-19 23:51:46,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 757 proven. 163 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:51:48,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652495541] [2019-11-19 23:51:48,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733506777] [2019-11-19 23:51:48,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:48,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:51:48,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:48,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:51:48,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:51:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-19 23:51:48,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:51:48,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-11-19 23:51:48,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311687008] [2019-11-19 23:51:48,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:51:48,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:48,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:51:48,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:51:48,661 INFO L87 Difference]: Start difference. First operand 22825 states and 23812 transitions. Second operand 3 states. [2019-11-19 23:51:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:49,852 INFO L93 Difference]: Finished difference Result 49847 states and 52054 transitions. [2019-11-19 23:51:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:51:49,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 804 [2019-11-19 23:51:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:49,874 INFO L225 Difference]: With dead ends: 49847 [2019-11-19 23:51:49,874 INFO L226 Difference]: Without dead ends: 27024 [2019-11-19 23:51:49,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:51:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27024 states. [2019-11-19 23:51:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27024 to 24324. [2019-11-19 23:51:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24324 states. [2019-11-19 23:51:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24324 states to 24324 states and 25219 transitions. [2019-11-19 23:51:50,087 INFO L78 Accepts]: Start accepts. Automaton has 24324 states and 25219 transitions. Word has length 804 [2019-11-19 23:51:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:50,088 INFO L462 AbstractCegarLoop]: Abstraction has 24324 states and 25219 transitions. [2019-11-19 23:51:50,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:51:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24324 states and 25219 transitions. [2019-11-19 23:51:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-11-19 23:51:50,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:50,102 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:50,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:50,305 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:50,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1858402503, now seen corresponding path program 1 times [2019-11-19 23:51:50,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:50,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344050406] [2019-11-19 23:51:50,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-19 23:51:50,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344050406] [2019-11-19 23:51:50,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:51:50,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:51:50,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747882292] [2019-11-19 23:51:50,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:51:50,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:51:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:51:50,885 INFO L87 Difference]: Start difference. First operand 24324 states and 25219 transitions. Second operand 3 states. [2019-11-19 23:51:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:51,812 INFO L93 Difference]: Finished difference Result 41111 states and 42625 transitions. [2019-11-19 23:51:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:51:51,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 840 [2019-11-19 23:51:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:51,826 INFO L225 Difference]: With dead ends: 41111 [2019-11-19 23:51:51,826 INFO L226 Difference]: Without dead ends: 16789 [2019-11-19 23:51:51,835 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:51:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16789 states. [2019-11-19 23:51:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16789 to 14696. [2019-11-19 23:51:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14696 states. [2019-11-19 23:51:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14696 states to 14696 states and 15050 transitions. [2019-11-19 23:51:51,992 INFO L78 Accepts]: Start accepts. Automaton has 14696 states and 15050 transitions. Word has length 840 [2019-11-19 23:51:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:51,993 INFO L462 AbstractCegarLoop]: Abstraction has 14696 states and 15050 transitions. [2019-11-19 23:51:51,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:51:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14696 states and 15050 transitions. [2019-11-19 23:51:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-11-19 23:51:52,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:52,011 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,011 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 798112884, now seen corresponding path program 1 times [2019-11-19 23:51:52,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:52,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845665932] [2019-11-19 23:51:52,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-11-19 23:51:53,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845665932] [2019-11-19 23:51:53,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:51:53,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:51:53,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390159539] [2019-11-19 23:51:53,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:51:53,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:53,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:51:53,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:51:53,095 INFO L87 Difference]: Start difference. First operand 14696 states and 15050 transitions. Second operand 5 states. [2019-11-19 23:51:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:54,974 INFO L93 Difference]: Finished difference Result 17099 states and 17500 transitions. [2019-11-19 23:51:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:51:54,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 966 [2019-11-19 23:51:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:54,976 INFO L225 Difference]: With dead ends: 17099 [2019-11-19 23:51:54,977 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:51:54,981 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:51:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:51:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:51:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:51:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:51:54,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 966 [2019-11-19 23:51:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:54,982 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:51:54,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:51:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:51:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:51:54,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:51:57,006 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 1087 DAG size of output: 842 [2019-11-19 23:51:58,719 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 1073 DAG size of output: 821 [2019-11-19 23:51:59,460 WARN L191 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 812 DAG size of output: 668 [2019-11-19 23:52:38,929 WARN L191 SmtUtils]: Spent 39.46 s on a formula simplification. DAG size of input: 794 DAG size of output: 160 [2019-11-19 23:52:59,858 WARN L191 SmtUtils]: Spent 20.92 s on a formula simplification. DAG size of input: 768 DAG size of output: 158 [2019-11-19 23:53:33,361 WARN L191 SmtUtils]: Spent 33.50 s on a formula simplification. DAG size of input: 630 DAG size of output: 156 [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 23:53:33,366 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 23:53:33,367 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,368 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,369 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 23:53:33,370 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 23:53:33,371 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-19 23:53:33,372 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 23:53:33,373 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,374 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,375 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,376 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 23:53:33,377 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 23:53:33,378 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,379 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,380 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,381 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 23:53:33,382 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,383 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,384 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,385 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,385 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,386 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse28 (+ ~a0~0 147)) (.cse23 (+ ~a4~0 86)) (.cse27 (= 1 ~a2~0))) (let ((.cse19 (<= (+ ~a0~0 61) 0)) (.cse29 (+ ~a29~0 127)) (.cse7 (not (= ~a2~0 3))) (.cse11 (not .cse27)) (.cse1 (<= .cse23 0)) (.cse17 (< 0 .cse28)) (.cse14 (= ~a2~0 1)) (.cse3 (<= 0 (+ ~a0~0 44)))) (let ((.cse2 (or (and .cse1 .cse14 .cse17) (and .cse14 .cse3))) (.cse0 (<= (+ ~a29~0 16) 0)) (.cse18 (< 0 (+ ~a29~0 144))) (.cse12 (or (and .cse1 .cse7 .cse11) (and (and .cse7 .cse3) .cse11))) (.cse4 (<= 0 .cse29)) (.cse9 (<= 3 ~a2~0)) (.cse20 (= 4 ~a2~0)) (.cse16 (= 3 ~a2~0)) (.cse8 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse13 (< 43 ~a29~0)) (.cse22 (<= ~a29~0 599997)) (.cse25 (and .cse1 .cse14 .cse19)) (.cse24 (<= .cse29 0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse10 (= 2 ~a2~0)) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse21 (<= ~a29~0 599999)) (.cse15 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse28 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse5 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse5 .cse10 .cse6 .cse8) (or (and (and .cse1 (<= (+ ~a29~0 145526) 0) .cse11) (<= ~a2~0 4)) (and .cse6 (and .cse8 (and .cse12 .cse10)))) (and .cse5 .cse13 .cse14 .cse6 .cse15 .cse8) (and .cse1 .cse8 .cse16) (and .cse5 .cse17 (<= (+ ~a29~0 56603) 0) .cse6 .cse9) (and .cse5 .cse6 .cse17 .cse7 .cse13 .cse9) (and .cse5 .cse6 .cse0 .cse18 .cse9) (and .cse2 .cse19) (and .cse20 .cse5 .cse6 .cse21) (and .cse5 .cse6 (and .cse14 .cse17 .cse0)) (and (<= (+ ~a0~0 366640) 0) .cse6 .cse9 .cse22) (and (< 0 .cse23) (<= ~a29~0 43) .cse4 .cse6 .cse14) (and .cse1 .cse11 .cse19) (and .cse0 .cse19 .cse6 .cse14 .cse18) (and .cse6 (and .cse12 (<= ~a29~0 96178) .cse4 .cse9)) (and .cse1 .cse24 .cse20) (and .cse25 .cse13) (and .cse5 .cse6 .cse15 .cse8 .cse16) (and .cse5 (or (and .cse15 .cse8 .cse10 .cse13) (and .cse10 .cse13 .cse22))) (and .cse6 (and (exists ((v_prenex_2 Int)) (let ((.cse26 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse26 (- 403018)) 5) 1)) (< .cse26 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse26 2) 5) 0)) (< v_prenex_2 0) (< .cse26 403018) (not (= (mod (+ .cse26 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse27 .cse17 .cse19))) (and .cse25 .cse24) (and .cse5 .cse10 .cse6 .cse21 .cse15))))) [2019-11-19 23:53:33,386 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 23:53:33,386 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 23:53:33,386 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,386 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 23:53:33,387 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 23:53:33,388 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 23:53:33,389 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,390 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,391 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,391 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,391 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse28 (+ ~a0~0 147)) (.cse26 (+ ~a4~0 86)) (.cse13 (= 1 ~a2~0))) (let ((.cse16 (+ ~a29~0 127)) (.cse5 (not (= ~a2~0 3))) (.cse22 (not .cse13)) (.cse25 (+ ~a29~0 144)) (.cse8 (<= .cse26 0)) (.cse14 (< 0 .cse28)) (.cse23 (= ~a2~0 1)) (.cse21 (<= 0 (+ ~a0~0 44)))) (let ((.cse17 (= 4 ~a2~0)) (.cse18 (or (and .cse8 .cse23 .cse14) (and .cse23 .cse21))) (.cse4 (<= 3 ~a2~0)) (.cse0 (<= (+ ~a29~0 16) 0)) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse3 (< 0 .cse25)) (.cse20 (or (and .cse8 .cse5 .cse22) (and (and .cse5 .cse21) .cse22))) (.cse7 (<= 0 .cse16)) (.cse9 (= 3 ~a2~0)) (.cse6 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse11 (< 43 ~a29~0)) (.cse15 (<= ~a29~0 599997)) (.cse1 (<= (+ ~a0~0 98) 0)) (.cse24 (= 2 ~a2~0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse19 (<= ~a29~0 599999)) (.cse27 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse28 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9) (and (and .cse8 .cse10) .cse11) (and .cse2 (and (exists ((v_prenex_2 Int)) (let ((.cse12 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse12 (- 403018)) 5) 1)) (< .cse12 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse12 2) 5) 0)) (< v_prenex_2 0) (< .cse12 403018) (not (= (mod (+ .cse12 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse13 .cse14 .cse10))) (and (<= (+ ~a0~0 366640) 0) .cse2 .cse4 .cse15) (and .cse1 .cse14 (<= (+ ~a29~0 56603) 0) .cse2 .cse4) (and .cse8 (<= .cse16 0) .cse17) (and .cse18 .cse10) (and .cse17 .cse1 .cse2 .cse19) (and .cse2 (and .cse20 (<= ~a29~0 96178) .cse7 .cse4)) (and (and (and .cse0 .cse18 .cse7) .cse21) .cse2) (and .cse1 .cse2 .cse14 .cse5 .cse4 .cse11) (and .cse8 .cse22 .cse10) (and .cse1 .cse2 (and .cse23 .cse14 .cse0)) (and .cse0 .cse10 .cse2 .cse23 .cse3) (or (and .cse8 (<= (+ ~a29~0 145526) 0) (<= ~a2~0 3)) (and .cse2 (and .cse6 (and .cse20 .cse24)))) (and .cse8 .cse23 (<= .cse25 0)) (and .cse2 (and (< 0 .cse26) (and .cse23 (<= ~a29~0 43) .cse7))) (and .cse1 .cse2 .cse27 .cse6 .cse9) (and .cse1 .cse24 .cse2 .cse6) (and .cse1 .cse11 .cse2 .cse23 .cse27 .cse6) (and (or (and .cse27 .cse6 .cse24 .cse11) (and .cse24 .cse11 .cse15)) .cse1) (and .cse1 .cse24 .cse2 .cse19 .cse27))))) [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,392 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,393 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,394 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,395 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,396 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 23:53:33,397 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,398 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,399 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 23:53:33,400 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,401 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,401 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,401 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,401 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,401 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,402 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse14 (= 1 ~a2~0)) (.cse18 (+ ~a4~0 86)) (.cse28 (+ ~a0~0 147))) (let ((.cse26 (+ ~a29~0 144)) (.cse15 (< 0 .cse28)) (.cse19 (= ~a2~0 1)) (.cse21 (+ ~a29~0 127)) (.cse3 (<= 0 (+ ~a0~0 44))) (.cse1 (<= .cse18 0)) (.cse12 (not (= ~a2~0 3))) (.cse25 (not .cse14))) (let ((.cse10 (and (or (and .cse12 .cse3) (and .cse1 .cse12)) .cse25)) (.cse4 (<= 0 .cse21)) (.cse2 (or (and .cse1 .cse19 .cse15) (and .cse19 .cse3))) (.cse22 (= 4 ~a2~0)) (.cse8 (<= 3 ~a2~0)) (.cse0 (<= (+ ~a29~0 16) 0)) (.cse7 (< 0 .cse26)) (.cse17 (= 3 ~a2~0)) (.cse20 (<= ~a29~0 599997)) (.cse9 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse16 (<= (+ ~a0~0 61) 0)) (.cse24 (< 43 ~a29~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse11 (= 2 ~a2~0)) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse23 (<= ~a29~0 599999)) (.cse27 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse28 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 (and .cse5 .cse6 .cse7 .cse8)) (or (and .cse6 (and .cse9 (and .cse10 .cse11))) (and .cse1 (<= (+ ~a29~0 145526) 0) (<= ~a2~0 3))) (and .cse5 .cse6 .cse12 .cse9 .cse4 .cse8) (and .cse6 (and (exists ((v_prenex_2 Int)) (let ((.cse13 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse13 (- 403018)) 5) 1)) (< .cse13 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse13 2) 5) 0)) (< v_prenex_2 0) (< .cse13 403018) (not (= (mod (+ .cse13 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse14 .cse15 .cse16))) (and .cse1 .cse9 .cse17) (and .cse6 (and (< 0 .cse18) (<= ~a29~0 43) .cse4 .cse19)) (and (<= (+ ~a0~0 366640) 0) .cse6 .cse8 .cse20) (and .cse5 .cse15 (<= (+ ~a29~0 56603) 0) .cse6 .cse8) (and (and .cse10 (<= ~a29~0 96178) .cse4 .cse8) .cse6) (and .cse1 (<= .cse21 0) .cse22) (and .cse2 .cse16) (and .cse22 .cse5 .cse6 .cse23) (and .cse5 .cse6 (and .cse19 .cse15 .cse0)) (and .cse5 .cse6 .cse15 .cse12 .cse8 .cse24) (and .cse1 .cse25 .cse16) (and .cse0 .cse16 .cse6 .cse19 .cse7) (and .cse1 .cse19 (<= .cse26 0)) (and .cse5 .cse6 .cse27 .cse9 .cse17) (and (or (and .cse27 .cse9 .cse11 .cse24) (and .cse11 .cse24 .cse20)) .cse5) (and .cse5 .cse11 .cse6 .cse9) (and .cse5 .cse24 .cse6 .cse19 .cse27 .cse9) (and (and .cse1 .cse16) .cse24) (and .cse5 .cse11 .cse6 .cse23 .cse27))))) [2019-11-19 23:53:33,402 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 23:53:33,402 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 23:53:33,402 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,402 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,403 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,404 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,405 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 23:53:33,406 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,407 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 23:53:33,408 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,409 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 23:53:33,410 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,411 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,412 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 23:53:33,413 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,414 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 23:53:33,415 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 23:53:33,416 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-19 23:53:33,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:53:33 BoogieIcfgContainer [2019-11-19 23:53:33,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:53:33,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:53:33,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:53:33,509 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:53:33,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:46:50" (3/4) ... [2019-11-19 23:53:33,513 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:53:33,546 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 23:53:33,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:53:33,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a29 + 16 <= 0 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 <= a2) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((((a29 + 16 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a29 + 127) && 0 <= a0 + 44) && a4 + 42 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && 0 < a4 + 86 && (a2 == 1 && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-19 23:53:33,582 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a29 + 16 <= 0 && ((a4 + 86 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && 0 <= a29 + 127) || (a29 + 16 <= 0 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(1 == a2)) && 2 == a2) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && ((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a2 == 1)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (((((((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(1 == a2)) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2) && a4 + 42 <= 0)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-19 23:53:33,593 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a29 + 16 <= 0 && ((a4 + 86 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && 0 <= a29 + 127) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 4) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 43 < a29) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a0 + 98 <= 0 && (((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)))) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 61 <= 0) && a29 + 127 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-19 23:53:33,831 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1c00f90b-05c9-40fb-b7e9-9c6c30813186/bin/uautomizer/witness.graphml [2019-11-19 23:53:33,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:53:33,832 INFO L168 Benchmark]: Toolchain (without parser) took 409843.83 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 947.4 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,832 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:53:33,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1554.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -105.5 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 222.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,834 INFO L168 Benchmark]: Boogie Preprocessor took 215.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 998.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,834 INFO L168 Benchmark]: RCFGBuilder took 4145.39 ms. Allocated memory is still 1.2 GB. Free memory was 998.7 MB in the beginning and 921.0 MB in the end (delta: 77.7 MB). Peak memory consumption was 159.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,834 INFO L168 Benchmark]: TraceAbstraction took 403379.08 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 921.0 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,835 INFO L168 Benchmark]: Witness Printer took 322.38 ms. Allocated memory is still 4.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:53:33,837 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.86 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1554.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -105.5 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 222.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 215.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 998.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4145.39 ms. Allocated memory is still 1.2 GB. Free memory was 998.7 MB in the beginning and 921.0 MB in the end (delta: 77.7 MB). Peak memory consumption was 159.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 403379.08 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 921.0 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 322.38 ms. Allocated memory is still 4.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 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_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 1766]: Loop Invariant [2019-11-19 23:53:33,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a29 + 16 <= 0 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 <= a2) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((((a29 + 16 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a29 + 127) && 0 <= a0 + 44) && a4 + 42 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && 0 < a4 + 86 && (a2 == 1 && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 23:53:33,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a29 + 16 <= 0 && ((a4 + 86 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && 0 <= a29 + 127) || (a29 + 16 <= 0 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(1 == a2)) && 2 == a2) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && ((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a2 == 1)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (((((((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(1 == a2)) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2) && a4 + 42 <= 0)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-19 23:53:33,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-19 23:53:33,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:53:33,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a29 + 16 <= 0 && ((a4 + 86 <= 0 && (((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && 0 <= a29 + 127) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 4) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 43 < a29) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a0 + 98 <= 0 && (((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)))) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 61 <= 0) && a29 + 127 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 403.2s, OverallIterations: 22, TraceHistogramMax: 6, AutomataDifference: 245.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 98.3s, HoareTripleCheckerStatistics: 4681 SDtfs, 28457 SDslu, 2236 SDs, 0 SdLazy, 70513 SolverSat, 8145 SolverUnsat, 70 SolverUnknown, 0 SolverNotchecked, 224.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5169 GetRequests, 4983 SyntacticMatches, 35 SemanticMatches, 151 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27025occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 74545 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 294 NumberOfFragments, 2326 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2697653 FormulaSimplificationTreeSizeReduction, 4.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 706265 FormulaSimplificationTreeSizeReductionInter, 93.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 43.9s InterpolantComputationTime, 15765 NumberOfCodeBlocks, 15765 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 15733 ConstructedInterpolants, 517 QuantifiedInterpolants, 37384801 SizeOfPredicates, 9 NumberOfNonLiveVariables, 5946 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 12657/14950 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...