./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/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 5c4bbd5742ee42b28c0926d836f34d49923e4f62 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:15:55,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:15:55,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:15:55,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:15:55,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:15:55,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:15:55,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:15:55,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:15:55,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:15:55,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:15:55,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:15:55,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:15:55,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:15:55,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:15:55,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:15:55,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:15:55,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:15:55,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:15:55,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:15:55,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:15:56,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:15:56,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:15:56,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:15:56,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:15:56,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:15:56,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:15:56,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:15:56,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:15:56,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:15:56,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:15:56,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:15:56,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:15:56,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:15:56,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:15:56,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:15:56,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:15:56,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:15:56,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:15:56,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:15:56,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:15:56,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:15:56,012 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:15:56,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:15:56,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:15:56,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:15:56,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:15:56,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:15:56,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:15:56,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:15:56,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:15:56,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:15:56,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:15:56,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:15:56,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:15:56,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:15:56,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:15:56,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:15:56,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:15:56,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:15:56,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:15:56,028 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_20a959ca-5028-40b6-8a59-bf6c7e9d17df/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 -> 5c4bbd5742ee42b28c0926d836f34d49923e4f62 [2019-12-07 18:15:56,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:15:56,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:15:56,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:15:56,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:15:56,148 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:15:56,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2019-12-07 18:15:56,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/data/0b2f1655f/374cb48f418548228b33c1d5b65eba91/FLAG7811403df [2019-12-07 18:15:56,658 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:15:56,659 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2019-12-07 18:15:56,672 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/data/0b2f1655f/374cb48f418548228b33c1d5b65eba91/FLAG7811403df [2019-12-07 18:15:56,971 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/data/0b2f1655f/374cb48f418548228b33c1d5b65eba91 [2019-12-07 18:15:56,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:15:56,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:15:56,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:56,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:15:56,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:15:56,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:56" (1/1) ... [2019-12-07 18:15:56,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f26979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:56, skipping insertion in model container [2019-12-07 18:15:56,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:56" (1/1) ... [2019-12-07 18:15:57,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:15:57,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:15:57,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:57,502 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:15:57,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:57,670 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:15:57,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57 WrapperNode [2019-12-07 18:15:57,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:57,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:15:57,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:15:57,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:15:57,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:15:57,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:15:57,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:15:57,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:15:57,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... [2019-12-07 18:15:57,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:15:57,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:15:57,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:15:57,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:15:57,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:15:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:15:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:16:00,317 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:16:00,317 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:16:00,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:00 BoogieIcfgContainer [2019-12-07 18:16:00,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:16:00,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:16:00,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:16:00,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:16:00,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:15:56" (1/3) ... [2019-12-07 18:16:00,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f490b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:16:00, skipping insertion in model container [2019-12-07 18:16:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:57" (2/3) ... [2019-12-07 18:16:00,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f490b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:16:00, skipping insertion in model container [2019-12-07 18:16:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:00" (3/3) ... [2019-12-07 18:16:00,323 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2019-12-07 18:16:00,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:16:00,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:16:00,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:16:00,360 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:16:00,360 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:16:00,361 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:16:00,361 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:16:00,361 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:16:00,361 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:16:00,361 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:16:00,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:16:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:16:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:16:00,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:00,382 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] [2019-12-07 18:16:00,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-12-07 18:16:00,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:00,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420193935] [2019-12-07 18:16:00,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:00,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420193935] [2019-12-07 18:16:00,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:16:00,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137006499] [2019-12-07 18:16:00,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:00,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:00,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:00,558 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:16:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:03,777 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-12-07 18:16:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:03,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 18:16:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:03,793 INFO L225 Difference]: With dead ends: 1466 [2019-12-07 18:16:03,793 INFO L226 Difference]: Without dead ends: 974 [2019-12-07 18:16:03,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-12-07 18:16:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-12-07 18:16:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-07 18:16:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-12-07 18:16:03,857 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 36 [2019-12-07 18:16:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:03,858 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-12-07 18:16:03,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-12-07 18:16:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:16:03,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:03,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:03,862 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:03,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1797553213, now seen corresponding path program 1 times [2019-12-07 18:16:03,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:03,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390210194] [2019-12-07 18:16:03,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:03,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390210194] [2019-12-07 18:16:03,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:03,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:16:03,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418309814] [2019-12-07 18:16:03,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:03,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:03,980 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-12-07 18:16:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:07,594 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-12-07 18:16:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:07,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 18:16:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:07,606 INFO L225 Difference]: With dead ends: 3747 [2019-12-07 18:16:07,606 INFO L226 Difference]: Without dead ends: 2777 [2019-12-07 18:16:07,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-12-07 18:16:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-12-07 18:16:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-12-07 18:16:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-12-07 18:16:07,650 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 101 [2019-12-07 18:16:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:07,650 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-12-07 18:16:07,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-12-07 18:16:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-12-07 18:16:07,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:07,657 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 18:16:07,657 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1703382585, now seen corresponding path program 1 times [2019-12-07 18:16:07,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:07,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774775734] [2019-12-07 18:16:07,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:16:07,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774775734] [2019-12-07 18:16:07,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137813424] [2019-12-07 18:16:07,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:07,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:16:07,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:07,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:16:07,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 18:16:07,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847104837] [2019-12-07 18:16:07,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:07,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:07,958 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 3 states. [2019-12-07 18:16:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:09,533 INFO L93 Difference]: Finished difference Result 7941 states and 10408 transitions. [2019-12-07 18:16:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:09,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-12-07 18:16:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:09,552 INFO L225 Difference]: With dead ends: 7941 [2019-12-07 18:16:09,552 INFO L226 Difference]: Without dead ends: 5168 [2019-12-07 18:16:09,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-12-07 18:16:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-12-07 18:16:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-07 18:16:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-12-07 18:16:09,606 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 206 [2019-12-07 18:16:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:09,607 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-12-07 18:16:09,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-12-07 18:16:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-12-07 18:16:09,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:09,612 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:09,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:09,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 815863459, now seen corresponding path program 1 times [2019-12-07 18:16:09,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:09,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633340055] [2019-12-07 18:16:09,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 18:16:10,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633340055] [2019-12-07 18:16:10,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:10,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:16:10,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705931066] [2019-12-07 18:16:10,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:16:10,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:16:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:16:10,255 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-12-07 18:16:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:13,098 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-12-07 18:16:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:13,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 386 [2019-12-07 18:16:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:13,113 INFO L225 Difference]: With dead ends: 7342 [2019-12-07 18:16:13,113 INFO L226 Difference]: Without dead ends: 4271 [2019-12-07 18:16:13,116 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-12-07 18:16:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-12-07 18:16:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-12-07 18:16:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-12-07 18:16:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-12-07 18:16:13,166 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 386 [2019-12-07 18:16:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:13,167 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-12-07 18:16:13,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:16:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-12-07 18:16:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-12-07 18:16:13,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:13,173 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:13,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -63412363, now seen corresponding path program 1 times [2019-12-07 18:16:13,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:13,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656542716] [2019-12-07 18:16:13,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:16:13,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656542716] [2019-12-07 18:16:13,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:13,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:16:13,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389680422] [2019-12-07 18:16:13,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:13,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:13,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:13,519 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-12-07 18:16:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:15,823 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-12-07 18:16:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:15,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 460 [2019-12-07 18:16:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:15,843 INFO L225 Difference]: With dead ends: 9742 [2019-12-07 18:16:15,843 INFO L226 Difference]: Without dead ends: 5773 [2019-12-07 18:16:15,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-12-07 18:16:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-12-07 18:16:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-12-07 18:16:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-12-07 18:16:15,905 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 460 [2019-12-07 18:16:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:15,906 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-12-07 18:16:15,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-12-07 18:16:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-12-07 18:16:15,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:15,913 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:15,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash -56215097, now seen corresponding path program 1 times [2019-12-07 18:16:15,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:15,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748377908] [2019-12-07 18:16:15,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:16:16,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748377908] [2019-12-07 18:16:16,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:16,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:16:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758721257] [2019-12-07 18:16:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:16,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:16,186 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-12-07 18:16:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:18,561 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-12-07 18:16:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:18,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-12-07 18:16:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:18,579 INFO L225 Difference]: With dead ends: 10937 [2019-12-07 18:16:18,579 INFO L226 Difference]: Without dead ends: 5469 [2019-12-07 18:16:18,582 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-12-07 18:16:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-12-07 18:16:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-12-07 18:16:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-12-07 18:16:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-12-07 18:16:18,631 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 466 [2019-12-07 18:16:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:18,631 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-12-07 18:16:18,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-12-07 18:16:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-12-07 18:16:18,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:18,635 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 18:16:18,636 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1939420810, now seen corresponding path program 1 times [2019-12-07 18:16:18,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:18,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792227175] [2019-12-07 18:16:18,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-12-07 18:16:18,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792227175] [2019-12-07 18:16:18,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:18,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:16:18,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43788376] [2019-12-07 18:16:18,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:18,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:18,898 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 4 states. [2019-12-07 18:16:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:21,637 INFO L93 Difference]: Finished difference Result 17518 states and 20422 transitions. [2019-12-07 18:16:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:16:21,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-12-07 18:16:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:21,659 INFO L225 Difference]: With dead ends: 17518 [2019-12-07 18:16:21,659 INFO L226 Difference]: Without dead ends: 8466 [2019-12-07 18:16:21,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:16:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8466 states. [2019-12-07 18:16:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8466 to 7259. [2019-12-07 18:16:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-12-07 18:16:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 7879 transitions. [2019-12-07 18:16:21,738 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 7879 transitions. Word has length 489 [2019-12-07 18:16:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:21,738 INFO L462 AbstractCegarLoop]: Abstraction has 7259 states and 7879 transitions. [2019-12-07 18:16:21,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 7879 transitions. [2019-12-07 18:16:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 18:16:21,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:21,742 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:21,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1867065851, now seen corresponding path program 1 times [2019-12-07 18:16:21,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:21,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216627754] [2019-12-07 18:16:21,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-12-07 18:16:22,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216627754] [2019-12-07 18:16:22,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:22,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:16:22,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685207183] [2019-12-07 18:16:22,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:22,021 INFO L87 Difference]: Start difference. First operand 7259 states and 7879 transitions. Second operand 3 states. [2019-12-07 18:16:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:23,058 INFO L93 Difference]: Finished difference Result 14813 states and 16093 transitions. [2019-12-07 18:16:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:23,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-12-07 18:16:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:23,067 INFO L225 Difference]: With dead ends: 14813 [2019-12-07 18:16:23,067 INFO L226 Difference]: Without dead ends: 7556 [2019-12-07 18:16:23,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-12-07 18:16:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7257. [2019-12-07 18:16:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7257 states. [2019-12-07 18:16:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 7875 transitions. [2019-12-07 18:16:23,124 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 7875 transitions. Word has length 537 [2019-12-07 18:16:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:23,124 INFO L462 AbstractCegarLoop]: Abstraction has 7257 states and 7875 transitions. [2019-12-07 18:16:23,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 7875 transitions. [2019-12-07 18:16:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2019-12-07 18:16:23,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:23,129 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:23,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1537002235, now seen corresponding path program 1 times [2019-12-07 18:16:23,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:23,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119180440] [2019-12-07 18:16:23,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:16:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119180440] [2019-12-07 18:16:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:23,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:23,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261520990] [2019-12-07 18:16:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:16:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:16:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:16:23,573 INFO L87 Difference]: Start difference. First operand 7257 states and 7875 transitions. Second operand 6 states. [2019-12-07 18:16:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:25,104 INFO L93 Difference]: Finished difference Result 14603 states and 15841 transitions. [2019-12-07 18:16:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:16:25,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 571 [2019-12-07 18:16:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:25,120 INFO L225 Difference]: With dead ends: 14603 [2019-12-07 18:16:25,120 INFO L226 Difference]: Without dead ends: 7348 [2019-12-07 18:16:25,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:16:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states. [2019-12-07 18:16:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 7256. [2019-12-07 18:16:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-07 18:16:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 7806 transitions. [2019-12-07 18:16:25,193 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 7806 transitions. Word has length 571 [2019-12-07 18:16:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:25,194 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 7806 transitions. [2019-12-07 18:16:25,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:16:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 7806 transitions. [2019-12-07 18:16:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-12-07 18:16:25,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:25,199 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:25,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1415090238, now seen corresponding path program 1 times [2019-12-07 18:16:25,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:25,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277490318] [2019-12-07 18:16:25,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 392 proven. 34 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:16:25,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277490318] [2019-12-07 18:16:25,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576657695] [2019-12-07 18:16:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:25,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:16:25,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:16:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-12-07 18:16:26,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:16:26,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 18:16:26,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579618101] [2019-12-07 18:16:26,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:16:26,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:26,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:16:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:26,152 INFO L87 Difference]: Start difference. First operand 7256 states and 7806 transitions. Second operand 4 states. [2019-12-07 18:16:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:32,480 INFO L93 Difference]: Finished difference Result 19024 states and 20620 transitions. [2019-12-07 18:16:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:16:32,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 632 [2019-12-07 18:16:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:32,492 INFO L225 Difference]: With dead ends: 19024 [2019-12-07 18:16:32,492 INFO L226 Difference]: Without dead ends: 11770 [2019-12-07 18:16:32,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2019-12-07 18:16:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 9051. [2019-12-07 18:16:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9051 states. [2019-12-07 18:16:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 9789 transitions. [2019-12-07 18:16:32,595 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 9789 transitions. Word has length 632 [2019-12-07 18:16:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:32,596 INFO L462 AbstractCegarLoop]: Abstraction has 9051 states and 9789 transitions. [2019-12-07 18:16:32,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:16:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 9789 transitions. [2019-12-07 18:16:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-12-07 18:16:32,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:32,604 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:32,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:32,805 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1686621216, now seen corresponding path program 1 times [2019-12-07 18:16:32,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:32,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257836425] [2019-12-07 18:16:32,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 419 proven. 34 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:16:33,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257836425] [2019-12-07 18:16:33,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550116237] [2019-12-07 18:16:33,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:16:33,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:33,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:33,890 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 23 [2019-12-07 18:16:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-12-07 18:16:34,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:16:34,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 18:16:34,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955535296] [2019-12-07 18:16:34,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:34,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:34,231 INFO L87 Difference]: Start difference. First operand 9051 states and 9789 transitions. Second operand 3 states. [2019-12-07 18:16:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:37,313 INFO L93 Difference]: Finished difference Result 24103 states and 26050 transitions. [2019-12-07 18:16:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:37,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 661 [2019-12-07 18:16:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:37,324 INFO L225 Difference]: With dead ends: 24103 [2019-12-07 18:16:37,324 INFO L226 Difference]: Without dead ends: 15054 [2019-12-07 18:16:37,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15054 states. [2019-12-07 18:16:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15054 to 12347. [2019-12-07 18:16:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12347 states. [2019-12-07 18:16:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12347 states to 12347 states and 13419 transitions. [2019-12-07 18:16:37,437 INFO L78 Accepts]: Start accepts. Automaton has 12347 states and 13419 transitions. Word has length 661 [2019-12-07 18:16:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:37,438 INFO L462 AbstractCegarLoop]: Abstraction has 12347 states and 13419 transitions. [2019-12-07 18:16:37,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12347 states and 13419 transitions. [2019-12-07 18:16:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-12-07 18:16:37,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:37,444 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:37,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:37,645 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1561923461, now seen corresponding path program 1 times [2019-12-07 18:16:37,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:37,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017485617] [2019-12-07 18:16:37,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-12-07 18:16:37,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017485617] [2019-12-07 18:16:37,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:37,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:16:37,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309540551] [2019-12-07 18:16:37,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:37,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:37,993 INFO L87 Difference]: Start difference. First operand 12347 states and 13419 transitions. Second operand 3 states. [2019-12-07 18:16:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:39,245 INFO L93 Difference]: Finished difference Result 26784 states and 29160 transitions. [2019-12-07 18:16:39,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:39,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 666 [2019-12-07 18:16:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:39,255 INFO L225 Difference]: With dead ends: 26784 [2019-12-07 18:16:39,255 INFO L226 Difference]: Without dead ends: 14439 [2019-12-07 18:16:39,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14439 states. [2019-12-07 18:16:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14439 to 13841. [2019-12-07 18:16:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-12-07 18:16:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 14900 transitions. [2019-12-07 18:16:39,382 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 14900 transitions. Word has length 666 [2019-12-07 18:16:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:39,383 INFO L462 AbstractCegarLoop]: Abstraction has 13841 states and 14900 transitions. [2019-12-07 18:16:39,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 14900 transitions. [2019-12-07 18:16:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-12-07 18:16:39,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:39,402 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 18:16:39,402 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash -408992282, now seen corresponding path program 1 times [2019-12-07 18:16:39,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:39,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169875239] [2019-12-07 18:16:39,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-12-07 18:16:39,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169875239] [2019-12-07 18:16:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:16:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751823080] [2019-12-07 18:16:39,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:39,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:39,947 INFO L87 Difference]: Start difference. First operand 13841 states and 14900 transitions. Second operand 3 states. [2019-12-07 18:16:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:41,134 INFO L93 Difference]: Finished difference Result 30366 states and 32681 transitions. [2019-12-07 18:16:41,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:41,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 854 [2019-12-07 18:16:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:41,143 INFO L225 Difference]: With dead ends: 30366 [2019-12-07 18:16:41,143 INFO L226 Difference]: Without dead ends: 14733 [2019-12-07 18:16:41,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14733 states. [2019-12-07 18:16:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14733 to 14134. [2019-12-07 18:16:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14134 states. [2019-12-07 18:16:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14134 states to 14134 states and 14885 transitions. [2019-12-07 18:16:41,255 INFO L78 Accepts]: Start accepts. Automaton has 14134 states and 14885 transitions. Word has length 854 [2019-12-07 18:16:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:41,256 INFO L462 AbstractCegarLoop]: Abstraction has 14134 states and 14885 transitions. [2019-12-07 18:16:41,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14134 states and 14885 transitions. [2019-12-07 18:16:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2019-12-07 18:16:41,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:41,270 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-12-07 18:16:41,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash -497974071, now seen corresponding path program 1 times [2019-12-07 18:16:41,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:41,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647914713] [2019-12-07 18:16:41,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 1217 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-12-07 18:16:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647914713] [2019-12-07 18:16:41,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:41,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:16:41,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369675964] [2019-12-07 18:16:41,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:41,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:41,879 INFO L87 Difference]: Start difference. First operand 14134 states and 14885 transitions. Second operand 3 states. [2019-12-07 18:16:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:42,941 INFO L93 Difference]: Finished difference Result 31866 states and 33594 transitions. [2019-12-07 18:16:42,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:42,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 933 [2019-12-07 18:16:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:42,953 INFO L225 Difference]: With dead ends: 31866 [2019-12-07 18:16:42,953 INFO L226 Difference]: Without dead ends: 17734 [2019-12-07 18:16:42,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17734 states. [2019-12-07 18:16:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17734 to 16528. [2019-12-07 18:16:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16528 states. [2019-12-07 18:16:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 17374 transitions. [2019-12-07 18:16:43,089 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 17374 transitions. Word has length 933 [2019-12-07 18:16:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:43,090 INFO L462 AbstractCegarLoop]: Abstraction has 16528 states and 17374 transitions. [2019-12-07 18:16:43,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 17374 transitions. [2019-12-07 18:16:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2019-12-07 18:16:43,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:43,104 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:43,104 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash -605370242, now seen corresponding path program 1 times [2019-12-07 18:16:43,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:43,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618075010] [2019-12-07 18:16:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 507 proven. 1143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:46,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618075010] [2019-12-07 18:16:46,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054810228] [2019-12-07 18:16:46,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:46,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:16:46,186 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:46,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:46,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:16:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:16:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1076 proven. 386 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 18:16:48,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:48,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 23 [2019-12-07 18:16:48,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292436822] [2019-12-07 18:16:48,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:16:48,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:16:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:16:48,774 INFO L87 Difference]: Start difference. First operand 16528 states and 17374 transitions. Second operand 23 states. [2019-12-07 18:17:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:39,730 INFO L93 Difference]: Finished difference Result 53708 states and 56154 transitions. [2019-12-07 18:17:39,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-12-07 18:17:39,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1000 [2019-12-07 18:17:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:39,756 INFO L225 Difference]: With dead ends: 53708 [2019-12-07 18:17:39,756 INFO L226 Difference]: Without dead ends: 37182 [2019-12-07 18:17:39,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1080 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5117 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1842, Invalid=12200, Unknown=0, NotChecked=0, Total=14042 [2019-12-07 18:17:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37182 states. [2019-12-07 18:17:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37182 to 18327. [2019-12-07 18:17:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18327 states. [2019-12-07 18:17:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18327 states to 18327 states and 19197 transitions. [2019-12-07 18:17:39,986 INFO L78 Accepts]: Start accepts. Automaton has 18327 states and 19197 transitions. Word has length 1000 [2019-12-07 18:17:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:39,986 INFO L462 AbstractCegarLoop]: Abstraction has 18327 states and 19197 transitions. [2019-12-07 18:17:39,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:17:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18327 states and 19197 transitions. [2019-12-07 18:17:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-12-07 18:17:40,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:40,003 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:40,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:40,204 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash -441606722, now seen corresponding path program 1 times [2019-12-07 18:17:40,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:40,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54011027] [2019-12-07 18:17:40,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-12-07 18:17:40,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54011027] [2019-12-07 18:17:40,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:40,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:40,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637644663] [2019-12-07 18:17:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:40,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:40,858 INFO L87 Difference]: Start difference. First operand 18327 states and 19197 transitions. Second operand 3 states. [2019-12-07 18:17:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:41,914 INFO L93 Difference]: Finished difference Result 40839 states and 42591 transitions. [2019-12-07 18:17:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:41,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1009 [2019-12-07 18:17:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:41,928 INFO L225 Difference]: With dead ends: 40839 [2019-12-07 18:17:41,928 INFO L226 Difference]: Without dead ends: 22514 [2019-12-07 18:17:41,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22514 states. [2019-12-07 18:17:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22514 to 18918. [2019-12-07 18:17:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18918 states. [2019-12-07 18:17:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18918 states to 18918 states and 19714 transitions. [2019-12-07 18:17:42,101 INFO L78 Accepts]: Start accepts. Automaton has 18918 states and 19714 transitions. Word has length 1009 [2019-12-07 18:17:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:42,101 INFO L462 AbstractCegarLoop]: Abstraction has 18918 states and 19714 transitions. [2019-12-07 18:17:42,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 18918 states and 19714 transitions. [2019-12-07 18:17:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2019-12-07 18:17:42,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:42,121 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:42,121 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -598383656, now seen corresponding path program 1 times [2019-12-07 18:17:42,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:42,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768014766] [2019-12-07 18:17:42,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4153 backedges. 2331 proven. 1012 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-12-07 18:17:44,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768014766] [2019-12-07 18:17:44,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272836577] [2019-12-07 18:17:44,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:17:44,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:44,643 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 34 [2019-12-07 18:17:44,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:17:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4153 backedges. 1972 proven. 12 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-12-07 18:17:47,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:47,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-12-07 18:17:47,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713580112] [2019-12-07 18:17:47,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:17:47,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:17:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:17:47,859 INFO L87 Difference]: Start difference. First operand 18918 states and 19714 transitions. Second operand 15 states. [2019-12-07 18:18:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:09,391 INFO L93 Difference]: Finished difference Result 48904 states and 50727 transitions. [2019-12-07 18:18:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 18:18:09,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1324 [2019-12-07 18:18:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:09,391 INFO L225 Difference]: With dead ends: 48904 [2019-12-07 18:18:09,392 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:18:09,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1368 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=647, Invalid=3013, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 18:18:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:18:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:18:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:18:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:18:09,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1324 [2019-12-07 18:18:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:09,405 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:18:09,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:18:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:18:09,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:18:09,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:09,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:18:11,441 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 796 DAG size of output: 647 [2019-12-07 18:18:13,115 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 796 DAG size of output: 647 [2019-12-07 18:18:13,592 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 458 [2019-12-07 18:18:20,626 WARN L192 SmtUtils]: Spent 7.03 s on a formula simplification. DAG size of input: 621 DAG size of output: 140 [2019-12-07 18:18:28,811 WARN L192 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 621 DAG size of output: 140 [2019-12-07 18:18:32,457 WARN L192 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 448 DAG size of output: 139 [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,460 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:18:32,461 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:18:32,462 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:18:32,463 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:18:32,464 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,465 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,466 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,467 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,468 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,469 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,470 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse18 (+ ~a4~0 86))) (let ((.cse14 (+ ~a0~0 98)) (.cse17 (+ ~a0~0 147)) (.cse0 (<= .cse18 0)) (.cse15 (= 5 ~a2~0))) (let ((.cse4 (= 2 ~a2~0)) (.cse5 (<= 276784 ~a29~0)) (.cse9 (exists ((v_prenex_2 Int)) (let ((.cse21 (div v_prenex_2 5))) (let ((.cse22 (+ .cse21 1))) (let ((.cse20 (mod .cse22 63))) (and (not (= .cse20 0)) (not (= (mod v_prenex_2 5) 0)) (= (mod .cse21 63) 0) (< v_prenex_2 0) (< .cse22 0) (<= .cse20 (+ ~a29~0 116)))))))) (.cse3 (let ((.cse19 (not .cse15))) (or (and .cse0 .cse19) (and .cse19 (<= 0 (+ ~a0~0 44)))))) (.cse1 (<= .cse17 0)) (.cse8 (= 4 ~a2~0)) (.cse7 (<= ~a29~0 43)) (.cse12 (<= 0 (+ ~a29~0 323344))) (.cse6 (= 3 ~a2~0)) (.cse13 (< 0 (+ ~a29~0 144))) (.cse10 (<= .cse14 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse11 (< 0 .cse18))) (or (and .cse0 .cse1) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse4) (and .cse2 .cse5 .cse6) (and .cse2 .cse1 .cse4) (and .cse2 .cse3 .cse7 .cse8) (and .cse2 (= 1 ~a2~0)) (and .cse0 .cse9 .cse10) (and .cse11 .cse12 .cse4) (and .cse2 .cse11 .cse13 (< 0 .cse14) .cse8) (and .cse2 .cse3 .cse6) (and .cse2 .cse3 .cse13 .cse4) (and .cse10 .cse2 .cse3 .cse4) (and .cse2 .cse7 .cse13 .cse8) (and .cse2 .cse11 .cse8 .cse5) (and .cse9 .cse2 .cse15) (and .cse2 (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse3 .cse8) (and .cse2 .cse7 .cse1 .cse8) (and .cse2 .cse7 .cse12 .cse6) (and .cse10 .cse2 .cse6) (and .cse2 .cse11 .cse13 .cse15) (and .cse10 .cse2 (exists ((v_prenex_5 Int)) (let ((.cse16 (mod v_prenex_5 299928))) (and (< .cse16 599999) (not (= 0 (mod (+ .cse16 1) 5))) (not (= 0 (mod (+ .cse16 4) 5))) (not (= .cse16 0)) (< v_prenex_5 0) (< .cse16 300071) (<= (div (+ .cse16 (- 599999)) 5) (+ ~a29~0 203344))))) .cse11 (< 0 .cse17) .cse15))))) [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:18:32,471 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,472 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,473 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse18 (+ ~a4~0 86))) (let ((.cse14 (+ ~a0~0 98)) (.cse17 (+ ~a0~0 147)) (.cse0 (<= .cse18 0)) (.cse15 (= 5 ~a2~0))) (let ((.cse3 (let ((.cse22 (not .cse15))) (or (and .cse0 .cse22) (and .cse22 (<= 0 (+ ~a0~0 44)))))) (.cse4 (= 2 ~a2~0)) (.cse1 (<= .cse17 0)) (.cse8 (= 4 ~a2~0)) (.cse5 (<= 276784 ~a29~0)) (.cse9 (exists ((v_prenex_2 Int)) (let ((.cse20 (div v_prenex_2 5))) (let ((.cse21 (+ .cse20 1))) (let ((.cse19 (mod .cse21 63))) (and (not (= .cse19 0)) (not (= (mod v_prenex_2 5) 0)) (= (mod .cse20 63) 0) (< v_prenex_2 0) (< .cse21 0) (<= .cse19 (+ ~a29~0 116)))))))) (.cse7 (<= ~a29~0 43)) (.cse12 (<= 0 (+ ~a29~0 323344))) (.cse6 (= 3 ~a2~0)) (.cse13 (< 0 (+ ~a29~0 144))) (.cse10 (<= .cse14 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse11 (< 0 .cse18))) (or (and .cse0 .cse1) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse4) (and .cse2 .cse5 .cse6) (and .cse2 .cse1 .cse4) (and .cse2 .cse3 .cse7 .cse8) (and .cse0 .cse9 .cse10) (and .cse11 .cse12 .cse4) (and .cse2 (= 1 ~a2~0)) (and .cse2 .cse3 .cse6) (and .cse2 .cse3 .cse13 .cse4) (and .cse2 .cse11 .cse13 (< 0 .cse14) .cse8) (and .cse10 .cse2 .cse3 .cse4) (and .cse2 .cse7 .cse13 .cse8) (and .cse2 (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse8) (and .cse2 .cse1 .cse7 .cse8) (and .cse2 .cse11 .cse8 .cse5) (and .cse9 .cse2 .cse15) (and .cse2 .cse7 .cse12 .cse6) (and .cse10 .cse2 .cse6) (and .cse2 .cse11 .cse13 .cse15) (and .cse10 .cse2 (exists ((v_prenex_5 Int)) (let ((.cse16 (mod v_prenex_5 299928))) (and (< .cse16 599999) (not (= 0 (mod (+ .cse16 1) 5))) (not (= 0 (mod (+ .cse16 4) 5))) (not (= .cse16 0)) (< v_prenex_5 0) (< .cse16 300071) (<= (div (+ .cse16 (- 599999)) 5) (+ ~a29~0 203344))))) .cse11 (< 0 .cse17) .cse15))))) [2019-12-07 18:18:32,473 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:18:32,474 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:18:32,475 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:18:32,476 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse18 (+ ~a4~0 86))) (let ((.cse14 (+ ~a0~0 98)) (.cse17 (+ ~a0~0 147)) (.cse0 (<= .cse18 0)) (.cse15 (= 5 ~a2~0))) (let ((.cse3 (let ((.cse22 (not .cse15))) (or (and .cse0 .cse22) (and .cse22 (<= 0 (+ ~a0~0 44)))))) (.cse4 (= 2 ~a2~0)) (.cse1 (<= .cse17 0)) (.cse8 (= 4 ~a2~0)) (.cse5 (<= 276784 ~a29~0)) (.cse9 (exists ((v_prenex_2 Int)) (let ((.cse20 (div v_prenex_2 5))) (let ((.cse21 (+ .cse20 1))) (let ((.cse19 (mod .cse21 63))) (and (not (= .cse19 0)) (not (= (mod v_prenex_2 5) 0)) (= (mod .cse20 63) 0) (< v_prenex_2 0) (< .cse21 0) (<= .cse19 (+ ~a29~0 116)))))))) (.cse7 (<= ~a29~0 43)) (.cse12 (<= 0 (+ ~a29~0 323344))) (.cse6 (= 3 ~a2~0)) (.cse13 (< 0 (+ ~a29~0 144))) (.cse10 (<= .cse14 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse11 (< 0 .cse18))) (or (and .cse0 .cse1) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse4) (and .cse2 .cse5 .cse6) (and .cse2 .cse1 .cse4) (and .cse2 .cse3 .cse7 .cse8) (and .cse0 .cse9 .cse10) (and .cse11 .cse12 .cse4) (and .cse2 (= 1 ~a2~0)) (and .cse2 .cse3 .cse6) (and .cse2 .cse3 .cse13 .cse4) (and .cse2 .cse11 .cse13 (< 0 .cse14) .cse8) (and .cse10 .cse2 .cse3 .cse4) (and .cse2 .cse7 .cse13 .cse8) (and .cse2 (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse8) (and .cse2 .cse1 .cse7 .cse8) (and .cse2 .cse11 .cse8 .cse5) (and .cse9 .cse2 .cse15) (and .cse2 .cse7 .cse12 .cse6) (and .cse10 .cse2 .cse6) (and .cse2 .cse11 .cse13 .cse15) (and .cse10 .cse2 (exists ((v_prenex_5 Int)) (let ((.cse16 (mod v_prenex_5 299928))) (and (< .cse16 599999) (not (= 0 (mod (+ .cse16 1) 5))) (not (= 0 (mod (+ .cse16 4) 5))) (not (= .cse16 0)) (< v_prenex_5 0) (< .cse16 300071) (<= (div (+ .cse16 (- 599999)) 5) (+ ~a29~0 203344))))) .cse11 (< 0 .cse17) .cse15))))) [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,477 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,478 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,479 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:18:32,480 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:18:32,481 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,482 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,482 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:18:32,482 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:18:32,482 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 18:18:32,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:18:32 BoogieIcfgContainer [2019-12-07 18:18:32,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:18:32,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:18:32,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:18:32,530 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:18:32,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:00" (3/4) ... [2019-12-07 18:18:32,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:18:32,558 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 18:18:32,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:18:32,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) [2019-12-07 18:18:32,591 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) [2019-12-07 18:18:32,600 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && a0 + 147 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) [2019-12-07 18:18:32,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_20a959ca-5028-40b6-8a59-bf6c7e9d17df/bin/uautomizer/witness.graphml [2019-12-07 18:18:32,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:18:32,704 INFO L168 Benchmark]: Toolchain (without parser) took 155726.29 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 928.6 MB in the beginning and 1.4 GB in the end (delta: -509.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,704 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:18:32,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 928.6 MB in the beginning and 1.0 GB in the end (delta: -82.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,705 INFO L168 Benchmark]: Boogie Preprocessor took 129.45 ms. Allocated memory is still 1.1 GB. Free memory was 973.0 MB in the beginning and 951.3 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,705 INFO L168 Benchmark]: RCFGBuilder took 2390.27 ms. Allocated memory is still 1.1 GB. Free memory was 951.3 MB in the beginning and 884.8 MB in the end (delta: 66.5 MB). Peak memory consumption was 153.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,706 INFO L168 Benchmark]: TraceAbstraction took 152210.79 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 884.8 MB in the beginning and 1.5 GB in the end (delta: -654.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,706 INFO L168 Benchmark]: Witness Printer took 173.48 ms. Allocated memory is still 3.0 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:18:32,707 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 928.6 MB in the beginning and 1.0 GB in the end (delta: -82.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 973.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.45 ms. Allocated memory is still 1.1 GB. Free memory was 973.0 MB in the beginning and 951.3 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2390.27 ms. Allocated memory is still 1.1 GB. Free memory was 951.3 MB in the beginning and 884.8 MB in the end (delta: 66.5 MB). Peak memory consumption was 153.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152210.79 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 884.8 MB in the beginning and 1.5 GB in the end (delta: -654.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 173.48 ms. Allocated memory is still 3.0 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,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_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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-12-07 18:18:32,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 18:18:32,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 18:18:32,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 18:18:32,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 86 <= 0 && a0 + 147 <= 0) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a0 + 61) && !(4 == input)) && 2 == a2)) || ((a4 + 42 <= 0 && 276784 <= a29) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 43) && 4 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || ((a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116)) && a0 + 98 <= 0)) || ((0 < a4 + 86 && 0 <= a29 + 323344) && 2 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 0 < a0 + 98) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 144) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((\exists v_prenex_2 : int :: ((((!((v_prenex_2 / 5 + 1) % 63 == 0) && !(v_prenex_2 % 5 == 0)) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116) && a4 + 42 <= 0) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && a0 + 147 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && !(v_prenex_5 % 299928 == 0)) && v_prenex_5 < 0) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344)) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) - 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: 129.2s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 108.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.8s, HoareTripleCheckerStatistics: 5364 SDtfs, 40461 SDslu, 2346 SDs, 0 SdLazy, 87676 SolverSat, 8341 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 85.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4202 GetRequests, 3970 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6252 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18918occurred 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: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 34583 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 519 NumberOfFragments, 1759 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1331340 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1273724 FormulaSimplificationTreeSizeReductionInter, 18.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 14154 NumberOfCodeBlocks, 14154 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 14132 ConstructedInterpolants, 736 QuantifiedInterpolants, 57293609 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4516 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 19287/21911 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...