./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.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_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/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 a9547726c128170530daa9b8442c9d71a0bd2015 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:50:47,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:50:47,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:50:47,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:50:47,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:50:47,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:50:47,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:50:47,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:50:47,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:50:47,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:50:47,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:50:47,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:50:47,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:50:47,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:50:47,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:50:47,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:50:47,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:50:47,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:50:47,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:50:47,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:50:47,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:50:47,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:50:47,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:50:47,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:50:47,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:50:47,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:50:47,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:50:47,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:50:47,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:50:47,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:50:47,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:50:47,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:50:47,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:50:47,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:50:47,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:50:47,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:50:47,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:50:47,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:50:47,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:50:47,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:50:47,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:50:47,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:50:47,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:50:47,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:50:47,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:50:47,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:50:47,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:50:47,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:50:47,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:50:47,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:50:47,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:50:47,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:50:47,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:50:47,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:50:47,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:50:47,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:50:47,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:50:47,876 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:50:47,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:50:47,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:50:47,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:50:47,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:50:47,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:50:47,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:50:47,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:50:47,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:50:47,878 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_49e59470-6537-4cf3-bd31-bae236cb20c5/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 -> a9547726c128170530daa9b8442c9d71a0bd2015 [2019-12-07 16:50:47,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:50:48,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:50:48,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:50:48,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:50:48,006 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:50:48,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-12-07 16:50:48,046 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/data/4d6b17787/c81338969a9745eb8454ba6c5576925e/FLAGac67ae79b [2019-12-07 16:50:48,445 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:50:48,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-12-07 16:50:48,457 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/data/4d6b17787/c81338969a9745eb8454ba6c5576925e/FLAGac67ae79b [2019-12-07 16:50:48,466 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/data/4d6b17787/c81338969a9745eb8454ba6c5576925e [2019-12-07 16:50:48,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:50:48,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:50:48,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:50:48,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:50:48,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:50:48,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:50:48" (1/1) ... [2019-12-07 16:50:48,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:48, skipping insertion in model container [2019-12-07 16:50:48,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:50:48" (1/1) ... [2019-12-07 16:50:48,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:50:48,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:50:48,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:50:48,894 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:50:49,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:50:49,046 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:50:49,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49 WrapperNode [2019-12-07 16:50:49,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:50:49,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:50:49,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:50:49,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:50:49,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:50:49,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:50:49,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:50:49,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:50:49,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... [2019-12-07 16:50:49,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:50:49,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:50:49,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:50:49,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:50:49,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:50:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:50:49,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:50:50,415 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:50:50,415 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:50:50,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:50 BoogieIcfgContainer [2019-12-07 16:50:50,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:50:50,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:50:50,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:50:50,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:50:50,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:50:48" (1/3) ... [2019-12-07 16:50:50,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:50:50, skipping insertion in model container [2019-12-07 16:50:50,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:49" (2/3) ... [2019-12-07 16:50:50,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:50:50, skipping insertion in model container [2019-12-07 16:50:50,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:50" (3/3) ... [2019-12-07 16:50:50,423 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-12-07 16:50:50,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:50:50,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:50:50,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:50:50,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:50:50,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:50:50,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:50:50,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:50:50,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:50:50,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:50:50,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:50:50,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:50:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 16:50:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 16:50:50,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:50,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:50,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 800753066, now seen corresponding path program 1 times [2019-12-07 16:50:50,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:50,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 16:50:50,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:50,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 16:50:50,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:50,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:50,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657549778] [2019-12-07 16:50:50,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:50,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:50,944 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 16:50:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:52,074 INFO L93 Difference]: Finished difference Result 1085 states and 1950 transitions. [2019-12-07 16:50:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:52,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-12-07 16:50:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:52,089 INFO L225 Difference]: With dead ends: 1085 [2019-12-07 16:50:52,089 INFO L226 Difference]: Without dead ends: 686 [2019-12-07 16:50:52,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-12-07 16:50:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 453. [2019-12-07 16:50:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-12-07 16:50:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 735 transitions. [2019-12-07 16:50:52,139 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 735 transitions. Word has length 178 [2019-12-07 16:50:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:52,140 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 735 transitions. [2019-12-07 16:50:52,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 735 transitions. [2019-12-07 16:50:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-07 16:50:52,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:52,144 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:50:52,144 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513926, now seen corresponding path program 1 times [2019-12-07 16:50:52,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:52,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417953906] [2019-12-07 16:50:52,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:52,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417953906] [2019-12-07 16:50:52,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:52,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:52,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296421547] [2019-12-07 16:50:52,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:52,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:52,216 INFO L87 Difference]: Start difference. First operand 453 states and 735 transitions. Second operand 4 states. [2019-12-07 16:50:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:53,348 INFO L93 Difference]: Finished difference Result 1748 states and 2863 transitions. [2019-12-07 16:50:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:53,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-12-07 16:50:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:53,354 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 16:50:53,354 INFO L226 Difference]: Without dead ends: 1297 [2019-12-07 16:50:53,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-07 16:50:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 863. [2019-12-07 16:50:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-07 16:50:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1325 transitions. [2019-12-07 16:50:53,379 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1325 transitions. Word has length 183 [2019-12-07 16:50:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:53,380 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1325 transitions. [2019-12-07 16:50:53,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1325 transitions. [2019-12-07 16:50:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 16:50:53,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:53,382 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:50:53,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash 455255094, now seen corresponding path program 1 times [2019-12-07 16:50:53,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:53,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961082792] [2019-12-07 16:50:53,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:53,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961082792] [2019-12-07 16:50:53,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:53,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:53,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137355213] [2019-12-07 16:50:53,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:53,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:53,434 INFO L87 Difference]: Start difference. First operand 863 states and 1325 transitions. Second operand 3 states. [2019-12-07 16:50:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:54,159 INFO L93 Difference]: Finished difference Result 2552 states and 3927 transitions. [2019-12-07 16:50:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:54,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-12-07 16:50:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:54,168 INFO L225 Difference]: With dead ends: 2552 [2019-12-07 16:50:54,169 INFO L226 Difference]: Without dead ends: 1691 [2019-12-07 16:50:54,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-12-07 16:50:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1687. [2019-12-07 16:50:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-07 16:50:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2449 transitions. [2019-12-07 16:50:54,203 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2449 transitions. Word has length 184 [2019-12-07 16:50:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:54,203 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 2449 transitions. [2019-12-07 16:50:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2449 transitions. [2019-12-07 16:50:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 16:50:54,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:54,206 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:50:54,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash -726821495, now seen corresponding path program 1 times [2019-12-07 16:50:54,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:54,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787035360] [2019-12-07 16:50:54,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:54,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787035360] [2019-12-07 16:50:54,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:54,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:54,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426378995] [2019-12-07 16:50:54,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:54,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:54,253 INFO L87 Difference]: Start difference. First operand 1687 states and 2449 transitions. Second operand 3 states. [2019-12-07 16:50:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:54,918 INFO L93 Difference]: Finished difference Result 5013 states and 7296 transitions. [2019-12-07 16:50:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:54,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 16:50:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:54,935 INFO L225 Difference]: With dead ends: 5013 [2019-12-07 16:50:54,935 INFO L226 Difference]: Without dead ends: 3328 [2019-12-07 16:50:54,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-12-07 16:50:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3311. [2019-12-07 16:50:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2019-12-07 16:50:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4735 transitions. [2019-12-07 16:50:55,003 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4735 transitions. Word has length 186 [2019-12-07 16:50:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:55,003 INFO L462 AbstractCegarLoop]: Abstraction has 3311 states and 4735 transitions. [2019-12-07 16:50:55,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4735 transitions. [2019-12-07 16:50:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 16:50:55,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:55,011 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:55,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1403214167, now seen corresponding path program 1 times [2019-12-07 16:50:55,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671416187] [2019-12-07 16:50:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:55,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671416187] [2019-12-07 16:50:55,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:55,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:55,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434712400] [2019-12-07 16:50:55,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:55,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:55,072 INFO L87 Difference]: Start difference. First operand 3311 states and 4735 transitions. Second operand 4 states. [2019-12-07 16:50:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:56,386 INFO L93 Difference]: Finished difference Result 12510 states and 17955 transitions. [2019-12-07 16:50:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:56,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-12-07 16:50:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:56,415 INFO L225 Difference]: With dead ends: 12510 [2019-12-07 16:50:56,415 INFO L226 Difference]: Without dead ends: 9201 [2019-12-07 16:50:56,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-12-07 16:50:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 9199. [2019-12-07 16:50:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-12-07 16:50:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 11486 transitions. [2019-12-07 16:50:56,521 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 11486 transitions. Word has length 197 [2019-12-07 16:50:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:56,521 INFO L462 AbstractCegarLoop]: Abstraction has 9199 states and 11486 transitions. [2019-12-07 16:50:56,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 11486 transitions. [2019-12-07 16:50:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 16:50:56,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:56,532 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:56,532 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -215854226, now seen corresponding path program 1 times [2019-12-07 16:50:56,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:56,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117111792] [2019-12-07 16:50:56,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:56,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117111792] [2019-12-07 16:50:56,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:56,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:50:56,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381583789] [2019-12-07 16:50:56,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:50:56,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:50:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:50:56,631 INFO L87 Difference]: Start difference. First operand 9199 states and 11486 transitions. Second operand 5 states. [2019-12-07 16:50:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:57,788 INFO L93 Difference]: Finished difference Result 28424 states and 35683 transitions. [2019-12-07 16:50:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:50:57,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-12-07 16:50:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:57,837 INFO L225 Difference]: With dead ends: 28424 [2019-12-07 16:50:57,837 INFO L226 Difference]: Without dead ends: 19227 [2019-12-07 16:50:57,844 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 16:50:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19227 states. [2019-12-07 16:50:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19227 to 18377. [2019-12-07 16:50:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-07 16:50:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 22820 transitions. [2019-12-07 16:50:58,019 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 22820 transitions. Word has length 216 [2019-12-07 16:50:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:58,019 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 22820 transitions. [2019-12-07 16:50:58,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:50:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 22820 transitions. [2019-12-07 16:50:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 16:50:58,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:58,036 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:58,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash -82552671, now seen corresponding path program 1 times [2019-12-07 16:50:58,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:58,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911029895] [2019-12-07 16:50:58,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:50:58,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911029895] [2019-12-07 16:50:58,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:58,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:58,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669729879] [2019-12-07 16:50:58,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:58,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:58,114 INFO L87 Difference]: Start difference. First operand 18377 states and 22820 transitions. Second operand 3 states. [2019-12-07 16:50:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:58,515 INFO L93 Difference]: Finished difference Result 34878 states and 43337 transitions. [2019-12-07 16:50:58,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:58,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-12-07 16:50:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:58,531 INFO L225 Difference]: With dead ends: 34878 [2019-12-07 16:50:58,531 INFO L226 Difference]: Without dead ends: 16503 [2019-12-07 16:50:58,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2019-12-07 16:50:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 16503. [2019-12-07 16:50:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16503 states. [2019-12-07 16:50:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16503 states to 16503 states and 20026 transitions. [2019-12-07 16:50:58,690 INFO L78 Accepts]: Start accepts. Automaton has 16503 states and 20026 transitions. Word has length 239 [2019-12-07 16:50:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:58,691 INFO L462 AbstractCegarLoop]: Abstraction has 16503 states and 20026 transitions. [2019-12-07 16:50:58,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 16503 states and 20026 transitions. [2019-12-07 16:50:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-12-07 16:50:58,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:58,703 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:58,703 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash 743628338, now seen corresponding path program 1 times [2019-12-07 16:50:58,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:58,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255593146] [2019-12-07 16:50:58,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:50:58,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255593146] [2019-12-07 16:50:58,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:58,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:58,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666336989] [2019-12-07 16:50:58,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:58,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:58,893 INFO L87 Difference]: Start difference. First operand 16503 states and 20026 transitions. Second operand 4 states. [2019-12-07 16:50:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:59,596 INFO L93 Difference]: Finished difference Result 32793 states and 39819 transitions. [2019-12-07 16:50:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:59,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-12-07 16:50:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:59,610 INFO L225 Difference]: With dead ends: 32793 [2019-12-07 16:50:59,610 INFO L226 Difference]: Without dead ends: 16292 [2019-12-07 16:50:59,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2019-12-07 16:50:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 13653. [2019-12-07 16:50:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13653 states. [2019-12-07 16:50:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13653 states to 13653 states and 15721 transitions. [2019-12-07 16:50:59,737 INFO L78 Accepts]: Start accepts. Automaton has 13653 states and 15721 transitions. Word has length 266 [2019-12-07 16:50:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:59,737 INFO L462 AbstractCegarLoop]: Abstraction has 13653 states and 15721 transitions. [2019-12-07 16:50:59,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13653 states and 15721 transitions. [2019-12-07 16:50:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 16:50:59,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:59,746 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:50:59,746 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -173098499, now seen corresponding path program 1 times [2019-12-07 16:50:59,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:59,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382138376] [2019-12-07 16:50:59,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:50:59,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382138376] [2019-12-07 16:50:59,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:59,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989354666] [2019-12-07 16:50:59,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:59,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:59,831 INFO L87 Difference]: Start difference. First operand 13653 states and 15721 transitions. Second operand 4 states. [2019-12-07 16:51:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:00,872 INFO L93 Difference]: Finished difference Result 51949 states and 59802 transitions. [2019-12-07 16:51:00,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:00,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-12-07 16:51:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:00,900 INFO L225 Difference]: With dead ends: 51949 [2019-12-07 16:51:00,900 INFO L226 Difference]: Without dead ends: 38298 [2019-12-07 16:51:00,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38298 states. [2019-12-07 16:51:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38298 to 38294. [2019-12-07 16:51:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38294 states. [2019-12-07 16:51:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38294 states to 38294 states and 43994 transitions. [2019-12-07 16:51:01,207 INFO L78 Accepts]: Start accepts. Automaton has 38294 states and 43994 transitions. Word has length 278 [2019-12-07 16:51:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:01,207 INFO L462 AbstractCegarLoop]: Abstraction has 38294 states and 43994 transitions. [2019-12-07 16:51:01,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 38294 states and 43994 transitions. [2019-12-07 16:51:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-12-07 16:51:01,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:01,217 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:01,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1953792015, now seen corresponding path program 1 times [2019-12-07 16:51:01,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:01,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970646257] [2019-12-07 16:51:01,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 16:51:01,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970646257] [2019-12-07 16:51:01,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682266821] [2019-12-07 16:51:01,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:51:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:01,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:51:01,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:51:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 16:51:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:51:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-12-07 16:51:01,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621436349] [2019-12-07 16:51:01,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:01,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:01,548 INFO L87 Difference]: Start difference. First operand 38294 states and 43994 transitions. Second operand 3 states. [2019-12-07 16:51:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:01,997 INFO L93 Difference]: Finished difference Result 109525 states and 126031 transitions. [2019-12-07 16:51:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:01,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-12-07 16:51:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:02,057 INFO L225 Difference]: With dead ends: 109525 [2019-12-07 16:51:02,057 INFO L226 Difference]: Without dead ends: 71233 [2019-12-07 16:51:02,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71233 states. [2019-12-07 16:51:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71233 to 71231. [2019-12-07 16:51:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71231 states. [2019-12-07 16:51:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71231 states to 71231 states and 82008 transitions. [2019-12-07 16:51:02,666 INFO L78 Accepts]: Start accepts. Automaton has 71231 states and 82008 transitions. Word has length 288 [2019-12-07 16:51:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:02,666 INFO L462 AbstractCegarLoop]: Abstraction has 71231 states and 82008 transitions. [2019-12-07 16:51:02,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 71231 states and 82008 transitions. [2019-12-07 16:51:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-12-07 16:51:02,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:02,681 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:02,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:51:02,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 844494747, now seen corresponding path program 1 times [2019-12-07 16:51:02,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:02,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224800215] [2019-12-07 16:51:02,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:51:03,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224800215] [2019-12-07 16:51:03,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:03,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:03,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813425686] [2019-12-07 16:51:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:03,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:03,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:03,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:03,041 INFO L87 Difference]: Start difference. First operand 71231 states and 82008 transitions. Second operand 3 states. [2019-12-07 16:51:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:03,798 INFO L93 Difference]: Finished difference Result 142484 states and 164062 transitions. [2019-12-07 16:51:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:03,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-12-07 16:51:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:03,857 INFO L225 Difference]: With dead ends: 142484 [2019-12-07 16:51:03,857 INFO L226 Difference]: Without dead ends: 71255 [2019-12-07 16:51:03,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71255 states. [2019-12-07 16:51:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71255 to 70825. [2019-12-07 16:51:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70825 states. [2019-12-07 16:51:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70825 states to 70825 states and 79737 transitions. [2019-12-07 16:51:04,467 INFO L78 Accepts]: Start accepts. Automaton has 70825 states and 79737 transitions. Word has length 300 [2019-12-07 16:51:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:04,467 INFO L462 AbstractCegarLoop]: Abstraction has 70825 states and 79737 transitions. [2019-12-07 16:51:04,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 70825 states and 79737 transitions. [2019-12-07 16:51:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-12-07 16:51:04,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:04,479 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:04,479 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1976501505, now seen corresponding path program 1 times [2019-12-07 16:51:04,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:04,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614727065] [2019-12-07 16:51:04,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-12-07 16:51:04,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614727065] [2019-12-07 16:51:04,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:04,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:04,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748755597] [2019-12-07 16:51:04,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:04,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:04,655 INFO L87 Difference]: Start difference. First operand 70825 states and 79737 transitions. Second operand 3 states. [2019-12-07 16:51:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:05,471 INFO L93 Difference]: Finished difference Result 175250 states and 197766 transitions. [2019-12-07 16:51:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:05,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-12-07 16:51:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:05,566 INFO L225 Difference]: With dead ends: 175250 [2019-12-07 16:51:05,566 INFO L226 Difference]: Without dead ends: 104427 [2019-12-07 16:51:05,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104427 states. [2019-12-07 16:51:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104427 to 104421. [2019-12-07 16:51:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104421 states. [2019-12-07 16:51:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104421 states to 104421 states and 117899 transitions. [2019-12-07 16:51:06,531 INFO L78 Accepts]: Start accepts. Automaton has 104421 states and 117899 transitions. Word has length 313 [2019-12-07 16:51:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:06,531 INFO L462 AbstractCegarLoop]: Abstraction has 104421 states and 117899 transitions. [2019-12-07 16:51:06,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 104421 states and 117899 transitions. [2019-12-07 16:51:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-12-07 16:51:06,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:06,546 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:06,546 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1864009396, now seen corresponding path program 1 times [2019-12-07 16:51:06,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:06,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826733092] [2019-12-07 16:51:06,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-12-07 16:51:06,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826733092] [2019-12-07 16:51:06,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816328818] [2019-12-07 16:51:06,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:51:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:06,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:51:06,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:51:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-12-07 16:51:06,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:51:06,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-12-07 16:51:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606668541] [2019-12-07 16:51:06,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:06,859 INFO L87 Difference]: Start difference. First operand 104421 states and 117899 transitions. Second operand 3 states. [2019-12-07 16:51:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:08,257 INFO L93 Difference]: Finished difference Result 266583 states and 300236 transitions. [2019-12-07 16:51:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:08,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-12-07 16:51:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:08,456 INFO L225 Difference]: With dead ends: 266583 [2019-12-07 16:51:08,456 INFO L226 Difference]: Without dead ends: 162164 [2019-12-07 16:51:08,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:51:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162164 states. [2019-12-07 16:51:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162164 to 160309. [2019-12-07 16:51:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160309 states. [2019-12-07 16:51:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160309 states to 160309 states and 178700 transitions. [2019-12-07 16:51:10,190 INFO L78 Accepts]: Start accepts. Automaton has 160309 states and 178700 transitions. Word has length 320 [2019-12-07 16:51:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:10,190 INFO L462 AbstractCegarLoop]: Abstraction has 160309 states and 178700 transitions. [2019-12-07 16:51:10,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 160309 states and 178700 transitions. [2019-12-07 16:51:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-12-07 16:51:10,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:10,232 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2019-12-07 16:51:10,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:51:10,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 594366740, now seen corresponding path program 1 times [2019-12-07 16:51:10,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:10,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943841492] [2019-12-07 16:51:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:51:10,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943841492] [2019-12-07 16:51:10,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:10,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:51:10,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341208818] [2019-12-07 16:51:10,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:10,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:10,857 INFO L87 Difference]: Start difference. First operand 160309 states and 178700 transitions. Second operand 5 states. [2019-12-07 16:51:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:12,778 INFO L93 Difference]: Finished difference Result 422246 states and 467693 transitions. [2019-12-07 16:51:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:12,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-12-07 16:51:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:13,061 INFO L225 Difference]: With dead ends: 422246 [2019-12-07 16:51:13,061 INFO L226 Difference]: Without dead ends: 261939 [2019-12-07 16:51:13,143 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 16:51:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261939 states. [2019-12-07 16:51:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261939 to 251132. [2019-12-07 16:51:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251132 states. [2019-12-07 16:51:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251132 states to 251132 states and 276832 transitions. [2019-12-07 16:51:17,154 INFO L78 Accepts]: Start accepts. Automaton has 251132 states and 276832 transitions. Word has length 320 [2019-12-07 16:51:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:17,154 INFO L462 AbstractCegarLoop]: Abstraction has 251132 states and 276832 transitions. [2019-12-07 16:51:17,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 251132 states and 276832 transitions. [2019-12-07 16:51:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-12-07 16:51:17,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:17,189 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:17,189 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1803227641, now seen corresponding path program 1 times [2019-12-07 16:51:17,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:17,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359302105] [2019-12-07 16:51:17,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 16:51:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359302105] [2019-12-07 16:51:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:17,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095042060] [2019-12-07 16:51:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:17,309 INFO L87 Difference]: Start difference. First operand 251132 states and 276832 transitions. Second operand 3 states. [2019-12-07 16:51:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:18,664 INFO L93 Difference]: Finished difference Result 502253 states and 553653 transitions. [2019-12-07 16:51:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:18,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-12-07 16:51:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:18,921 INFO L225 Difference]: With dead ends: 502253 [2019-12-07 16:51:18,922 INFO L226 Difference]: Without dead ends: 251123 [2019-12-07 16:51:19,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251123 states. [2019-12-07 16:51:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251123 to 251123. [2019-12-07 16:51:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251123 states. [2019-12-07 16:51:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251123 states to 251123 states and 276814 transitions. [2019-12-07 16:51:21,618 INFO L78 Accepts]: Start accepts. Automaton has 251123 states and 276814 transitions. Word has length 353 [2019-12-07 16:51:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:21,619 INFO L462 AbstractCegarLoop]: Abstraction has 251123 states and 276814 transitions. [2019-12-07 16:51:21,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 251123 states and 276814 transitions. [2019-12-07 16:51:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-12-07 16:51:21,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:21,648 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-12-07 16:51:21,648 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash -963524122, now seen corresponding path program 1 times [2019-12-07 16:51:21,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:21,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781067172] [2019-12-07 16:51:21,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 16:51:21,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781067172] [2019-12-07 16:51:21,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:21,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:21,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422109774] [2019-12-07 16:51:21,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:21,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:21,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:21,789 INFO L87 Difference]: Start difference. First operand 251123 states and 276814 transitions. Second operand 4 states. [2019-12-07 16:51:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:23,658 INFO L93 Difference]: Finished difference Result 512307 states and 564690 transitions. [2019-12-07 16:51:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:23,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2019-12-07 16:51:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:23,938 INFO L225 Difference]: With dead ends: 512307 [2019-12-07 16:51:23,938 INFO L226 Difference]: Without dead ends: 261186 [2019-12-07 16:51:24,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261186 states. [2019-12-07 16:51:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261186 to 255008. [2019-12-07 16:51:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255008 states. [2019-12-07 16:51:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255008 states to 255008 states and 280728 transitions. [2019-12-07 16:51:28,172 INFO L78 Accepts]: Start accepts. Automaton has 255008 states and 280728 transitions. Word has length 368 [2019-12-07 16:51:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:28,172 INFO L462 AbstractCegarLoop]: Abstraction has 255008 states and 280728 transitions. [2019-12-07 16:51:28,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 255008 states and 280728 transitions. [2019-12-07 16:51:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-12-07 16:51:28,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:28,198 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:28,199 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash 956977237, now seen corresponding path program 1 times [2019-12-07 16:51:28,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:28,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53730830] [2019-12-07 16:51:28,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:28,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53730830] [2019-12-07 16:51:28,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:28,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:28,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951818140] [2019-12-07 16:51:28,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:28,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:28,351 INFO L87 Difference]: Start difference. First operand 255008 states and 280728 transitions. Second operand 3 states. [2019-12-07 16:51:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:29,809 INFO L93 Difference]: Finished difference Result 477240 states and 525499 transitions. [2019-12-07 16:51:29,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:29,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-12-07 16:51:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:29,810 INFO L225 Difference]: With dead ends: 477240 [2019-12-07 16:51:29,810 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:51:29,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:51:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:51:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:51:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:51:29,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-12-07 16:51:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:29,912 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:51:29,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:51:29,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:51:29,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:51:32,939 WARN L192 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 1412 DAG size of output: 272 [2019-12-07 16:51:35,718 WARN L192 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 1412 DAG size of output: 272 [2019-12-07 16:51:37,931 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 251 DAG size of output: 96 [2019-12-07 16:51:40,141 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 251 DAG size of output: 96 [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,144 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,145 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 16:51:40,146 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,147 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,148 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,149 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 16:51:40,150 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 16:51:40,151 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 16:51:40,151 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,151 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,151 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse4 (= ~a12~0 1))) (let ((.cse12 (<= ~a27~0 0)) (.cse16 (= ~a15~0 1)) (.cse19 (= 0 ~a3~0)) (.cse7 (not (= 2 ~a3~0))) (.cse14 (= 1 ~a0~0)) (.cse0 (= ~a10~0 1)) (.cse11 (not (= 1 ~a7~0))) (.cse1 (<= ~a6~0 0)) (.cse10 (not (= ~a26~0 1))) (.cse5 (= ~a27~0 1)) (.cse9 (not .cse4)) (.cse6 (= ~a11~0 1)) (.cse8 (= ~a16~0 1)) (.cse2 (= ~a18~0 1)) (.cse18 (= 1 ~a3~0)) (.cse3 (= 1 ~a5~0)) (.cse13 (= 1 ~a6~0)) (.cse15 (<= ~a11~0 0)) (.cse17 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse7 .cse6 .cse8) (and .cse1 .cse0 .cse10 .cse2 .cse3 .cse11 .cse9 .cse6 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse2 .cse5 .cse3 .cse6 .cse14) (and .cse1 .cse10 .cse2 .cse3 .cse9 .cse6 .cse14) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse15 .cse16) (and .cse2 .cse5 .cse3 .cse13 .cse15 .cse7 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse13 .cse11 .cse15 .cse17) (and .cse2 .cse3 .cse13 .cse15 .cse14) (and .cse1 .cse10 .cse2 .cse18 .cse3 .cse4 .cse15) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse11 .cse6 .cse8 .cse17) (and .cse0 .cse2 .cse3 .cse13 .cse7 .cse6 .cse8 .cse17) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse17) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7) (and .cse2 .cse5 .cse3 .cse13 .cse7 .cse6 .cse8) (and .cse10 .cse2 .cse18 .cse3 .cse13 .cse4 .cse6 .cse8 .cse12) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse4 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse19 .cse6 .cse14 .cse8 .cse12) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse15 .cse17) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7 .cse16) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse11 .cse7 .cse6 .cse8) (and .cse1 .cse0 .cse10 .cse2 .cse3 .cse4 .cse15 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse6 .cse14) (and .cse2 .cse5 .cse3 .cse13 .cse7 .cse6 .cse17) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse9 .cse7 .cse6 .cse17) (and .cse1 .cse0 .cse10 .cse2 .cse18 .cse3 .cse15 .cse9) (and .cse2 .cse5 .cse3 .cse13 .cse6 .cse8 .cse14) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse15 .cse11 .cse7) (and .cse1 .cse2 .cse18 .cse3 .cse9 .cse15 .cse17) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse19 .cse6 .cse14) (and .cse1 .cse2 .cse5 .cse18 .cse3 .cse6 .cse8 .cse17) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse15 .cse14) (and .cse1 .cse2 .cse18 .cse3 .cse15 .cse14) (and .cse2 .cse3 .cse13 .cse9 .cse15 .cse7) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse15 .cse9 .cse7 .cse17) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse11 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14) (and .cse1 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse6 .cse14 .cse17) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse15 .cse7 .cse17) (and .cse2 .cse5 .cse3 .cse13 .cse9 .cse7 .cse6) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse15 .cse9 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse9 .cse11 .cse15) (and .cse1 .cse10 .cse2 .cse5 .cse18 .cse3 .cse9 .cse6 .cse8) (and .cse2 .cse18 .cse3 .cse13 .cse15 .cse17)))) [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1569) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,152 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 16:51:40,153 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse4 (= ~a12~0 1))) (let ((.cse12 (<= ~a27~0 0)) (.cse16 (= ~a15~0 1)) (.cse19 (= 0 ~a3~0)) (.cse7 (not (= 2 ~a3~0))) (.cse14 (= 1 ~a0~0)) (.cse0 (= ~a10~0 1)) (.cse11 (not (= 1 ~a7~0))) (.cse1 (<= ~a6~0 0)) (.cse10 (not (= ~a26~0 1))) (.cse5 (= ~a27~0 1)) (.cse9 (not .cse4)) (.cse6 (= ~a11~0 1)) (.cse8 (= ~a16~0 1)) (.cse2 (= ~a18~0 1)) (.cse18 (= 1 ~a3~0)) (.cse3 (= 1 ~a5~0)) (.cse13 (= 1 ~a6~0)) (.cse15 (<= ~a11~0 0)) (.cse17 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse7 .cse6 .cse8) (and .cse1 .cse0 .cse10 .cse2 .cse3 .cse11 .cse9 .cse6 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse2 .cse5 .cse3 .cse6 .cse14) (and .cse1 .cse10 .cse2 .cse3 .cse9 .cse6 .cse14) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse15 .cse16) (and .cse2 .cse5 .cse3 .cse13 .cse15 .cse7 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse13 .cse11 .cse15 .cse17) (and .cse2 .cse3 .cse13 .cse15 .cse14) (and .cse1 .cse10 .cse2 .cse18 .cse3 .cse4 .cse15) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse11 .cse6 .cse8 .cse17) (and .cse0 .cse2 .cse3 .cse13 .cse7 .cse6 .cse8 .cse17) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse17) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7) (and .cse2 .cse5 .cse3 .cse13 .cse7 .cse6 .cse8) (and .cse10 .cse2 .cse18 .cse3 .cse13 .cse4 .cse6 .cse8 .cse12) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse4 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse19 .cse6 .cse14 .cse8 .cse12) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse15 .cse17) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7 .cse16) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse11 .cse7 .cse6 .cse8) (and .cse1 .cse0 .cse10 .cse2 .cse3 .cse4 .cse15 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse6 .cse14) (and .cse2 .cse5 .cse3 .cse13 .cse7 .cse6 .cse17) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse9 .cse7 .cse6 .cse17) (and .cse1 .cse0 .cse10 .cse2 .cse18 .cse3 .cse15 .cse9) (and .cse2 .cse5 .cse3 .cse13 .cse6 .cse8 .cse14) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse15 .cse11 .cse7) (and .cse1 .cse2 .cse18 .cse3 .cse9 .cse15 .cse17) (and .cse1 .cse0 .cse2 .cse5 .cse3 .cse9 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse19 .cse6 .cse14) (and .cse1 .cse2 .cse5 .cse18 .cse3 .cse6 .cse8 .cse17) (and .cse0 .cse2 .cse5 .cse3 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse15 .cse14) (and .cse1 .cse2 .cse18 .cse3 .cse15 .cse14) (and .cse2 .cse3 .cse13 .cse9 .cse15 .cse7) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse15 .cse9 .cse7 .cse17) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse11 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14) (and .cse1 .cse2 .cse5 .cse3 .cse4 .cse15 .cse7 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse6 .cse14 .cse17) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse15 .cse7 .cse17) (and .cse2 .cse5 .cse3 .cse13 .cse9 .cse7 .cse6) (and .cse1 .cse10 .cse2 .cse5 .cse3 .cse15 .cse9 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse9 .cse11 .cse15) (and .cse1 .cse10 .cse2 .cse5 .cse18 .cse3 .cse9 .cse6 .cse8) (and .cse2 .cse18 .cse3 .cse13 .cse15 .cse17)))) [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,154 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 16:51:40,155 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,156 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,157 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 16:51:40,158 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 16:51:40,159 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 16:51:40,160 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,161 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 16:51:40,161 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 16:51:40,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:51:40 BoogieIcfgContainer [2019-12-07 16:51:40,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:51:40,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:51:40,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:51:40,202 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:51:40,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:50" (3/4) ... [2019-12-07 16:51:40,204 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:51:40,228 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 16:51:40,230 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:51:40,362 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_49e59470-6537-4cf3-bd31-bae236cb20c5/bin/uautomizer/witness.graphml [2019-12-07 16:51:40,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:51:40,363 INFO L168 Benchmark]: Toolchain (without parser) took 51893.94 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 935.4 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,363 INFO L168 Benchmark]: CDTParser took 0.15 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 16:51:40,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 935.4 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,364 INFO L168 Benchmark]: Boogie Preprocessor took 63.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,364 INFO L168 Benchmark]: RCFGBuilder took 1226.66 ms. Allocated memory is still 1.1 GB. Free memory was 998.3 MB in the beginning and 976.5 MB in the end (delta: 21.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,364 INFO L168 Benchmark]: TraceAbstraction took 49783.80 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 976.5 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,364 INFO L168 Benchmark]: Witness Printer took 160.52 ms. Allocated memory is still 5.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:40,366 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 935.4 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1226.66 ms. Allocated memory is still 1.1 GB. Free memory was 998.3 MB in the beginning and 976.5 MB in the end (delta: 21.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49783.80 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 976.5 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 160.52 ms. Allocated memory is still 5.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1569]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((a10 == 1 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 == 1) && !(2 == a3)) && a16 == 1) || ((((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(2 == a3)) && a11 == 1) && a16 == 1)) || (((((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a5) && !(a12 == 1)) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a15 == 1)) || (((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(2 == a3)) && a15 == 1) && 1 == a4)) || ((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a4)) || ((((a18 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0)) || ((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a11 <= 0)) || ((((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3))) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && a16 == 1)) || ((((((((!(a26 == 1) && a18 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a5) && 0 == a3) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a4)) || ((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && !(2 == a3))) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && a15 == 1)) || ((((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && !(2 == a3)) && a11 == 1) && a16 == 1)) || (((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3))) || (((((a18 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && 1 == a4)) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(2 == a3)) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && !(a12 == 1))) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1) && 1 == a0)) || (((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(1 == a7)) && !(2 == a3))) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a7)) && a11 == 1)) || (((((a18 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(2 == a3)) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && 1 == a0)) || (((((a18 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && !(2 == a3))) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && a11 <= 0) && !(a12 == 1)) && !(2 == a3)) && 1 == a4)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a11 <= 0)) || (((((a6 <= 0 && a18 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && 1 == a4)) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(2 == a3)) && a11 == 1)) || (((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && a11 <= 0) && !(a12 == 1)) && 1 == a0)) || ((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 == 1) && a16 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((a10 == 1 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 == 1) && !(2 == a3)) && a16 == 1) || ((((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(2 == a3)) && a11 == 1) && a16 == 1)) || (((((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a5) && !(a12 == 1)) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a15 == 1)) || (((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(2 == a3)) && a15 == 1) && 1 == a4)) || ((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a4)) || ((((a18 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a0)) || ((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a11 <= 0)) || ((((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3))) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && a16 == 1)) || ((((((((!(a26 == 1) && a18 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a15 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a5) && 0 == a3) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a4)) || ((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && !(2 == a3))) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && a15 == 1)) || ((((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && !(2 == a3)) && a11 == 1) && a16 == 1)) || (((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3))) || (((((a18 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(2 == a3)) && a11 == 1) && 1 == a4)) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(2 == a3)) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && !(a26 == 1)) && a18 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && !(a12 == 1))) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1) && 1 == a0)) || (((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(1 == a7)) && !(2 == a3))) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((((a6 <= 0 && a10 == 1) && a18 == 1) && a27 == 1) && 1 == a5) && !(a12 == 1)) && !(1 == a7)) && a11 == 1)) || (((((a18 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a10 == 1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(2 == a3)) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && 1 == a0)) || (((((a18 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && !(2 == a3))) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && a11 <= 0) && !(a12 == 1)) && !(2 == a3)) && 1 == a4)) || ((((((a6 <= 0 && a10 == 1) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a11 <= 0)) || (((((a6 <= 0 && a18 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && !(2 == a3)) && 1 == a4)) || ((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(2 == a3)) && a11 == 1)) || (((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a5) && a11 <= 0) && !(a12 == 1)) && 1 == a0)) || ((((((a10 == 1 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((((((a6 <= 0 && !(a26 == 1)) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 == 1) && a16 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 39.4s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.2s, HoareTripleCheckerStatistics: 2220 SDtfs, 6865 SDslu, 1160 SDs, 0 SdLazy, 12724 SolverSat, 2323 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255008occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 23461 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 2160 NumberOfFragments, 2463 HoareAnnotationTreeSize, 3 FomulaSimplifications, 127846 FormulaSimplificationTreeSizeReduction, 5.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 9858 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 5168 NumberOfCodeBlocks, 5168 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5149 ConstructedInterpolants, 0 QuantifiedInterpolants, 2574062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 2627/2634 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...