./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.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_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:23:41,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:23:41,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:23:41,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:23:41,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:23:41,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:23:41,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:23:41,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:23:41,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:23:41,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:23:41,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:23:41,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:23:41,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:23:41,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:23:41,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:23:41,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:23:41,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:23:41,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:23:41,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:23:41,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:23:41,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:23:41,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:23:41,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:23:41,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:23:41,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:23:41,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:23:41,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:23:41,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:23:41,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:23:41,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:23:41,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:23:41,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:23:41,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:23:41,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:23:41,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:23:41,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:23:41,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:23:41,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:23:41,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:23:41,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:23:41,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:23:41,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:23:41,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:23:41,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:23:41,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:23:41,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:23:41,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:23:41,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:23:41,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:23:42,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:23:42,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:23:42,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:23:42,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:23:42,001 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_802fdf04-856d-43be-b073-4ed2989f5ccb/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 -> fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 [2019-12-07 16:23:42,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:23:42,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:23:42,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:23:42,110 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:23:42,110 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:23:42,111 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-12-07 16:23:42,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/data/2a3709a8d/ebf3a66af78d4b0cb810359a9ab65db6/FLAGd4f96bf40 [2019-12-07 16:23:42,587 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:23:42,587 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-12-07 16:23:42,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/data/2a3709a8d/ebf3a66af78d4b0cb810359a9ab65db6/FLAGd4f96bf40 [2019-12-07 16:23:42,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/data/2a3709a8d/ebf3a66af78d4b0cb810359a9ab65db6 [2019-12-07 16:23:42,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:23:42,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:23:42,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:23:42,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:23:42,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:23:42,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:23:42" (1/1) ... [2019-12-07 16:23:42,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436dd22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:42, skipping insertion in model container [2019-12-07 16:23:42,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:23:42" (1/1) ... [2019-12-07 16:23:42,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:23:42,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:23:43,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:23:43,284 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:23:43,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:23:43,385 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:23:43,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43 WrapperNode [2019-12-07 16:23:43,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:23:43,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:23:43,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:23:43,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:23:43,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:23:43,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:23:43,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:23:43,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:23:43,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... [2019-12-07 16:23:43,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:23:43,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:23:43,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:23:43,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:23:43,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:23:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:23:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:23:44,577 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:23:44,577 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:23:44,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:44 BoogieIcfgContainer [2019-12-07 16:23:44,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:23:44,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:23:44,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:23:44,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:23:44,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:23:42" (1/3) ... [2019-12-07 16:23:44,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a3962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:23:44, skipping insertion in model container [2019-12-07 16:23:44,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:43" (2/3) ... [2019-12-07 16:23:44,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a3962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:23:44, skipping insertion in model container [2019-12-07 16:23:44,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:44" (3/3) ... [2019-12-07 16:23:44,583 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2019-12-07 16:23:44,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:23:44,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:23:44,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:23:44,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:23:44,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:23:44,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:23:44,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:23:44,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:23:44,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:23:44,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:23:44,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:23:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 16:23:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:23:44,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:44,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:44,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-12-07 16:23:44,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:44,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162620870] [2019-12-07 16:23:44,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:44,868 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 16:23:44,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162620870] [2019-12-07 16:23:44,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:44,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:44,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115670896] [2019-12-07 16:23:44,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:44,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:44,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:44,890 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 16:23:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:46,083 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-12-07 16:23:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:46,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 16:23:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:46,097 INFO L225 Difference]: With dead ends: 968 [2019-12-07 16:23:46,097 INFO L226 Difference]: Without dead ends: 602 [2019-12-07 16:23:46,100 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 16:23:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-07 16:23:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-12-07 16:23:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:23:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-12-07 16:23:46,145 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 48 [2019-12-07 16:23:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:46,145 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-12-07 16:23:46,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-12-07 16:23:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 16:23:46,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:46,149 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 16:23:46,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2122398730, now seen corresponding path program 1 times [2019-12-07 16:23:46,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:46,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206370303] [2019-12-07 16:23:46,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:46,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206370303] [2019-12-07 16:23:46,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:46,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:46,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203561929] [2019-12-07 16:23:46,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:46,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:46,243 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-12-07 16:23:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:47,230 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-12-07 16:23:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:47,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 16:23:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:47,237 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 16:23:47,237 INFO L226 Difference]: Without dead ends: 1162 [2019-12-07 16:23:47,239 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 16:23:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-07 16:23:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-12-07 16:23:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-12-07 16:23:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1565 transitions. [2019-12-07 16:23:47,271 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1565 transitions. Word has length 116 [2019-12-07 16:23:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:47,272 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 1565 transitions. [2019-12-07 16:23:47,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1565 transitions. [2019-12-07 16:23:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 16:23:47,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:47,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:23:47,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1068723632, now seen corresponding path program 1 times [2019-12-07 16:23:47,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:47,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411675918] [2019-12-07 16:23:47,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:47,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411675918] [2019-12-07 16:23:47,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:47,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:47,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306632653] [2019-12-07 16:23:47,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:47,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:47,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:47,409 INFO L87 Difference]: Start difference. First operand 1148 states and 1565 transitions. Second operand 4 states. [2019-12-07 16:23:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:48,456 INFO L93 Difference]: Finished difference Result 4144 states and 5715 transitions. [2019-12-07 16:23:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:48,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 16:23:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:48,468 INFO L225 Difference]: With dead ends: 4144 [2019-12-07 16:23:48,468 INFO L226 Difference]: Without dead ends: 2998 [2019-12-07 16:23:48,469 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 16:23:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-12-07 16:23:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-12-07 16:23:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-12-07 16:23:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3663 transitions. [2019-12-07 16:23:48,511 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3663 transitions. Word has length 141 [2019-12-07 16:23:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:48,512 INFO L462 AbstractCegarLoop]: Abstraction has 2998 states and 3663 transitions. [2019-12-07 16:23:48,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3663 transitions. [2019-12-07 16:23:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-12-07 16:23:48,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:48,515 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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 16:23:48,515 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash -381057166, now seen corresponding path program 1 times [2019-12-07 16:23:48,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:48,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011163094] [2019-12-07 16:23:48,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011163094] [2019-12-07 16:23:48,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:48,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:23:48,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770491295] [2019-12-07 16:23:48,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:48,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:48,699 INFO L87 Difference]: Start difference. First operand 2998 states and 3663 transitions. Second operand 4 states. [2019-12-07 16:23:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:49,723 INFO L93 Difference]: Finished difference Result 7485 states and 9308 transitions. [2019-12-07 16:23:49,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:49,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-12-07 16:23:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:49,745 INFO L225 Difference]: With dead ends: 7485 [2019-12-07 16:23:49,745 INFO L226 Difference]: Without dead ends: 4673 [2019-12-07 16:23:49,749 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 16:23:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2019-12-07 16:23:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4470. [2019-12-07 16:23:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2019-12-07 16:23:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5440 transitions. [2019-12-07 16:23:49,822 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5440 transitions. Word has length 236 [2019-12-07 16:23:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:49,823 INFO L462 AbstractCegarLoop]: Abstraction has 4470 states and 5440 transitions. [2019-12-07 16:23:49,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5440 transitions. [2019-12-07 16:23:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-12-07 16:23:49,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:49,827 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:23:49,827 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash -356634931, now seen corresponding path program 1 times [2019-12-07 16:23:49,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:49,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477784480] [2019-12-07 16:23:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:23:49,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477784480] [2019-12-07 16:23:49,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:49,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:49,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984600436] [2019-12-07 16:23:49,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:49,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:49,945 INFO L87 Difference]: Start difference. First operand 4470 states and 5440 transitions. Second operand 3 states. [2019-12-07 16:23:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:50,575 INFO L93 Difference]: Finished difference Result 10041 states and 12450 transitions. [2019-12-07 16:23:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:50,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-12-07 16:23:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:50,594 INFO L225 Difference]: With dead ends: 10041 [2019-12-07 16:23:50,594 INFO L226 Difference]: Without dead ends: 5757 [2019-12-07 16:23:50,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-07 16:23:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5572. [2019-12-07 16:23:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-12-07 16:23:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 6703 transitions. [2019-12-07 16:23:50,664 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 6703 transitions. Word has length 251 [2019-12-07 16:23:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:50,665 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 6703 transitions. [2019-12-07 16:23:50,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 6703 transitions. [2019-12-07 16:23:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-12-07 16:23:50,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:50,669 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:23:50,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1030741549, now seen corresponding path program 1 times [2019-12-07 16:23:50,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:50,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595160318] [2019-12-07 16:23:50,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 66 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:51,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595160318] [2019-12-07 16:23:51,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174183051] [2019-12-07 16:23:51,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:23:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:51,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:51,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:51,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:23:51,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:23:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:51,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:23:51,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:23:51,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430275836] [2019-12-07 16:23:51,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:51,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:51,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:23:51,480 INFO L87 Difference]: Start difference. First operand 5572 states and 6703 transitions. Second operand 4 states. [2019-12-07 16:23:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:53,128 INFO L93 Difference]: Finished difference Result 15571 states and 18826 transitions. [2019-12-07 16:23:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:53,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-12-07 16:23:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:53,162 INFO L225 Difference]: With dead ends: 15571 [2019-12-07 16:23:53,162 INFO L226 Difference]: Without dead ends: 10185 [2019-12-07 16:23:53,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:23:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10185 states. [2019-12-07 16:23:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10185 to 9443. [2019-12-07 16:23:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2019-12-07 16:23:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 11279 transitions. [2019-12-07 16:23:53,328 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 11279 transitions. Word has length 267 [2019-12-07 16:23:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 9443 states and 11279 transitions. [2019-12-07 16:23:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 11279 transitions. [2019-12-07 16:23:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 16:23:53,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:53,333 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:53,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:53,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1546626242, now seen corresponding path program 1 times [2019-12-07 16:23:53,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:53,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494551817] [2019-12-07 16:23:53,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 16:23:53,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494551817] [2019-12-07 16:23:53,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794969640] [2019-12-07 16:23:53,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:23:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:53,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:23:53,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:23:53,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:23:53,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-12-07 16:23:53,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102394719] [2019-12-07 16:23:53,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:53,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:53,896 INFO L87 Difference]: Start difference. First operand 9443 states and 11279 transitions. Second operand 3 states. [2019-12-07 16:23:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:54,500 INFO L93 Difference]: Finished difference Result 18514 states and 22156 transitions. [2019-12-07 16:23:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:54,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-12-07 16:23:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:54,522 INFO L225 Difference]: With dead ends: 18514 [2019-12-07 16:23:54,522 INFO L226 Difference]: Without dead ends: 9257 [2019-12-07 16:23:54,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 279 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 16:23:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2019-12-07 16:23:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 9257. [2019-12-07 16:23:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9257 states. [2019-12-07 16:23:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9257 states to 9257 states and 10788 transitions. [2019-12-07 16:23:54,609 INFO L78 Accepts]: Start accepts. Automaton has 9257 states and 10788 transitions. Word has length 278 [2019-12-07 16:23:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:54,609 INFO L462 AbstractCegarLoop]: Abstraction has 9257 states and 10788 transitions. [2019-12-07 16:23:54,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9257 states and 10788 transitions. [2019-12-07 16:23:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 16:23:54,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:54,614 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:54,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:54,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash 627435673, now seen corresponding path program 1 times [2019-12-07 16:23:54,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:54,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873170590] [2019-12-07 16:23:54,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:55,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873170590] [2019-12-07 16:23:55,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:55,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:23:55,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060608165] [2019-12-07 16:23:55,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:55,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:55,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:55,055 INFO L87 Difference]: Start difference. First operand 9257 states and 10788 transitions. Second operand 4 states. [2019-12-07 16:23:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:55,800 INFO L93 Difference]: Finished difference Result 19084 states and 22277 transitions. [2019-12-07 16:23:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:55,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-12-07 16:23:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:55,815 INFO L225 Difference]: With dead ends: 19084 [2019-12-07 16:23:55,815 INFO L226 Difference]: Without dead ends: 10013 [2019-12-07 16:23:55,822 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 16:23:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-12-07 16:23:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 9627. [2019-12-07 16:23:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9627 states. [2019-12-07 16:23:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 11195 transitions. [2019-12-07 16:23:55,897 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 11195 transitions. Word has length 281 [2019-12-07 16:23:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:55,897 INFO L462 AbstractCegarLoop]: Abstraction has 9627 states and 11195 transitions. [2019-12-07 16:23:55,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 11195 transitions. [2019-12-07 16:23:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 16:23:55,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:55,903 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:23:55,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1328057524, now seen corresponding path program 1 times [2019-12-07 16:23:55,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:55,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277492040] [2019-12-07 16:23:55,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 107 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:56,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277492040] [2019-12-07 16:23:56,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317700373] [2019-12-07 16:23:56,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:23:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:56,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:56,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:56,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:23:56,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:23:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-12-07 16:23:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:23:56,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 16:23:56,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303225966] [2019-12-07 16:23:56,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:56,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:23:56,587 INFO L87 Difference]: Start difference. First operand 9627 states and 11195 transitions. Second operand 3 states. [2019-12-07 16:24:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:26,956 INFO L93 Difference]: Finished difference Result 22027 states and 25765 transitions. [2019-12-07 16:24:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:24:26,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-12-07 16:24:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:26,971 INFO L225 Difference]: With dead ends: 22027 [2019-12-07 16:24:26,971 INFO L226 Difference]: Without dead ends: 12034 [2019-12-07 16:24:26,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:24:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2019-12-07 16:24:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 11847. [2019-12-07 16:24:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-12-07 16:24:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13785 transitions. [2019-12-07 16:24:27,073 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13785 transitions. Word has length 305 [2019-12-07 16:24:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:27,073 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13785 transitions. [2019-12-07 16:24:27,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:24:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13785 transitions. [2019-12-07 16:24:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-12-07 16:24:27,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:27,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 16:24:27,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:27,279 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 510288335, now seen corresponding path program 1 times [2019-12-07 16:24:27,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:27,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483367028] [2019-12-07 16:24:27,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 16:24:27,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483367028] [2019-12-07 16:24:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:24:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630945546] [2019-12-07 16:24:27,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:24:27,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:24:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:24:27,419 INFO L87 Difference]: Start difference. First operand 11847 states and 13785 transitions. Second operand 3 states. [2019-12-07 16:24:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:28,115 INFO L93 Difference]: Finished difference Result 25531 states and 29730 transitions. [2019-12-07 16:24:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:24:28,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-12-07 16:24:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:28,126 INFO L225 Difference]: With dead ends: 25531 [2019-12-07 16:24:28,126 INFO L226 Difference]: Without dead ends: 13134 [2019-12-07 16:24:28,136 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 16:24:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2019-12-07 16:24:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 10914. [2019-12-07 16:24:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10914 states. [2019-12-07 16:24:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 12544 transitions. [2019-12-07 16:24:28,220 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 12544 transitions. Word has length 310 [2019-12-07 16:24:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:28,221 INFO L462 AbstractCegarLoop]: Abstraction has 10914 states and 12544 transitions. [2019-12-07 16:24:28,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:24:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 12544 transitions. [2019-12-07 16:24:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 16:24:28,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:28,226 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:28,226 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2040805826, now seen corresponding path program 1 times [2019-12-07 16:24:28,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:28,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687510892] [2019-12-07 16:24:28,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 16:24:28,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687510892] [2019-12-07 16:24:28,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:28,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:24:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867900793] [2019-12-07 16:24:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:24:28,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:24:28,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:24:28,391 INFO L87 Difference]: Start difference. First operand 10914 states and 12544 transitions. Second operand 3 states. [2019-12-07 16:24:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:29,016 INFO L93 Difference]: Finished difference Result 22200 states and 25551 transitions. [2019-12-07 16:24:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:24:29,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-12-07 16:24:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:29,024 INFO L225 Difference]: With dead ends: 22200 [2019-12-07 16:24:29,024 INFO L226 Difference]: Without dead ends: 11104 [2019-12-07 16:24:29,031 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 16:24:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-12-07 16:24:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10182. [2019-12-07 16:24:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-12-07 16:24:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11676 transitions. [2019-12-07 16:24:29,103 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11676 transitions. Word has length 335 [2019-12-07 16:24:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:29,103 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11676 transitions. [2019-12-07 16:24:29,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:24:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11676 transitions. [2019-12-07 16:24:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-12-07 16:24:29,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:29,108 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:29,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1721381139, now seen corresponding path program 1 times [2019-12-07 16:24:29,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:29,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432501349] [2019-12-07 16:24:29,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 16:24:29,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432501349] [2019-12-07 16:24:29,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:29,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:24:29,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887374116] [2019-12-07 16:24:29,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:24:29,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:29,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:24:29,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:24:29,260 INFO L87 Difference]: Start difference. First operand 10182 states and 11676 transitions. Second operand 4 states. [2019-12-07 16:24:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:30,210 INFO L93 Difference]: Finished difference Result 20750 states and 23777 transitions. [2019-12-07 16:24:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:24:30,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-12-07 16:24:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:30,216 INFO L225 Difference]: With dead ends: 20750 [2019-12-07 16:24:30,216 INFO L226 Difference]: Without dead ends: 10754 [2019-12-07 16:24:30,221 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 16:24:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10754 states. [2019-12-07 16:24:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10754 to 10182. [2019-12-07 16:24:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-12-07 16:24:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11490 transitions. [2019-12-07 16:24:30,286 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11490 transitions. Word has length 336 [2019-12-07 16:24:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:30,287 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11490 transitions. [2019-12-07 16:24:30,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:24:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11490 transitions. [2019-12-07 16:24:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-12-07 16:24:30,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:30,293 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:24:30,293 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1682522593, now seen corresponding path program 1 times [2019-12-07 16:24:30,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:30,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399868731] [2019-12-07 16:24:30,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 46 proven. 391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:30,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399868731] [2019-12-07 16:24:30,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677480911] [2019-12-07 16:24:30,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:24:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:30,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:24:30,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:24:30,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:24:30,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 16:24:30,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557524671] [2019-12-07 16:24:30,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:24:30,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:24:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:24:30,961 INFO L87 Difference]: Start difference. First operand 10182 states and 11490 transitions. Second operand 4 states. [2019-12-07 16:24:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:32,325 INFO L93 Difference]: Finished difference Result 22762 states and 25749 transitions. [2019-12-07 16:24:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:24:32,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-12-07 16:24:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:32,336 INFO L225 Difference]: With dead ends: 22762 [2019-12-07 16:24:32,336 INFO L226 Difference]: Without dead ends: 12766 [2019-12-07 16:24:32,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:24:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12766 states. [2019-12-07 16:24:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12766 to 12024. [2019-12-07 16:24:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-12-07 16:24:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13467 transitions. [2019-12-07 16:24:32,424 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13467 transitions. Word has length 379 [2019-12-07 16:24:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:32,424 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13467 transitions. [2019-12-07 16:24:32,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:24:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13467 transitions. [2019-12-07 16:24:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-12-07 16:24:32,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:32,431 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:24:32,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:32,632 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 732027564, now seen corresponding path program 1 times [2019-12-07 16:24:32,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:32,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746645628] [2019-12-07 16:24:32,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 16:24:32,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746645628] [2019-12-07 16:24:32,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:32,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:24:32,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932725838] [2019-12-07 16:24:32,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:24:32,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:24:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:24:32,813 INFO L87 Difference]: Start difference. First operand 12024 states and 13467 transitions. Second operand 4 states. [2019-12-07 16:24:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:33,765 INFO L93 Difference]: Finished difference Result 24059 states and 26951 transitions. [2019-12-07 16:24:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:24:33,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-12-07 16:24:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:33,774 INFO L225 Difference]: With dead ends: 24059 [2019-12-07 16:24:33,774 INFO L226 Difference]: Without dead ends: 12221 [2019-12-07 16:24:33,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:24:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12221 states. [2019-12-07 16:24:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12221 to 12024. [2019-12-07 16:24:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-12-07 16:24:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13243 transitions. [2019-12-07 16:24:33,880 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13243 transitions. Word has length 379 [2019-12-07 16:24:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:33,880 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13243 transitions. [2019-12-07 16:24:33,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:24:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13243 transitions. [2019-12-07 16:24:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-12-07 16:24:33,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:33,889 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:33,889 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1821887244, now seen corresponding path program 1 times [2019-12-07 16:24:33,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:33,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926129249] [2019-12-07 16:24:33,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 443 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:34,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926129249] [2019-12-07 16:24:34,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728044129] [2019-12-07 16:24:34,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/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 16:24:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:34,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:24:34,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 16:24:34,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:24:34,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 16:24:34,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573704143] [2019-12-07 16:24:34,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:24:34,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:24:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:24:34,395 INFO L87 Difference]: Start difference. First operand 12024 states and 13243 transitions. Second operand 3 states. [2019-12-07 16:24:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:34,934 INFO L93 Difference]: Finished difference Result 24052 states and 26514 transitions. [2019-12-07 16:24:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:24:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-12-07 16:24:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:34,942 INFO L225 Difference]: With dead ends: 24052 [2019-12-07 16:24:34,942 INFO L226 Difference]: Without dead ends: 12214 [2019-12-07 16:24:34,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:24:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-07 16:24:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12210. [2019-12-07 16:24:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12210 states. [2019-12-07 16:24:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12210 states to 12210 states and 13440 transitions. [2019-12-07 16:24:35,026 INFO L78 Accepts]: Start accepts. Automaton has 12210 states and 13440 transitions. Word has length 384 [2019-12-07 16:24:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:35,027 INFO L462 AbstractCegarLoop]: Abstraction has 12210 states and 13440 transitions. [2019-12-07 16:24:35,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:24:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12210 states and 13440 transitions. [2019-12-07 16:24:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-12-07 16:24:35,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:35,035 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:35,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:35,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1802628130, now seen corresponding path program 1 times [2019-12-07 16:24:35,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:35,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309774056] [2019-12-07 16:24:35,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 42 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:36,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309774056] [2019-12-07 16:24:36,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577904872] [2019-12-07 16:24:36,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:36,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:24:36,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:36,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:36,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:24:36,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:36,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:24:36,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:24:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:36,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:24:36,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-12-07 16:24:36,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920512051] [2019-12-07 16:24:36,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:24:36,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:24:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:24:36,966 INFO L87 Difference]: Start difference. First operand 12210 states and 13440 transitions. Second operand 17 states. [2019-12-07 16:24:46,282 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-07 16:24:46,866 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 16:24:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:50,623 INFO L93 Difference]: Finished difference Result 35933 states and 39469 transitions. [2019-12-07 16:24:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 16:24:50,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 415 [2019-12-07 16:24:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:50,637 INFO L225 Difference]: With dead ends: 35933 [2019-12-07 16:24:50,637 INFO L226 Difference]: Without dead ends: 23909 [2019-12-07 16:24:50,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 16:24:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23909 states. [2019-12-07 16:24:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23909 to 15154. [2019-12-07 16:24:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15154 states. [2019-12-07 16:24:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15154 states to 15154 states and 16548 transitions. [2019-12-07 16:24:50,785 INFO L78 Accepts]: Start accepts. Automaton has 15154 states and 16548 transitions. Word has length 415 [2019-12-07 16:24:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 15154 states and 16548 transitions. [2019-12-07 16:24:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:24:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15154 states and 16548 transitions. [2019-12-07 16:24:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-12-07 16:24:50,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:50,797 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 16:24:50,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:50,998 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 930313157, now seen corresponding path program 1 times [2019-12-07 16:24:50,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:51,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586159143] [2019-12-07 16:24:51,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-12-07 16:24:51,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586159143] [2019-12-07 16:24:51,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:51,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:24:51,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386245893] [2019-12-07 16:24:51,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:24:51,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:24:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:24:51,271 INFO L87 Difference]: Start difference. First operand 15154 states and 16548 transitions. Second operand 4 states. [2019-12-07 16:24:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:52,820 INFO L93 Difference]: Finished difference Result 32532 states and 35532 transitions. [2019-12-07 16:24:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:24:52,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2019-12-07 16:24:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:52,831 INFO L225 Difference]: With dead ends: 32532 [2019-12-07 16:24:52,831 INFO L226 Difference]: Without dead ends: 17012 [2019-12-07 16:24:52,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 16:24:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17012 states. [2019-12-07 16:24:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17012 to 14974. [2019-12-07 16:24:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14974 states. [2019-12-07 16:24:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14974 states to 14974 states and 16173 transitions. [2019-12-07 16:24:52,957 INFO L78 Accepts]: Start accepts. Automaton has 14974 states and 16173 transitions. Word has length 432 [2019-12-07 16:24:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:52,957 INFO L462 AbstractCegarLoop]: Abstraction has 14974 states and 16173 transitions. [2019-12-07 16:24:52,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:24:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14974 states and 16173 transitions. [2019-12-07 16:24:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-12-07 16:24:52,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:52,969 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:52,969 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -82825745, now seen corresponding path program 1 times [2019-12-07 16:24:52,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:24:52,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128867262] [2019-12-07 16:24:52,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 88 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:54,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128867262] [2019-12-07 16:24:54,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788206234] [2019-12-07 16:24:54,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:54,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:24:54,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:54,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:24:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 543 proven. 222 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:24:54,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:24:54,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-12-07 16:24:54,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984977419] [2019-12-07 16:24:54,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:24:54,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:24:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:24:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:24:54,878 INFO L87 Difference]: Start difference. First operand 14974 states and 16173 transitions. Second operand 18 states. [2019-12-07 16:25:01,570 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 16:25:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:25:22,583 INFO L93 Difference]: Finished difference Result 48279 states and 52136 transitions. [2019-12-07 16:25:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 16:25:22,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 534 [2019-12-07 16:25:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:25:22,618 INFO L225 Difference]: With dead ends: 48279 [2019-12-07 16:25:22,618 INFO L226 Difference]: Without dead ends: 33491 [2019-12-07 16:25:22,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1289, Invalid=3541, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 16:25:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33491 states. [2019-12-07 16:25:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33491 to 13308. [2019-12-07 16:25:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13308 states. [2019-12-07 16:25:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13308 states to 13308 states and 14289 transitions. [2019-12-07 16:25:22,809 INFO L78 Accepts]: Start accepts. Automaton has 13308 states and 14289 transitions. Word has length 534 [2019-12-07 16:25:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:25:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 13308 states and 14289 transitions. [2019-12-07 16:25:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:25:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 13308 states and 14289 transitions. [2019-12-07 16:25:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-12-07 16:25:22,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:25:22,818 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:25:23,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:23,019 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:25:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:25:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash 762866496, now seen corresponding path program 1 times [2019-12-07 16:25:23,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:25:23,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555397042] [2019-12-07 16:25:23,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:25:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 101 proven. 488 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 16:25:23,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555397042] [2019-12-07 16:25:23,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48891497] [2019-12-07 16:25:23,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:23,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:25:23,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:25:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 235 proven. 452 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 16:25:24,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:25:24,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 16:25:24,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003334879] [2019-12-07 16:25:24,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:25:24,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:25:24,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:25:24,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:25:24,083 INFO L87 Difference]: Start difference. First operand 13308 states and 14289 transitions. Second operand 8 states. [2019-12-07 16:25:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:25:26,559 INFO L93 Difference]: Finished difference Result 37133 states and 39785 transitions. [2019-12-07 16:25:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:25:26,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 570 [2019-12-07 16:25:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:25:26,577 INFO L225 Difference]: With dead ends: 37133 [2019-12-07 16:25:26,577 INFO L226 Difference]: Without dead ends: 24565 [2019-12-07 16:25:26,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:25:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24565 states. [2019-12-07 16:25:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24565 to 14600. [2019-12-07 16:25:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-12-07 16:25:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 15687 transitions. [2019-12-07 16:25:26,761 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 15687 transitions. Word has length 570 [2019-12-07 16:25:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:25:26,761 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 15687 transitions. [2019-12-07 16:25:26,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:25:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 15687 transitions. [2019-12-07 16:25:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-12-07 16:25:26,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:25:26,769 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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] [2019-12-07 16:25:26,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:26,970 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:25:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:25:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1272720062, now seen corresponding path program 1 times [2019-12-07 16:25:26,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:25:26,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519386321] [2019-12-07 16:25:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:25:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 655 proven. 496 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 16:25:27,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519386321] [2019-12-07 16:25:27,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834606719] [2019-12-07 16:25:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:27,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:25:27,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:25:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 785 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-12-07 16:25:27,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:25:27,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 16:25:27,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832672675] [2019-12-07 16:25:27,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:25:27,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:25:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:25:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:25:27,956 INFO L87 Difference]: Start difference. First operand 14600 states and 15687 transitions. Second operand 12 states. [2019-12-07 16:25:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:25:36,450 INFO L93 Difference]: Finished difference Result 41558 states and 44483 transitions. [2019-12-07 16:25:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 16:25:36,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 574 [2019-12-07 16:25:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:25:36,469 INFO L225 Difference]: With dead ends: 41558 [2019-12-07 16:25:36,470 INFO L226 Difference]: Without dead ends: 27698 [2019-12-07 16:25:36,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:25:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27698 states. [2019-12-07 16:25:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27698 to 13114. [2019-12-07 16:25:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13114 states. [2019-12-07 16:25:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 13937 transitions. [2019-12-07 16:25:36,632 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 13937 transitions. Word has length 574 [2019-12-07 16:25:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:25:36,632 INFO L462 AbstractCegarLoop]: Abstraction has 13114 states and 13937 transitions. [2019-12-07 16:25:36,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:25:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 13937 transitions. [2019-12-07 16:25:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-12-07 16:25:36,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:25:36,640 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:25:36,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:36,842 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:25:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:25:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1877441688, now seen corresponding path program 1 times [2019-12-07 16:25:36,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:25:36,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401631014] [2019-12-07 16:25:36,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:25:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 826 proven. 250 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-12-07 16:25:37,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401631014] [2019-12-07 16:25:37,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695745043] [2019-12-07 16:25:37,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:37,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:25:37,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:25:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 747 proven. 237 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 16:25:37,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:25:37,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 8 [2019-12-07 16:25:37,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325717399] [2019-12-07 16:25:37,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:25:37,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:25:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:25:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:25:37,722 INFO L87 Difference]: Start difference. First operand 13114 states and 13937 transitions. Second operand 8 states. [2019-12-07 16:25:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:25:42,285 INFO L93 Difference]: Finished difference Result 34704 states and 36826 transitions. [2019-12-07 16:25:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:25:42,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 641 [2019-12-07 16:25:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:25:42,296 INFO L225 Difference]: With dead ends: 34704 [2019-12-07 16:25:42,296 INFO L226 Difference]: Without dead ends: 18276 [2019-12-07 16:25:42,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:25:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-07 16:25:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11818. [2019-12-07 16:25:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11818 states. [2019-12-07 16:25:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 12363 transitions. [2019-12-07 16:25:42,421 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 12363 transitions. Word has length 641 [2019-12-07 16:25:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:25:42,422 INFO L462 AbstractCegarLoop]: Abstraction has 11818 states and 12363 transitions. [2019-12-07 16:25:42,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:25:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 12363 transitions. [2019-12-07 16:25:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2019-12-07 16:25:42,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:25:42,433 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:25:42,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:42,635 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:25:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:25:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash 809804742, now seen corresponding path program 1 times [2019-12-07 16:25:42,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:25:42,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399824668] [2019-12-07 16:25:42,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:25:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 540 proven. 1728 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-12-07 16:25:43,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399824668] [2019-12-07 16:25:43,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106404048] [2019-12-07 16:25:43,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:25:43,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:25:44,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:25:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:25:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 390 proven. 1976 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-12-07 16:25:45,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:25:45,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 16:25:45,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745421520] [2019-12-07 16:25:45,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:25:45,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:25:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:25:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:25:45,756 INFO L87 Difference]: Start difference. First operand 11818 states and 12363 transitions. Second operand 16 states. [2019-12-07 16:25:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:25:57,746 INFO L93 Difference]: Finished difference Result 35827 states and 37512 transitions. [2019-12-07 16:25:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 16:25:57,746 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 982 [2019-12-07 16:25:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:25:57,747 INFO L225 Difference]: With dead ends: 35827 [2019-12-07 16:25:57,747 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:25:57,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 975 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 16:25:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:25:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:25:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:25:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:25:57,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 982 [2019-12-07 16:25:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:25:57,756 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:25:57,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:25:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:25:57,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:25:57,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:25:57,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:26:01,106 WARN L192 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 1151 DAG size of output: 935 [2019-12-07 16:26:04,097 WARN L192 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 1151 DAG size of output: 935 [2019-12-07 16:26:17,390 WARN L192 SmtUtils]: Spent 13.29 s on a formula simplification. DAG size of input: 887 DAG size of output: 166 [2019-12-07 16:26:29,742 WARN L192 SmtUtils]: Spent 12.35 s on a formula simplification. DAG size of input: 887 DAG size of output: 166 [2019-12-07 16:26:29,744 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,745 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse23 (+ ~a23~0 43))) (let ((.cse4 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse11 (= ~a25~0 9)) (.cse13 (= ~a25~0 10)) (.cse7 (<= 0 (+ ~a23~0 16))) (.cse15 (exists ((v_~a29~0_500 Int)) (let ((.cse24 (mod v_~a29~0_500 15))) (and (<= (+ .cse24 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse24))))) (.cse21 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse22 (<= (+ ~a23~0 127599) 0)) (.cse18 (<= 0 (+ ~a23~0 600262))) (.cse14 (<= .cse23 0)) (.cse9 (<= ~a29~0 140)) (.cse0 (= ~a25~0 12)) (.cse10 (< 138 ~a23~0)) (.cse6 (<= ~a29~0 277)) (.cse3 (= 1 ~a4~0)) (.cse16 (= ~a25~0 11)) (.cse17 (<= 0 (+ ~a23~0 577712))) (.cse20 (= ~a25~0 13)) (.cse5 (<= ~a4~0 0)) (.cse12 (< 0 .cse23)) (.cse1 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse8 (<= ~a23~0 247))) (or (and .cse0 (<= 437925 ~a23~0) .cse1 .cse2 .cse3 (<= ~a29~0 220)) (and .cse4 .cse0 .cse5 .cse1 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0)))) .cse9) (and .cse11 .cse12 .cse1 .cse2 .cse3) (and .cse11 .cse3 .cse10 .cse9) (and .cse3 .cse13 .cse14) (and (or (and .cse11 .cse15 .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse1 (<= 0 (+ ~a23~0 599717)) .cse2 .cse3)) (<= 0 (+ ~a23~0 599908))) (and (not .cse16) .cse5 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse1 (<= ~a23~0 306) .cse2 .cse3 .cse16 .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse17 .cse6 .cse16 .cse14) (and .cse0 .cse5 .cse1 .cse7 .cse2 .cse8) (and .cse5 .cse1 .cse18 .cse2 .cse13 .cse9) (and .cse11 (exists ((v_~a29~0_503 Int)) (let ((.cse19 (mod v_~a29~0_503 299861))) (and (<= (+ .cse19 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse19)))) .cse5 .cse1 .cse2 .cse14) (and .cse20 .cse1 .cse2 .cse3 .cse10) (and .cse20 .cse1 .cse2 .cse6 .cse3 (<= 130 ~a29~0) .cse14) (and .cse1 .cse2 .cse3 .cse13) (and .cse15 .cse1 .cse7 .cse2 .cse3 .cse16) (and .cse5 .cse15 .cse1 .cse21 .cse22 .cse2 .cse16) (and .cse0 .cse5 .cse1 .cse21 .cse22 .cse2) (and .cse0 .cse5 .cse1 .cse18 .cse2 .cse6) (and .cse5 .cse1 (not .cse20) .cse18 .cse2 .cse14 .cse9) (and (< 140 ~a29~0) .cse1 .cse2 (or (and .cse0 .cse6 .cse3 .cse10) (and .cse6 .cse3 .cse16)) .cse17) (and .cse20 .cse5 .cse12 .cse1 .cse2 .cse8)))) [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,746 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,747 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,748 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,749 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 16:26:29,750 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,751 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,752 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 16:26:29,753 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,754 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,755 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 16:26:29,756 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 16:26:29,757 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,758 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse23 (+ ~a23~0 43))) (let ((.cse4 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse11 (= ~a25~0 9)) (.cse13 (= ~a25~0 10)) (.cse7 (<= 0 (+ ~a23~0 16))) (.cse15 (exists ((v_~a29~0_500 Int)) (let ((.cse24 (mod v_~a29~0_500 15))) (and (<= (+ .cse24 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse24))))) (.cse21 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse22 (<= (+ ~a23~0 127599) 0)) (.cse18 (<= 0 (+ ~a23~0 600262))) (.cse14 (<= .cse23 0)) (.cse9 (<= ~a29~0 140)) (.cse0 (= ~a25~0 12)) (.cse10 (< 138 ~a23~0)) (.cse6 (<= ~a29~0 277)) (.cse3 (= 1 ~a4~0)) (.cse16 (= ~a25~0 11)) (.cse17 (<= 0 (+ ~a23~0 577712))) (.cse20 (= ~a25~0 13)) (.cse5 (<= ~a4~0 0)) (.cse12 (< 0 .cse23)) (.cse1 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse8 (<= ~a23~0 247))) (or (and .cse0 (<= 437925 ~a23~0) .cse1 .cse2 .cse3 (<= ~a29~0 220)) (and .cse4 .cse0 .cse5 .cse1 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0)))) .cse9) (and .cse11 .cse12 .cse1 .cse2 .cse3) (and .cse11 .cse3 .cse10 .cse9) (and .cse3 .cse13 .cse14) (and (or (and .cse11 .cse15 .cse1 .cse2 .cse3) (and .cse4 .cse11 .cse1 (<= 0 (+ ~a23~0 599717)) .cse2 .cse3)) (<= 0 (+ ~a23~0 599908))) (and (not .cse16) .cse5 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse1 (<= ~a23~0 306) .cse2 .cse3 .cse16 .cse10) (and .cse4 .cse5 .cse1 .cse2 .cse17 .cse6 .cse16 .cse14) (and .cse0 .cse5 .cse1 .cse7 .cse2 .cse8) (and .cse5 .cse1 .cse18 .cse2 .cse13 .cse9) (and .cse11 (exists ((v_~a29~0_503 Int)) (let ((.cse19 (mod v_~a29~0_503 299861))) (and (<= (+ .cse19 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse19)))) .cse5 .cse1 .cse2 .cse14) (and .cse20 .cse1 .cse2 .cse3 .cse10) (and .cse20 .cse1 .cse2 .cse6 .cse3 (<= 130 ~a29~0) .cse14) (and .cse1 .cse2 .cse3 .cse13) (and .cse15 .cse1 .cse7 .cse2 .cse3 .cse16) (and .cse5 .cse15 .cse1 .cse21 .cse22 .cse2 .cse16) (and .cse0 .cse5 .cse1 .cse21 .cse22 .cse2) (and .cse0 .cse5 .cse1 .cse18 .cse2 .cse6) (and .cse5 .cse1 (not .cse20) .cse18 .cse2 .cse14 .cse9) (and (< 140 ~a29~0) .cse1 .cse2 (or (and .cse0 .cse6 .cse3 .cse10) (and .cse6 .cse3 .cse16)) .cse17) (and .cse20 .cse5 .cse12 .cse1 .cse2 .cse8)))) [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,759 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:26:29,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:26:29 BoogieIcfgContainer [2019-12-07 16:26:29,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:26:29,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:26:29,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:26:29,801 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:26:29,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:44" (3/4) ... [2019-12-07 16:26:29,804 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:26:29,822 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 16:26:29,824 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:26:29,844 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 12 && 437925 <= a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 220) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 12) && a4 <= 0) && 1 == a3) && 15 == a8) && a29 <= 277)) || ((((((a25 == 12 && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && 1 == a4) && a29 <= 140)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247) && 138 < a23)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0))) && a29 <= 140)) || ((((a25 == 9 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 1 == a4) && 138 < a23) && a29 <= 140)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 15 == a8) && 1 == a4) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 9) && 1 == a3) && 0 <= a23 + 599717) && 15 == a8) && 1 == a4)) && 0 <= a23 + 599908)) || ((((((!(a25 == 11) && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) && a29 <= 140)) || (((((1 == a3 && a23 <= 306) && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || ((((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a4 <= 0) && 1 == a3) && 15 == a8) && 0 <= a23 + 577712) && a29 <= 277) && a25 == 11) && a23 + 43 <= 0)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247)) || (((((a4 <= 0 && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((a25 == 13 && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8) && a25 == 11)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a29 <= 277)) || ((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0) && a29 <= 140)) || ((((140 < a29 && 1 == a3) && 15 == a8) && ((((a25 == 12 && a29 <= 277) && 1 == a4) && 138 < a23) || ((a29 <= 277 && 1 == a4) && a25 == 11))) && 0 <= a23 + 577712)) || (((((a25 == 13 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) [2019-12-07 16:26:29,846 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a25 == 12 && 437925 <= a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 220) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 12) && a4 <= 0) && 1 == a3) && 15 == a8) && a29 <= 277)) || ((((((a25 == 12 && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && 1 == a4) && a29 <= 140)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247) && 138 < a23)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0))) && a29 <= 140)) || ((((a25 == 9 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 1 == a4) && 138 < a23) && a29 <= 140)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 15 == a8) && 1 == a4) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 9) && 1 == a3) && 0 <= a23 + 599717) && 15 == a8) && 1 == a4)) && 0 <= a23 + 599908)) || ((((((!(a25 == 11) && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) && a29 <= 140)) || (((((1 == a3 && a23 <= 306) && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || ((((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a4 <= 0) && 1 == a3) && 15 == a8) && 0 <= a23 + 577712) && a29 <= 277) && a25 == 11) && a23 + 43 <= 0)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247)) || (((((a4 <= 0 && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((a25 == 13 && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8) && a25 == 11)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a29 <= 277)) || ((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0) && a29 <= 140)) || ((((140 < a29 && 1 == a3) && 15 == a8) && ((((a25 == 12 && a29 <= 277) && 1 == a4) && 138 < a23) || ((a29 <= 277 && 1 == a4) && a25 == 11))) && 0 <= a23 + 577712)) || (((((a25 == 13 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) [2019-12-07 16:26:29,930 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_802fdf04-856d-43be-b073-4ed2989f5ccb/bin/uautomizer/witness.graphml [2019-12-07 16:26:29,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:26:29,931 INFO L168 Benchmark]: Toolchain (without parser) took 167023.86 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 938.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 178.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,931 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:26:29,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -128.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,932 INFO L168 Benchmark]: Boogie Preprocessor took 67.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,932 INFO L168 Benchmark]: RCFGBuilder took 1043.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 860.1 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,932 INFO L168 Benchmark]: TraceAbstraction took 165221.67 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 860.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,933 INFO L168 Benchmark]: Witness Printer took 129.68 ms. Allocated memory is still 2.9 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:26:29,934 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -128.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1043.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 860.1 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 165221.67 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 860.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 129.68 ms. Allocated memory is still 2.9 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 16:26:29,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 12 && 437925 <= a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 220) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 12) && a4 <= 0) && 1 == a3) && 15 == a8) && a29 <= 277)) || ((((((a25 == 12 && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && 1 == a4) && a29 <= 140)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247) && 138 < a23)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0))) && a29 <= 140)) || ((((a25 == 9 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 1 == a4) && 138 < a23) && a29 <= 140)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 15 == a8) && 1 == a4) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 9) && 1 == a3) && 0 <= a23 + 599717) && 15 == a8) && 1 == a4)) && 0 <= a23 + 599908)) || ((((((!(a25 == 11) && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) && a29 <= 140)) || (((((1 == a3 && a23 <= 306) && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || ((((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a4 <= 0) && 1 == a3) && 15 == a8) && 0 <= a23 + 577712) && a29 <= 277) && a25 == 11) && a23 + 43 <= 0)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247)) || (((((a4 <= 0 && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((a25 == 13 && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8) && a25 == 11)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a29 <= 277)) || ((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0) && a29 <= 140)) || ((((140 < a29 && 1 == a3) && 15 == a8) && ((((a25 == 12 && a29 <= 277) && 1 == a4) && 138 < a23) || ((a29 <= 277 && 1 == a4) && a25 == 11))) && 0 <= a23 + 577712)) || (((((a25 == 13 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 16:26:29,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 16:26:29,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a25 == 12 && 437925 <= a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 220) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 12) && a4 <= 0) && 1 == a3) && 15 == a8) && a29 <= 277)) || ((((((a25 == 12 && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && 1 == a4) && a29 <= 140)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247) && 138 < a23)) || (((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0))) && a29 <= 140)) || ((((a25 == 9 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 1 == a4) && 138 < a23) && a29 <= 140)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 15 == a8) && 1 == a4) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a25 == 9) && 1 == a3) && 0 <= a23 + 599717) && 15 == a8) && 1 == a4)) && 0 <= a23 + 599908)) || ((((((!(a25 == 11) && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) && a29 <= 140)) || (((((1 == a3 && a23 <= 306) && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || ((((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && a4 <= 0) && 1 == a3) && 15 == a8) && 0 <= a23 + 577712) && a29 <= 277) && a25 == 11) && a23 + 43 <= 0)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && a23 <= 247)) || (((((a4 <= 0 && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((a25 == 13 && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && 0 <= a23 + 16) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8) && a25 == 11)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a23 + 127599 <= 0) && 15 == a8)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8) && a29 <= 277)) || ((((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0) && a29 <= 140)) || ((((140 < a29 && 1 == a3) && 15 == a8) && ((((a25 == 12 && a29 <= 277) && 1 == a4) && 138 < a23) || ((a29 <= 277 && 1 == a4) && a25 == 11))) && 0 <= a23 + 577712)) || (((((a25 == 13 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a23 <= 247) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 133.3s, OverallIterations: 22, TraceHistogramMax: 8, AutomataDifference: 114.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.7s, HoareTripleCheckerStatistics: 3590 SDtfs, 28471 SDslu, 1739 SDs, 0 SdLazy, 67931 SolverSat, 7463 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 94.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5594 GetRequests, 5343 SyntacticMatches, 8 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15154occurred 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: 2.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 68552 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 346 NumberOfFragments, 1363 HoareAnnotationTreeSize, 3 FomulaSimplifications, 14295690 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7389180 FormulaSimplificationTreeSizeReductionInter, 25.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 13523 NumberOfCodeBlocks, 13523 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 13490 ConstructedInterpolants, 564 QuantifiedInterpolants, 40447792 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6925 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 12360/20429 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...