./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label49.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_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label49.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/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 9482400b4e5abae1b3b62ba7b184a5c605e6ed8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:56:56,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:56:56,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:56:56,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:56:56,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:56:56,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:56:56,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:56:56,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:56:56,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:56:56,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:56:56,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:56:56,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:56:56,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:56:56,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:56:56,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:56:56,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:56:56,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:56:56,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:56:56,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:56:56,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:56:56,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:56:56,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:56:56,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:56:56,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:56:56,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:56:56,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:56:56,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:56:56,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:56:56,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:56:56,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:56:56,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:56:56,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:56:56,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:56:56,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:56:56,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:56:56,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:56:56,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:56:56,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:56:56,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:56:56,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:56:56,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:56:56,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:56:56,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:56:56,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:56:56,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:56:56,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:56:56,660 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:56:56,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:56:56,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:56:56,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:56:56,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:56:56,661 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:56:56,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:56:56,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:56:56,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:56:56,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:56:56,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:56:56,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:56:56,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:56:56,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:56:56,663 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_8484f510-da58-4b76-b713-e175190851bc/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 -> 9482400b4e5abae1b3b62ba7b184a5c605e6ed8f [2019-12-07 18:56:56,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:56:56,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:56:56,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:56:56,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:56:56,785 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:56:56,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2019-12-07 18:56:56,824 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/data/962143013/5be37d02b0894b7aa40c5ced9822d0af/FLAGf65b1e45b [2019-12-07 18:56:57,265 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:56:57,265 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2019-12-07 18:56:57,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/data/962143013/5be37d02b0894b7aa40c5ced9822d0af/FLAGf65b1e45b [2019-12-07 18:56:57,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/data/962143013/5be37d02b0894b7aa40c5ced9822d0af [2019-12-07 18:56:57,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:56:57,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:56:57,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:56:57,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:56:57,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:56:57,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:57,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3d67c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57, skipping insertion in model container [2019-12-07 18:56:57,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:57,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:56:57,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:56:57,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:56:57,790 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:56:57,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:56:57,956 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:56:57,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57 WrapperNode [2019-12-07 18:56:57,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:56:57,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:56:57,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:56:57,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:56:57,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:57,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:56:58,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:56:58,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:56:58,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:56:58,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... [2019-12-07 18:56:58,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:56:58,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:56:58,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:56:58,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:56:58,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:56:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:56:58,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:57:00,487 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:57:00,487 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:57:00,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:57:00 BoogieIcfgContainer [2019-12-07 18:57:00,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:57:00,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:57:00,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:57:00,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:57:00,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:56:57" (1/3) ... [2019-12-07 18:57:00,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573b8b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:57:00, skipping insertion in model container [2019-12-07 18:57:00,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:56:57" (2/3) ... [2019-12-07 18:57:00,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573b8b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:57:00, skipping insertion in model container [2019-12-07 18:57:00,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:57:00" (3/3) ... [2019-12-07 18:57:00,493 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2019-12-07 18:57:00,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:57:00,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:57:00,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:57:00,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:57:00,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:57:00,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:57:00,533 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:57:00,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:57:00,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:57:00,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:57:00,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:57:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:57:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:57:00,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:00,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:00,555 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-12-07 18:57:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996995617] [2019-12-07 18:57:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:00,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996995617] [2019-12-07 18:57:00,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:00,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:57:00,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996972817] [2019-12-07 18:57:00,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:00,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:00,794 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:57:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:03,254 INFO L93 Difference]: Finished difference Result 1468 states and 2718 transitions. [2019-12-07 18:57:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:03,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 18:57:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:03,286 INFO L225 Difference]: With dead ends: 1468 [2019-12-07 18:57:03,286 INFO L226 Difference]: Without dead ends: 977 [2019-12-07 18:57:03,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-12-07 18:57:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2019-12-07 18:57:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-07 18:57:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1487 transitions. [2019-12-07 18:57:03,351 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1487 transitions. Word has length 52 [2019-12-07 18:57:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:03,352 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1487 transitions. [2019-12-07 18:57:03,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:57:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1487 transitions. [2019-12-07 18:57:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 18:57:03,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:03,358 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:03,358 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 804988061, now seen corresponding path program 1 times [2019-12-07 18:57:03,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:03,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049142726] [2019-12-07 18:57:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:03,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049142726] [2019-12-07 18:57:03,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:03,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:57:03,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521020812] [2019-12-07 18:57:03,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:03,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:03,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:03,500 INFO L87 Difference]: Start difference. First operand 973 states and 1487 transitions. Second operand 4 states. [2019-12-07 18:57:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:05,546 INFO L93 Difference]: Finished difference Result 3746 states and 5750 transitions. [2019-12-07 18:57:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:05,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 18:57:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:05,557 INFO L225 Difference]: With dead ends: 3746 [2019-12-07 18:57:05,557 INFO L226 Difference]: Without dead ends: 2775 [2019-12-07 18:57:05,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-12-07 18:57:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-12-07 18:57:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-12-07 18:57:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2495 transitions. [2019-12-07 18:57:05,593 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2495 transitions. Word has length 171 [2019-12-07 18:57:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:05,593 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 2495 transitions. [2019-12-07 18:57:05,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:57:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2495 transitions. [2019-12-07 18:57:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-12-07 18:57:05,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:05,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:05,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 649952050, now seen corresponding path program 1 times [2019-12-07 18:57:05,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:05,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946832609] [2019-12-07 18:57:05,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 18:57:05,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946832609] [2019-12-07 18:57:05,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691751683] [2019-12-07 18:57:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:05,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:57:05,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:57:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:05,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:57:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 18:57:05,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481473597] [2019-12-07 18:57:05,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:57:05,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:57:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:05,925 INFO L87 Difference]: Start difference. First operand 1872 states and 2495 transitions. Second operand 3 states. [2019-12-07 18:57:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:08,405 INFO L93 Difference]: Finished difference Result 4938 states and 6528 transitions. [2019-12-07 18:57:08,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:57:08,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-12-07 18:57:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:08,417 INFO L225 Difference]: With dead ends: 4938 [2019-12-07 18:57:08,417 INFO L226 Difference]: Without dead ends: 3068 [2019-12-07 18:57:08,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-12-07 18:57:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2171. [2019-12-07 18:57:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-12-07 18:57:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2848 transitions. [2019-12-07 18:57:08,451 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2848 transitions. Word has length 248 [2019-12-07 18:57:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:08,452 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 2848 transitions. [2019-12-07 18:57:08,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:57:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2848 transitions. [2019-12-07 18:57:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-12-07 18:57:08,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:08,456 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:08,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:08,657 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1262660511, now seen corresponding path program 1 times [2019-12-07 18:57:08,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:08,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279905990] [2019-12-07 18:57:08,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 18:57:09,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279905990] [2019-12-07 18:57:09,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:09,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:57:09,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782802387] [2019-12-07 18:57:09,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:57:09,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:57:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:09,002 INFO L87 Difference]: Start difference. First operand 2171 states and 2848 transitions. Second operand 5 states. [2019-12-07 18:57:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:12,157 INFO L93 Difference]: Finished difference Result 5239 states and 6673 transitions. [2019-12-07 18:57:12,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:12,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2019-12-07 18:57:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:12,167 INFO L225 Difference]: With dead ends: 5239 [2019-12-07 18:57:12,168 INFO L226 Difference]: Without dead ends: 3070 [2019-12-07 18:57:12,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2019-12-07 18:57:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2770. [2019-12-07 18:57:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2019-12-07 18:57:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3489 transitions. [2019-12-07 18:57:12,199 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3489 transitions. Word has length 330 [2019-12-07 18:57:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:12,200 INFO L462 AbstractCegarLoop]: Abstraction has 2770 states and 3489 transitions. [2019-12-07 18:57:12,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:57:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3489 transitions. [2019-12-07 18:57:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-12-07 18:57:12,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:12,205 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:12,205 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 746881843, now seen corresponding path program 1 times [2019-12-07 18:57:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:12,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793780444] [2019-12-07 18:57:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:12,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793780444] [2019-12-07 18:57:12,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:12,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:57:12,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544815510] [2019-12-07 18:57:12,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:12,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:12,405 INFO L87 Difference]: Start difference. First operand 2770 states and 3489 transitions. Second operand 4 states. [2019-12-07 18:57:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:15,265 INFO L93 Difference]: Finished difference Result 6745 states and 8667 transitions. [2019-12-07 18:57:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:15,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 404 [2019-12-07 18:57:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:15,279 INFO L225 Difference]: With dead ends: 6745 [2019-12-07 18:57:15,280 INFO L226 Difference]: Without dead ends: 3977 [2019-12-07 18:57:15,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2019-12-07 18:57:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3974. [2019-12-07 18:57:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-12-07 18:57:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 4917 transitions. [2019-12-07 18:57:15,323 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 4917 transitions. Word has length 404 [2019-12-07 18:57:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:15,324 INFO L462 AbstractCegarLoop]: Abstraction has 3974 states and 4917 transitions. [2019-12-07 18:57:15,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:57:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 4917 transitions. [2019-12-07 18:57:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-12-07 18:57:15,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:15,327 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:15,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1419669949, now seen corresponding path program 1 times [2019-12-07 18:57:15,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:15,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096116438] [2019-12-07 18:57:15,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:15,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096116438] [2019-12-07 18:57:15,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095456401] [2019-12-07 18:57:15,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:15,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:57:15,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:57:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:57:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 155 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:16,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:57:16,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-12-07 18:57:16,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225750325] [2019-12-07 18:57:16,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:57:16,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:57:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:57:16,225 INFO L87 Difference]: Start difference. First operand 3974 states and 4917 transitions. Second operand 10 states. [2019-12-07 18:57:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:41,959 INFO L93 Difference]: Finished difference Result 37359 states and 47567 transitions. [2019-12-07 18:57:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 18:57:41,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 429 [2019-12-07 18:57:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:42,025 INFO L225 Difference]: With dead ends: 37359 [2019-12-07 18:57:42,025 INFO L226 Difference]: Without dead ends: 30098 [2019-12-07 18:57:42,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:57:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30098 states. [2019-12-07 18:57:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30098 to 17476. [2019-12-07 18:57:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17476 states. [2019-12-07 18:57:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17476 states to 17476 states and 20540 transitions. [2019-12-07 18:57:42,254 INFO L78 Accepts]: Start accepts. Automaton has 17476 states and 20540 transitions. Word has length 429 [2019-12-07 18:57:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:42,255 INFO L462 AbstractCegarLoop]: Abstraction has 17476 states and 20540 transitions. [2019-12-07 18:57:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:57:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17476 states and 20540 transitions. [2019-12-07 18:57:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 18:57:42,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:42,261 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:42,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:42,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1533398278, now seen corresponding path program 1 times [2019-12-07 18:57:42,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:42,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765815693] [2019-12-07 18:57:42,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:57:42,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765815693] [2019-12-07 18:57:42,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:42,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:57:42,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527862678] [2019-12-07 18:57:42,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:42,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:42,771 INFO L87 Difference]: Start difference. First operand 17476 states and 20540 transitions. Second operand 4 states. [2019-12-07 18:57:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:45,109 INFO L93 Difference]: Finished difference Result 34656 states and 40770 transitions. [2019-12-07 18:57:45,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:45,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2019-12-07 18:57:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:45,137 INFO L225 Difference]: With dead ends: 34656 [2019-12-07 18:57:45,137 INFO L226 Difference]: Without dead ends: 17182 [2019-12-07 18:57:45,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17182 states. [2019-12-07 18:57:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17182 to 17174. [2019-12-07 18:57:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17174 states. [2019-12-07 18:57:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17174 states to 17174 states and 19222 transitions. [2019-12-07 18:57:45,301 INFO L78 Accepts]: Start accepts. Automaton has 17174 states and 19222 transitions. Word has length 530 [2019-12-07 18:57:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:45,302 INFO L462 AbstractCegarLoop]: Abstraction has 17174 states and 19222 transitions. [2019-12-07 18:57:45,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:57:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17174 states and 19222 transitions. [2019-12-07 18:57:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-12-07 18:57:45,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:45,309 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:45,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash 572216286, now seen corresponding path program 1 times [2019-12-07 18:57:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:45,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598616366] [2019-12-07 18:57:45,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 262 proven. 140 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 18:57:46,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598616366] [2019-12-07 18:57:46,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296108588] [2019-12-07 18:57:46,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:46,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:57:46,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:57:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 18:57:46,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:57:46,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:57:46,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186594696] [2019-12-07 18:57:46,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:57:46,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:57:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:57:46,387 INFO L87 Difference]: Start difference. First operand 17174 states and 19222 transitions. Second operand 3 states. [2019-12-07 18:57:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:47,540 INFO L93 Difference]: Finished difference Result 34944 states and 39074 transitions. [2019-12-07 18:57:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:57:47,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 615 [2019-12-07 18:57:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:47,558 INFO L225 Difference]: With dead ends: 34944 [2019-12-07 18:57:47,558 INFO L226 Difference]: Without dead ends: 17772 [2019-12-07 18:57:47,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 615 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:57:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2019-12-07 18:57:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 17473. [2019-12-07 18:57:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17473 states. [2019-12-07 18:57:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17473 states to 17473 states and 19327 transitions. [2019-12-07 18:57:47,704 INFO L78 Accepts]: Start accepts. Automaton has 17473 states and 19327 transitions. Word has length 615 [2019-12-07 18:57:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:47,704 INFO L462 AbstractCegarLoop]: Abstraction has 17473 states and 19327 transitions. [2019-12-07 18:57:47,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:57:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17473 states and 19327 transitions. [2019-12-07 18:57:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-12-07 18:57:47,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:47,713 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:47,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:47,914 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash -670688848, now seen corresponding path program 1 times [2019-12-07 18:57:47,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:47,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706149344] [2019-12-07 18:57:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-12-07 18:57:48,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706149344] [2019-12-07 18:57:48,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:48,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:57:48,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582699256] [2019-12-07 18:57:48,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:57:48,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:57:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:48,279 INFO L87 Difference]: Start difference. First operand 17473 states and 19327 transitions. Second operand 5 states. [2019-12-07 18:57:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:50,278 INFO L93 Difference]: Finished difference Result 40568 states and 44652 transitions. [2019-12-07 18:57:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:57:50,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 654 [2019-12-07 18:57:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:50,295 INFO L225 Difference]: With dead ends: 40568 [2019-12-07 18:57:50,295 INFO L226 Difference]: Without dead ends: 17416 [2019-12-07 18:57:50,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17416 states. [2019-12-07 18:57:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17416 to 11716. [2019-12-07 18:57:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11716 states. [2019-12-07 18:57:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11716 states to 11716 states and 12212 transitions. [2019-12-07 18:57:50,409 INFO L78 Accepts]: Start accepts. Automaton has 11716 states and 12212 transitions. Word has length 654 [2019-12-07 18:57:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:50,409 INFO L462 AbstractCegarLoop]: Abstraction has 11716 states and 12212 transitions. [2019-12-07 18:57:50,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:57:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11716 states and 12212 transitions. [2019-12-07 18:57:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-12-07 18:57:50,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:50,417 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:50,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1083835968, now seen corresponding path program 1 times [2019-12-07 18:57:50,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:50,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950578418] [2019-12-07 18:57:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 264 proven. 435 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 18:57:51,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950578418] [2019-12-07 18:57:51,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994820883] [2019-12-07 18:57:51,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:57:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:51,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:57:51,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:57:51,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:51,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:51,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:57:51,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:57:51,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:57:51,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:51,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:57:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 453 proven. 176 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 18:57:52,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:57:52,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-12-07 18:57:52,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896146666] [2019-12-07 18:57:52,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:57:52,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:52,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:57:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:57:52,396 INFO L87 Difference]: Start difference. First operand 11716 states and 12212 transitions. Second operand 16 states. [2019-12-07 18:59:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:20,119 INFO L93 Difference]: Finished difference Result 36818 states and 38390 transitions. [2019-12-07 18:59:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 18:59:20,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 701 [2019-12-07 18:59:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:20,136 INFO L225 Difference]: With dead ends: 36818 [2019-12-07 18:59:20,136 INFO L226 Difference]: Without dead ends: 24799 [2019-12-07 18:59:20,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 729 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=529, Invalid=2021, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:59:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24799 states. [2019-12-07 18:59:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24799 to 16507. [2019-12-07 18:59:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16507 states. [2019-12-07 18:59:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16507 states to 16507 states and 17168 transitions. [2019-12-07 18:59:20,313 INFO L78 Accepts]: Start accepts. Automaton has 16507 states and 17168 transitions. Word has length 701 [2019-12-07 18:59:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:20,314 INFO L462 AbstractCegarLoop]: Abstraction has 16507 states and 17168 transitions. [2019-12-07 18:59:20,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:59:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 16507 states and 17168 transitions. [2019-12-07 18:59:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-12-07 18:59:20,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:20,322 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:20,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:20,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1141578840, now seen corresponding path program 1 times [2019-12-07 18:59:20,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:20,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054536366] [2019-12-07 18:59:20,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 612 proven. 202 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:59:21,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054536366] [2019-12-07 18:59:21,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433476092] [2019-12-07 18:59:21,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:21,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:59:21,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:21,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:21,889 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod v_~a29~0_896 299978))) (and (<= c_~a29~0 (+ .cse0 43)) (not (= .cse0 0)) (< v_~a29~0_896 0)))) (exists ((v_prenex_4 Int)) (let ((.cse1 (mod v_prenex_4 299978))) (and (= .cse1 0) (<= c_~a29~0 (+ .cse1 300021))))) (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= c_~a29~0 (+ (mod v_prenex_4 299978) 300021))))) is different from true [2019-12-07 18:59:22,322 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod v_~a29~0_896 299978))) (and (<= c_~a29~0 (+ .cse0 43)) (not (= .cse0 0)) (< v_~a29~0_896 0)))) (exists ((v_prenex_5 Int)) (and (<= 0 v_prenex_5) (<= c_~a29~0 (+ (mod v_prenex_5 299978) 300021)))) (exists ((v_prenex_4 Int)) (let ((.cse1 (mod v_prenex_4 299978))) (and (= .cse1 0) (<= c_~a29~0 (+ .cse1 300021)))))) is different from true [2019-12-07 18:59:22,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:22,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:22,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:22,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:22,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:30,552 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 57 DAG size of output: 20 [2019-12-07 18:59:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 50 not checked. [2019-12-07 18:59:31,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:31,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-12-07 18:59:31,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624446890] [2019-12-07 18:59:31,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:59:31,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:59:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=39, Unknown=4, NotChecked=26, Total=90 [2019-12-07 18:59:31,530 INFO L87 Difference]: Start difference. First operand 16507 states and 17168 transitions. Second operand 10 states. [2019-12-07 18:59:36,076 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 18:59:48,089 WARN L192 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-12-07 19:00:28,828 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 19:01:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:14,862 INFO L93 Difference]: Finished difference Result 48815 states and 50783 transitions. [2019-12-07 19:01:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:01:14,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 749 [2019-12-07 19:01:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:14,885 INFO L225 Difference]: With dead ends: 48815 [2019-12-07 19:01:14,885 INFO L226 Difference]: Without dead ends: 32609 [2019-12-07 19:01:14,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 755 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=91, Invalid=183, Unknown=6, NotChecked=62, Total=342 [2019-12-07 19:01:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32609 states. [2019-12-07 19:01:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32609 to 24892. [2019-12-07 19:01:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24892 states. [2019-12-07 19:01:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24892 states to 24892 states and 25909 transitions. [2019-12-07 19:01:15,149 INFO L78 Accepts]: Start accepts. Automaton has 24892 states and 25909 transitions. Word has length 749 [2019-12-07 19:01:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:15,150 INFO L462 AbstractCegarLoop]: Abstraction has 24892 states and 25909 transitions. [2019-12-07 19:01:15,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:01:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24892 states and 25909 transitions. [2019-12-07 19:01:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2019-12-07 19:01:15,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:15,167 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:15,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:15,369 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1281570425, now seen corresponding path program 1 times [2019-12-07 19:01:15,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:15,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192325992] [2019-12-07 19:01:15,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2019-12-07 19:01:15,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192325992] [2019-12-07 19:01:15,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:15,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:15,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177935955] [2019-12-07 19:01:15,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:15,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:15,854 INFO L87 Difference]: Start difference. First operand 24892 states and 25909 transitions. Second operand 3 states. [2019-12-07 19:01:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:16,353 INFO L93 Difference]: Finished difference Result 47685 states and 49616 transitions. [2019-12-07 19:01:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:16,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 873 [2019-12-07 19:01:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:16,369 INFO L225 Difference]: With dead ends: 47685 [2019-12-07 19:01:16,369 INFO L226 Difference]: Without dead ends: 23094 [2019-12-07 19:01:16,380 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 19:01:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23094 states. [2019-12-07 19:01:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23094 to 21895. [2019-12-07 19:01:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21895 states. [2019-12-07 19:01:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21895 states to 21895 states and 22768 transitions. [2019-12-07 19:01:16,565 INFO L78 Accepts]: Start accepts. Automaton has 21895 states and 22768 transitions. Word has length 873 [2019-12-07 19:01:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:16,566 INFO L462 AbstractCegarLoop]: Abstraction has 21895 states and 22768 transitions. [2019-12-07 19:01:16,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21895 states and 22768 transitions. [2019-12-07 19:01:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2019-12-07 19:01:16,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:16,589 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:16,589 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:16,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:16,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1230795970, now seen corresponding path program 1 times [2019-12-07 19:01:16,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:16,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615766971] [2019-12-07 19:01:16,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-12-07 19:01:17,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615766971] [2019-12-07 19:01:17,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:17,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:17,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845742576] [2019-12-07 19:01:17,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:17,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:17,181 INFO L87 Difference]: Start difference. First operand 21895 states and 22768 transitions. Second operand 3 states. [2019-12-07 19:01:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:18,091 INFO L93 Difference]: Finished difference Result 42286 states and 43948 transitions. [2019-12-07 19:01:18,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:18,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 990 [2019-12-07 19:01:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:18,092 INFO L225 Difference]: With dead ends: 42286 [2019-12-07 19:01:18,092 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:01:18,102 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 19:01:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:01:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:01:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:01:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:01:18,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 990 [2019-12-07 19:01:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:18,103 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:01:18,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:01:18,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:01:18,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:01:18,672 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 608 DAG size of output: 529 [2019-12-07 19:01:19,190 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 608 DAG size of output: 529 [2019-12-07 19:01:19,526 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 494 DAG size of output: 436 [2019-12-07 19:01:43,571 WARN L192 SmtUtils]: Spent 24.04 s on a formula simplification. DAG size of input: 512 DAG size of output: 100 [2019-12-07 19:02:00,944 WARN L192 SmtUtils]: Spent 17.37 s on a formula simplification. DAG size of input: 512 DAG size of output: 103 [2019-12-07 19:02:17,484 WARN L192 SmtUtils]: Spent 16.54 s on a formula simplification. DAG size of input: 422 DAG size of output: 102 [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,487 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,488 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,489 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 19:02:17,490 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,491 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,492 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,493 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,494 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 19:02:17,495 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,496 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 19:02:17,497 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse2 (= 3 ~a2~0)) (.cse3 (= 4 ~a2~0))) (let ((.cse7 (<= (+ ~a0~0 99) 0)) (.cse8 (<= (+ ~a0~0 147) 0)) (.cse9 (= 2 ~a2~0)) (.cse13 (+ ~a0~0 61)) (.cse1 (exists ((v_prenex_5 Int) (v_~a29~0_897 Int)) (and (<= v_~a29~0_897 (+ (mod v_prenex_5 299978) 300021)) (<= 0 v_prenex_5) (<= 0 v_~a29~0_897) (<= (+ ~a29~0 587483) (* 4 (div v_~a29~0_897 5)))))) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse11 (not .cse3)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse4 (not .cse2)) (.cse12 (<= 0 (+ ~a29~0 192415))) (.cse5 (<= (+ ~a4~0 42) 0)) (.cse10 (= 1 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (<= (+ ~a29~0 127) 0) .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse2) (and .cse5 .cse8 .cse9) (and .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse4 .cse12) (and .cse0 (or .cse6 (< 43 ~a29~0))) (and .cse5 .cse8 (<= (+ ~a29~0 (* 5 ~a0~0) 480376) 0) .cse3) (and .cse0 .cse10) (and .cse5 (< 0 .cse13) .cse2 .cse12) (and (<= (+ ~a0~0 96201) (+ ~a4~0 ~a29~0)) .cse5 .cse8 .cse12) (and .cse0 .cse9 .cse4) (and .cse0 (<= (+ ~a29~0 16) 0) (<= .cse13 0) (<= ~a2~0 4)) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse11 .cse4 .cse12) (and .cse0 (<= ~a29~0 42) .cse4 .cse12) (and .cse5 .cse10 (<= ~a29~0 43) (< 0 (+ ~a29~0 144)))))) [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 19:02:17,498 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 19:02:17,499 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse2 (= 3 ~a2~0)) (.cse12 (= 4 ~a2~0))) (let ((.cse3 (= 2 ~a2~0)) (.cse8 (<= (+ ~a0~0 147) 0)) (.cse13 (+ ~a0~0 61)) (.cse1 (exists ((v_prenex_5 Int) (v_~a29~0_897 Int)) (and (<= v_~a29~0_897 (+ (mod v_prenex_5 299978) 300021)) (<= 0 v_prenex_5) (<= 0 v_~a29~0_897) (<= (+ ~a29~0 587483) (* 4 (div v_~a29~0_897 5)))))) (.cse9 (not .cse12)) (.cse10 (<= 0 (+ ~a29~0 192415))) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse4 (not .cse2)) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse5 (= 1 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and (or (and .cse0 .cse3 .cse4) (and .cse0 .cse5)) .cse1) (and .cse6 .cse5 .cse7) (and .cse6 .cse8 .cse3) (and .cse0 .cse9 .cse4 .cse10) (and .cse0 (or .cse11 (< 43 ~a29~0))) (and .cse6 .cse8 (<= (+ ~a29~0 (* 5 ~a0~0) 480376) 0) .cse12) (and .cse6 (< 0 .cse13) .cse2 .cse10) (and (<= (+ ~a0~0 96201) (+ ~a4~0 ~a29~0)) .cse6 .cse8 .cse10) (and .cse0 (<= (+ ~a29~0 16) 0) (<= .cse13 0) (<= ~a2~0 4)) (and .cse6 .cse11 .cse1 .cse2) (and .cse6 .cse11 .cse9 .cse4 .cse10) (and .cse11 .cse6 .cse7 .cse2) (and .cse0 (<= ~a29~0 42) .cse12 .cse4) (and .cse6 .cse5 (<= ~a29~0 43) (< 0 (+ ~a29~0 144)))))) [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,500 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,501 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,502 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 19:02:17,503 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,504 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse11 (= 3 ~a2~0)) (.cse12 (= 4 ~a2~0))) (let ((.cse1 (= 2 ~a2~0)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse13 (+ ~a0~0 61)) (.cse4 (exists ((v_prenex_5 Int) (v_~a29~0_897 Int)) (and (<= v_~a29~0_897 (+ (mod v_prenex_5 299978) 300021)) (<= 0 v_prenex_5) (<= 0 v_~a29~0_897) (<= (+ ~a29~0 587483) (* 4 (div v_~a29~0_897 5)))))) (.cse8 (not .cse12)) (.cse9 (<= 0 (+ ~a29~0 192415))) (.cse10 (<= (+ ~a0~0 98) 0)) (.cse6 (<= (+ ~a0~0 99) 0)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse2 (not .cse11)) (.cse5 (<= (+ ~a4~0 42) 0)) (.cse3 (= 1 ~a2~0))) (or (and (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3)) .cse4) (and .cse5 .cse3 .cse6) (and .cse5 .cse7 .cse1) (and .cse0 .cse8 .cse2 .cse9) (and .cse0 (or .cse10 (< 43 ~a29~0))) (and .cse0 (<= (+ ~a29~0 127) 0) .cse11) (and .cse5 .cse7 (<= (+ ~a29~0 (* 5 ~a0~0) 480376) 0) .cse12) (and .cse5 (< 0 .cse13) .cse11 .cse9) (and (<= (+ ~a0~0 96201) (+ ~a4~0 ~a29~0)) .cse5 .cse7 .cse9) (and .cse0 (<= (+ ~a29~0 16) 0) (<= .cse13 0) (<= ~a2~0 4)) (and .cse5 .cse10 .cse4 .cse11) (and .cse5 .cse10 .cse8 .cse2 .cse9) (and .cse10 .cse5 .cse6 .cse11) (and .cse0 (<= ~a29~0 42) .cse12 .cse2) (and .cse5 .cse3 (<= ~a29~0 43) (< 0 (+ ~a29~0 144)))))) [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,505 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,506 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 19:02:17,507 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 19:02:17,508 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 19:02:17,509 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 19:02:17,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:02:17 BoogieIcfgContainer [2019-12-07 19:02:17,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:02:17,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:02:17,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:02:17,552 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:02:17,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:57:00" (3/4) ... [2019-12-07 19:02:17,555 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:02:17,586 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 19:02:17,588 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:02:17,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((a4 + 86 <= 0 && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2) || ((((a4 + 86 <= 0 && 2 == a2) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2)) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5)))) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 42) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) [2019-12-07 19:02:17,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((a4 + 86 <= 0 && 2 == a2) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2)) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 42) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) [2019-12-07 19:02:17,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((a4 + 86 <= 0 && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (a4 + 86 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && 2 == a2) && !(3 == a2))) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 <= 42) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) [2019-12-07 19:02:17,718 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8484f510-da58-4b76-b713-e175190851bc/bin/uautomizer/witness.graphml [2019-12-07 19:02:17,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:02:17,719 INFO L168 Benchmark]: Toolchain (without parser) took 320426.40 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 934.0 MB in the beginning and 859.6 MB in the end (delta: 74.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,719 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:17,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -113.6 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,720 INFO L168 Benchmark]: Boogie Preprocessor took 135.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 989.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,721 INFO L168 Benchmark]: RCFGBuilder took 2259.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 989.9 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,721 INFO L168 Benchmark]: TraceAbstraction took 317062.83 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 766.0 MB). Free memory was 1.1 GB in the beginning and 941.2 MB in the end (delta: 181.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,721 INFO L168 Benchmark]: Witness Printer took 166.34 ms. Allocated memory is still 2.1 GB. Free memory was 941.2 MB in the beginning and 859.6 MB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:17,723 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -113.6 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 989.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2259.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 989.9 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 317062.83 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 766.0 MB). Free memory was 1.1 GB in the beginning and 941.2 MB in the end (delta: 181.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 166.34 ms. Allocated memory is still 2.1 GB. Free memory was 941.2 MB in the beginning and 859.6 MB in the end (delta: 81.6 MB). Peak memory consumption was 81.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_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 19:02:17,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: (((((((((((((((a4 + 86 <= 0 && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2) || ((((a4 + 86 <= 0 && 2 == a2) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2)) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5)))) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 42) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: (((((((((((((((((a4 + 86 <= 0 && 2 == a2) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2)) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 42) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-12-07 19:02:17,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 19:02:17,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: (((((((((((((((((a4 + 86 <= 0 && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (a4 + 86 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 5 * a0 + 480376 <= 0) && 4 == a2)) || (a4 + 86 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && 0 < a0 + 61) && 3 == a2) && 0 <= a29 + 192415)) || (((a0 + 96201 <= a4 + a29 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && 2 == a2) && !(3 == a2))) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a0 + 61 <= 0) && a2 <= 4)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_5 : int, v_~a29~0_897 : int :: ((v_~a29~0_897 <= v_prenex_5 % 299978 + 300021 && 0 <= v_prenex_5) && 0 <= v_~a29~0_897) && a29 + 587483 <= 4 * (v_~a29~0_897 / 5))) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && a29 <= 42) && !(3 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 257.5s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 237.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 59.3s, HoareTripleCheckerStatistics: 2589 SDtfs, 22292 SDslu, 1545 SDs, 0 SdLazy, 57480 SolverSat, 7743 SolverUnsat, 217 SolverUnknown, 0 SolverNotchecked, 222.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2965 GetRequests, 2814 SyntacticMatches, 24 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24892occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 37944 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 314 NumberOfFragments, 999 HoareAnnotationTreeSize, 4 FomulaSimplifications, 78327 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 97563 FormulaSimplificationTreeSizeReductionInter, 57.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 9488 NumberOfCodeBlocks, 9488 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 9470 ConstructedInterpolants, 355 QuantifiedInterpolants, 20888663 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3242 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 8437/9701 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...