./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c -s /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/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 f6f6898c620b0d8224e47aa166b6d9a445824f7a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:27:21,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:27:21,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:27:21,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:27:21,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:27:21,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:27:21,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:27:21,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:27:21,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:27:21,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:27:21,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:27:21,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:27:21,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:27:21,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:27:21,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:27:21,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:27:21,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:27:21,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:27:21,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:27:21,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:27:21,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:27:21,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:27:21,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:27:21,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:27:21,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:27:21,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:27:21,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:27:21,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:27:21,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:27:21,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:27:21,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:27:21,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:27:21,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:27:21,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:27:21,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:27:21,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:27:21,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:27:21,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:27:21,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:27:21,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:27:21,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:27:21,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:27:21,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:27:21,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:27:21,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:27:21,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:27:21,421 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:27:21,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:27:21,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:27:21,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:27:21,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:27:21,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:27:21,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:27:21,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:27:21,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:27:21,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:27:21,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:27:21,424 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:27:21,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:27:21,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:27:21,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:27:21,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:27:21,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:27:21,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:27:21,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:27:21,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:27:21,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:27:21,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:27:21,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:27:21,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:27:21,428 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_94caa759-d658-4826-a4a9-35fd26af58e0/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 -> f6f6898c620b0d8224e47aa166b6d9a445824f7a [2019-11-19 22:27:21,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:27:21,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:27:21,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:27:21,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:27:21,620 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:27:21,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2019-11-19 22:27:21,681 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/data/0f2f85493/3171e8ec92b0405ab143808ab0a00636/FLAGfc70fd746 [2019-11-19 22:27:22,262 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:27:22,263 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2019-11-19 22:27:22,282 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/data/0f2f85493/3171e8ec92b0405ab143808ab0a00636/FLAGfc70fd746 [2019-11-19 22:27:22,417 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/data/0f2f85493/3171e8ec92b0405ab143808ab0a00636 [2019-11-19 22:27:22,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:27:22,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:27:22,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:27:22,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:27:22,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:27:22,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:27:22" (1/1) ... [2019-11-19 22:27:22,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa37bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:22, skipping insertion in model container [2019-11-19 22:27:22,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:27:22" (1/1) ... [2019-11-19 22:27:22,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:27:22,546 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:27:23,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:27:23,408 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:27:23,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:27:23,726 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:27:23,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23 WrapperNode [2019-11-19 22:27:23,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:27:23,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:27:23,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:27:23,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:27:23,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:27:23,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:27:23,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:27:23,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:27:23,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:23,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:24,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... [2019-11-19 22:27:24,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:27:24,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:27:24,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:27:24,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:27:24,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:27:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:27:24,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:27:26,316 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:27:26,316 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 22:27:26,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:27:26 BoogieIcfgContainer [2019-11-19 22:27:26,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:27:26,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:27:26,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:27:26,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:27:26,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:27:22" (1/3) ... [2019-11-19 22:27:26,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd69c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:27:26, skipping insertion in model container [2019-11-19 22:27:26,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:23" (2/3) ... [2019-11-19 22:27:26,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd69c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:27:26, skipping insertion in model container [2019-11-19 22:27:26,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:27:26" (3/3) ... [2019-11-19 22:27:26,326 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2019-11-19 22:27:26,336 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:27:26,344 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:27:26,356 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:27:26,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:27:26,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:27:26,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:27:26,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:27:26,387 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:27:26,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:27:26,387 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:27:26,387 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:27:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-19 22:27:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-19 22:27:26,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:26,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:26,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1825602715, now seen corresponding path program 1 times [2019-11-19 22:27:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704768129] [2019-11-19 22:27:26,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:27:27,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704768129] [2019-11-19 22:27:27,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:27,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:27:27,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844147291] [2019-11-19 22:27:27,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:27,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:27,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:27,269 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-19 22:27:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:29,104 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-19 22:27:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:29,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-19 22:27:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:29,127 INFO L225 Difference]: With dead ends: 829 [2019-11-19 22:27:29,127 INFO L226 Difference]: Without dead ends: 463 [2019-11-19 22:27:29,132 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-11-19 22:27:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-19 22:27:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-19 22:27:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-19 22:27:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-19 22:27:29,220 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 201 [2019-11-19 22:27:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:29,221 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-19 22:27:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-19 22:27:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-19 22:27:29,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:29,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:29,228 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1178885579, now seen corresponding path program 1 times [2019-11-19 22:27:29,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:29,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792030401] [2019-11-19 22:27:29,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:27:29,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792030401] [2019-11-19 22:27:29,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:29,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:29,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973917673] [2019-11-19 22:27:29,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:27:29,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:27:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:29,381 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-19 22:27:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:31,202 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-19 22:27:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:27:31,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-19 22:27:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:31,213 INFO L225 Difference]: With dead ends: 1737 [2019-11-19 22:27:31,213 INFO L226 Difference]: Without dead ends: 1290 [2019-11-19 22:27:31,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-19 22:27:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-19 22:27:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-19 22:27:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-19 22:27:31,265 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 206 [2019-11-19 22:27:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:31,266 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-19 22:27:31,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:27:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-19 22:27:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 22:27:31,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:31,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:31,277 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1955705264, now seen corresponding path program 1 times [2019-11-19 22:27:31,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:31,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281883010] [2019-11-19 22:27:31,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:27:31,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281883010] [2019-11-19 22:27:31,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:31,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:31,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433456316] [2019-11-19 22:27:31,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:31,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:31,590 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 3 states. [2019-11-19 22:27:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:32,665 INFO L93 Difference]: Finished difference Result 2541 states and 3899 transitions. [2019-11-19 22:27:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:32,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-19 22:27:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:32,686 INFO L225 Difference]: With dead ends: 2541 [2019-11-19 22:27:32,687 INFO L226 Difference]: Without dead ends: 1684 [2019-11-19 22:27:32,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-19 22:27:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1683. [2019-11-19 22:27:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-19 22:27:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-19 22:27:32,761 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 208 [2019-11-19 22:27:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:32,764 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-19 22:27:32,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-19 22:27:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-19 22:27:32,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:32,782 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:32,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash -577423835, now seen corresponding path program 1 times [2019-11-19 22:27:32,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:32,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480660561] [2019-11-19 22:27:32,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 22:27:32,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480660561] [2019-11-19 22:27:32,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:32,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:27:32,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850713177] [2019-11-19 22:27:32,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:32,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:32,888 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-19 22:27:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:34,088 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-19 22:27:34,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:34,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-19 22:27:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:34,104 INFO L225 Difference]: With dead ends: 4189 [2019-11-19 22:27:34,104 INFO L226 Difference]: Without dead ends: 2508 [2019-11-19 22:27:34,108 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-11-19 22:27:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-19 22:27:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-19 22:27:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-19 22:27:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-19 22:27:34,173 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 216 [2019-11-19 22:27:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:34,174 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-19 22:27:34,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-19 22:27:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-19 22:27:34,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:34,183 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:34,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:34,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2019535467, now seen corresponding path program 1 times [2019-11-19 22:27:34,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:34,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012256301] [2019-11-19 22:27:34,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 22:27:34,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012256301] [2019-11-19 22:27:34,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:34,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:27:34,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848080265] [2019-11-19 22:27:34,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:34,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:34,314 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-19 22:27:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:34,857 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-19 22:27:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:34,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-19 22:27:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:34,893 INFO L225 Difference]: With dead ends: 7497 [2019-11-19 22:27:34,893 INFO L226 Difference]: Without dead ends: 4992 [2019-11-19 22:27:34,899 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-11-19 22:27:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-19 22:27:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-19 22:27:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-19 22:27:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-19 22:27:35,030 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 221 [2019-11-19 22:27:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:35,031 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-19 22:27:35,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-19 22:27:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-19 22:27:35,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:35,045 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:35,045 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1510049729, now seen corresponding path program 1 times [2019-11-19 22:27:35,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:35,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830330332] [2019-11-19 22:27:35,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 22:27:35,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830330332] [2019-11-19 22:27:35,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352196919] [2019-11-19 22:27:35,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:35,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:27:35,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:27:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 22:27:35,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:27:35,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-19 22:27:35,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035635743] [2019-11-19 22:27:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:35,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:35,490 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-19 22:27:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:35,940 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-19 22:27:35,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:35,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-19 22:27:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:36,000 INFO L225 Difference]: With dead ends: 14957 [2019-11-19 22:27:36,000 INFO L226 Difference]: Without dead ends: 9970 [2019-11-19 22:27:36,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-19 22:27:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-19 22:27:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-19 22:27:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-19 22:27:36,263 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 230 [2019-11-19 22:27:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:36,267 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-19 22:27:36,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-19 22:27:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-19 22:27:36,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:36,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:36,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:36,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -165449129, now seen corresponding path program 1 times [2019-11-19 22:27:36,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:36,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322815087] [2019-11-19 22:27:36,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:27:36,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322815087] [2019-11-19 22:27:36,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:36,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:27:36,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320534554] [2019-11-19 22:27:36,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:27:36,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:36,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:27:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:27:36,904 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-19 22:27:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:38,911 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-19 22:27:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:27:38,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-11-19 22:27:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:38,965 INFO L225 Difference]: With dead ends: 22448 [2019-11-19 22:27:38,965 INFO L226 Difference]: Without dead ends: 12482 [2019-11-19 22:27:38,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:27:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-19 22:27:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-19 22:27:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-19 22:27:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-19 22:27:39,182 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 239 [2019-11-19 22:27:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-19 22:27:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:27:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-19 22:27:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-19 22:27:39,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:39,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:39,207 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2048084382, now seen corresponding path program 1 times [2019-11-19 22:27:39,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:39,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881902246] [2019-11-19 22:27:39,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:27:39,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881902246] [2019-11-19 22:27:39,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:39,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:39,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736571725] [2019-11-19 22:27:39,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:39,390 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-19 22:27:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:40,723 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-19 22:27:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:40,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-19 22:27:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:40,744 INFO L225 Difference]: With dead ends: 21582 [2019-11-19 22:27:40,744 INFO L226 Difference]: Without dead ends: 10804 [2019-11-19 22:27:40,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-19 22:27:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-19 22:27:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-19 22:27:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-19 22:27:40,911 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 239 [2019-11-19 22:27:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:40,912 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-19 22:27:40,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-19 22:27:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-19 22:27:40,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:40,934 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:40,934 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 543919919, now seen corresponding path program 1 times [2019-11-19 22:27:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:40,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979569986] [2019-11-19 22:27:40,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:27:41,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979569986] [2019-11-19 22:27:41,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:41,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:41,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81001893] [2019-11-19 22:27:41,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:27:41,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:27:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:41,067 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-19 22:27:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:42,711 INFO L93 Difference]: Finished difference Result 39482 states and 52679 transitions. [2019-11-19 22:27:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:27:42,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-19 22:27:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:42,757 INFO L225 Difference]: With dead ends: 39482 [2019-11-19 22:27:42,758 INFO L226 Difference]: Without dead ends: 28704 [2019-11-19 22:27:42,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28704 states. [2019-11-19 22:27:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28704 to 20132. [2019-11-19 22:27:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-19 22:27:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26025 transitions. [2019-11-19 22:27:43,258 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26025 transitions. Word has length 239 [2019-11-19 22:27:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:43,259 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26025 transitions. [2019-11-19 22:27:43,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:27:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26025 transitions. [2019-11-19 22:27:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-19 22:27:43,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:43,298 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:43,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1047521392, now seen corresponding path program 1 times [2019-11-19 22:27:43,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:43,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192639690] [2019-11-19 22:27:43,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:27:43,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192639690] [2019-11-19 22:27:43,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:43,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:43,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223841400] [2019-11-19 22:27:43,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:43,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:43,435 INFO L87 Difference]: Start difference. First operand 20132 states and 26025 transitions. Second operand 3 states. [2019-11-19 22:27:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:44,852 INFO L93 Difference]: Finished difference Result 55495 states and 71437 transitions. [2019-11-19 22:27:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:44,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-19 22:27:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:44,893 INFO L225 Difference]: With dead ends: 55495 [2019-11-19 22:27:44,894 INFO L226 Difference]: Without dead ends: 35365 [2019-11-19 22:27:44,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-19 22:27:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-19 22:27:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-19 22:27:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41632 transitions. [2019-11-19 22:27:45,347 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41632 transitions. Word has length 245 [2019-11-19 22:27:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:45,348 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41632 transitions. [2019-11-19 22:27:45,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41632 transitions. [2019-11-19 22:27:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-19 22:27:45,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:45,387 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:45,387 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 195659315, now seen corresponding path program 1 times [2019-11-19 22:27:45,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:45,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319100718] [2019-11-19 22:27:45,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:27:45,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319100718] [2019-11-19 22:27:45,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846368195] [2019-11-19 22:27:45,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:45,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:27:45,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:27:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 22:27:46,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:27:46,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-19 22:27:46,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447914210] [2019-11-19 22:27:46,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:46,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:27:46,038 INFO L87 Difference]: Start difference. First operand 35357 states and 41632 transitions. Second operand 3 states. [2019-11-19 22:27:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:46,688 INFO L93 Difference]: Finished difference Result 102510 states and 120668 transitions. [2019-11-19 22:27:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:46,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-19 22:27:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:46,751 INFO L225 Difference]: With dead ends: 102510 [2019-11-19 22:27:46,751 INFO L226 Difference]: Without dead ends: 67155 [2019-11-19 22:27:46,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:27:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67155 states. [2019-11-19 22:27:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67155 to 67149. [2019-11-19 22:27:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67149 states. [2019-11-19 22:27:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67149 states to 67149 states and 79021 transitions. [2019-11-19 22:27:47,875 INFO L78 Accepts]: Start accepts. Automaton has 67149 states and 79021 transitions. Word has length 269 [2019-11-19 22:27:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 67149 states and 79021 transitions. [2019-11-19 22:27:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 67149 states and 79021 transitions. [2019-11-19 22:27:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-19 22:27:47,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:47,913 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:48,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:48,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -515489302, now seen corresponding path program 1 times [2019-11-19 22:27:48,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:48,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005806511] [2019-11-19 22:27:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:27:48,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005806511] [2019-11-19 22:27:48,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:48,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:48,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596687427] [2019-11-19 22:27:48,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:48,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:48,300 INFO L87 Difference]: Start difference. First operand 67149 states and 79021 transitions. Second operand 3 states. [2019-11-19 22:27:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:49,997 INFO L93 Difference]: Finished difference Result 159671 states and 190266 transitions. [2019-11-19 22:27:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:49,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-19 22:27:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:50,083 INFO L225 Difference]: With dead ends: 159671 [2019-11-19 22:27:50,084 INFO L226 Difference]: Without dead ends: 92524 [2019-11-19 22:27:50,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92524 states. [2019-11-19 22:27:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92524 to 92524. [2019-11-19 22:27:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92524 states. [2019-11-19 22:27:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92524 states to 92524 states and 106045 transitions. [2019-11-19 22:27:51,553 INFO L78 Accepts]: Start accepts. Automaton has 92524 states and 106045 transitions. Word has length 278 [2019-11-19 22:27:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:51,553 INFO L462 AbstractCegarLoop]: Abstraction has 92524 states and 106045 transitions. [2019-11-19 22:27:51,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 92524 states and 106045 transitions. [2019-11-19 22:27:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-19 22:27:51,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:51,603 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 22:27:51,603 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash 571873565, now seen corresponding path program 1 times [2019-11-19 22:27:51,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:51,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015990906] [2019-11-19 22:27:51,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:27:51,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015990906] [2019-11-19 22:27:51,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:51,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:51,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856807051] [2019-11-19 22:27:51,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:27:51,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:27:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:51,812 INFO L87 Difference]: Start difference. First operand 92524 states and 106045 transitions. Second operand 4 states. [2019-11-19 22:27:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:53,774 INFO L93 Difference]: Finished difference Result 256447 states and 294319 transitions. [2019-11-19 22:27:53,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:27:53,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-19 22:27:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:53,939 INFO L225 Difference]: With dead ends: 256447 [2019-11-19 22:27:53,939 INFO L226 Difference]: Without dead ends: 163925 [2019-11-19 22:27:53,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:27:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163925 states. [2019-11-19 22:27:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163925 to 126425. [2019-11-19 22:27:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126425 states. [2019-11-19 22:27:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126425 states to 126425 states and 145685 transitions. [2019-11-19 22:27:56,354 INFO L78 Accepts]: Start accepts. Automaton has 126425 states and 145685 transitions. Word has length 299 [2019-11-19 22:27:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:56,354 INFO L462 AbstractCegarLoop]: Abstraction has 126425 states and 145685 transitions. [2019-11-19 22:27:56,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:27:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 126425 states and 145685 transitions. [2019-11-19 22:27:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-19 22:27:56,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:56,411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 22:27:56,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1000248581, now seen corresponding path program 1 times [2019-11-19 22:27:56,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:56,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176790700] [2019-11-19 22:27:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 22:27:56,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176790700] [2019-11-19 22:27:56,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:56,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:27:56,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726039349] [2019-11-19 22:27:56,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:56,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:56,626 INFO L87 Difference]: Start difference. First operand 126425 states and 145685 transitions. Second operand 3 states. [2019-11-19 22:27:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:58,818 INFO L93 Difference]: Finished difference Result 252840 states and 291360 transitions. [2019-11-19 22:27:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:58,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-19 22:27:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:58,941 INFO L225 Difference]: With dead ends: 252840 [2019-11-19 22:27:58,941 INFO L226 Difference]: Without dead ends: 126417 [2019-11-19 22:27:58,985 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-11-19 22:27:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126417 states. [2019-11-19 22:28:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126417 to 126417. [2019-11-19 22:28:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126417 states. [2019-11-19 22:28:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126417 states to 126417 states and 145661 transitions. [2019-11-19 22:28:00,244 INFO L78 Accepts]: Start accepts. Automaton has 126417 states and 145661 transitions. Word has length 326 [2019-11-19 22:28:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:00,244 INFO L462 AbstractCegarLoop]: Abstraction has 126417 states and 145661 transitions. [2019-11-19 22:28:00,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:28:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 126417 states and 145661 transitions. [2019-11-19 22:28:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-19 22:28:00,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:00,300 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:28:00,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1115478692, now seen corresponding path program 1 times [2019-11-19 22:28:00,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:00,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71077367] [2019-11-19 22:28:00,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-19 22:28:04,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71077367] [2019-11-19 22:28:04,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:28:04,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:28:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250447765] [2019-11-19 22:28:04,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:28:04,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:28:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:28:04,455 INFO L87 Difference]: Start difference. First operand 126417 states and 145661 transitions. Second operand 3 states. [2019-11-19 22:28:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:05,452 INFO L93 Difference]: Finished difference Result 233377 states and 268997 transitions. [2019-11-19 22:28:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:28:05,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-11-19 22:28:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:05,562 INFO L225 Difference]: With dead ends: 233377 [2019-11-19 22:28:05,562 INFO L226 Difference]: Without dead ends: 106962 [2019-11-19 22:28:05,607 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-11-19 22:28:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106962 states. [2019-11-19 22:28:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106962 to 60220. [2019-11-19 22:28:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-19 22:28:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 68997 transitions. [2019-11-19 22:28:06,456 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 68997 transitions. Word has length 327 [2019-11-19 22:28:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:06,456 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 68997 transitions. [2019-11-19 22:28:06,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:28:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 68997 transitions. [2019-11-19 22:28:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-19 22:28:06,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:06,480 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:28:06,480 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1143996101, now seen corresponding path program 1 times [2019-11-19 22:28:06,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:06,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834142359] [2019-11-19 22:28:06,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-19 22:28:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834142359] [2019-11-19 22:28:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053843153] [2019-11-19 22:28:06,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:28:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:06,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:28:06,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:28:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 22:28:06,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:28:06,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-19 22:28:06,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313331161] [2019-11-19 22:28:06,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:28:06,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:28:06,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:28:06,945 INFO L87 Difference]: Start difference. First operand 60220 states and 68997 transitions. Second operand 3 states. [2019-11-19 22:28:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:07,898 INFO L93 Difference]: Finished difference Result 123718 states and 141396 transitions. [2019-11-19 22:28:07,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:28:07,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-19 22:28:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:07,899 INFO L225 Difference]: With dead ends: 123718 [2019-11-19 22:28:07,899 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:28:07,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 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-11-19 22:28:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:28:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:28:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:28:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:28:07,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2019-11-19 22:28:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:07,926 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:28:07,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:28:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:28:07,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:28:08,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:28:08,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:28:11,954 WARN L191 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-19 22:28:14,643 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-19 22:28:17,095 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 437 DAG size of output: 55 [2019-11-19 22:28:19,268 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 437 DAG size of output: 55 [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,270 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-19 22:28:19,271 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,272 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,273 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-19 22:28:19,274 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-19 22:28:19,275 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,276 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,277 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-19 22:28:19,278 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,279 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-19 22:28:19,280 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-19 22:28:19,281 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-19 22:28:19,282 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-19 22:28:19,282 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,282 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,282 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,283 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse14 (= ~a12~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (= ~a27~0 1)) (.cse13 (not .cse14))) (let ((.cse6 (and .cse7 .cse13)) (.cse4 (= 1 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse3 (= ~a26~0 1)) (.cse12 (<= ~a3~0 0)) (.cse1 (= ~a18~0 1)) (.cse11 (and .cse0 .cse9)) (.cse5 (<= ~a26~0 0)) (.cse2 (= ~a5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse2) (and .cse1 .cse6 .cse5 .cse2) (and .cse0 .cse1 .cse6 .cse2) (and .cse0 .cse1 .cse7 .cse5 .cse2 .cse8) (and .cse1 .cse2 (and .cse6 .cse9)) (and .cse1 (and .cse0 .cse10) .cse5 .cse2) (and .cse11 .cse1 .cse4 .cse2) (and .cse12 .cse1 .cse7 .cse2) (and .cse1 .cse5 .cse2 (and .cse13 .cse9)) (and (<= ~a6~0 0) .cse1 .cse2 .cse3) (and .cse1 (and .cse0 .cse7 .cse9) .cse5 .cse2) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse3) (and .cse1 .cse4 .cse14 .cse5 .cse2 .cse10) (and .cse12 .cse1 .cse2 .cse3) (and .cse0 .cse13 .cse1 .cse5 .cse2) (and .cse0 .cse13 .cse1 .cse2 .cse8) (and .cse1 .cse7 .cse14 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3) (and .cse12 .cse1 .cse11 .cse5 .cse2))))) [2019-11-19 22:28:19,283 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,283 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,283 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:28:19,284 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1638) no Hoare annotation was computed. [2019-11-19 22:28:19,285 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,285 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-19 22:28:19,285 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,285 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,285 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,285 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,286 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-19 22:28:19,287 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,288 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse14 (= ~a12~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (= ~a27~0 1)) (.cse13 (not .cse14))) (let ((.cse6 (and .cse7 .cse13)) (.cse4 (= 1 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse3 (= ~a26~0 1)) (.cse12 (<= ~a3~0 0)) (.cse1 (= ~a18~0 1)) (.cse11 (and .cse0 .cse9)) (.cse5 (<= ~a26~0 0)) (.cse2 (= ~a5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse2) (and .cse1 .cse6 .cse5 .cse2) (and .cse0 .cse1 .cse6 .cse2) (and .cse0 .cse1 .cse7 .cse5 .cse2 .cse8) (and .cse1 .cse2 (and .cse6 .cse9)) (and .cse1 (and .cse0 .cse10) .cse5 .cse2) (and .cse11 .cse1 .cse4 .cse2) (and .cse12 .cse1 .cse7 .cse2) (and .cse1 .cse5 .cse2 (and .cse13 .cse9)) (and (<= ~a6~0 0) .cse1 .cse2 .cse3) (and .cse1 (and .cse0 .cse7 .cse9) .cse5 .cse2) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse3) (and .cse1 .cse4 .cse14 .cse5 .cse2 .cse10) (and .cse12 .cse1 .cse2 .cse3) (and .cse0 .cse13 .cse1 .cse5 .cse2) (and .cse0 .cse13 .cse1 .cse2 .cse8) (and .cse1 .cse7 .cse14 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3) (and .cse12 .cse1 .cse11 .cse5 .cse2))))) [2019-11-19 22:28:19,288 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,289 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,290 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,291 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-19 22:28:19,292 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,293 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,294 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,295 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,296 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,296 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,296 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-19 22:28:19,297 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-19 22:28:19,297 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,297 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-19 22:28:19,298 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,299 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-19 22:28:19,300 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,301 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-19 22:28:19,302 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-19 22:28:19,303 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-19 22:28:19,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:28:19 BoogieIcfgContainer [2019-11-19 22:28:19,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:28:19,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:28:19,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:28:19,342 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:28:19,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:27:26" (3/4) ... [2019-11-19 22:28:19,346 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:28:19,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 22:28:19,392 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:28:19,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_94caa759-d658-4826-a4a9-35fd26af58e0/bin/uautomizer/witness.graphml [2019-11-19 22:28:19,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:28:19,631 INFO L168 Benchmark]: Toolchain (without parser) took 57210.73 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 944.8 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,631 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:28:19,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1306.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,632 INFO L168 Benchmark]: Boogie Preprocessor took 139.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,633 INFO L168 Benchmark]: RCFGBuilder took 2299.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,633 INFO L168 Benchmark]: TraceAbstraction took 53022.21 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,634 INFO L168 Benchmark]: Witness Printer took 288.04 ms. Allocated memory is still 4.4 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:28:19,636 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1306.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2299.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53022.21 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 288.04 ms. Allocated memory is still 4.4 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1638]: 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: (((((((((((((((((((((!(1 == a11) && a18 == 1) && a5 == 1) && a26 == 1) || ((((!(1 == a11) && a18 == 1) && 1 == a3) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || (((!(1 == a11) && a18 == 1) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(1 == a11) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((a18 == 1 && a5 == 1) && (a27 == 1 && !(a12 == 1)) && !(1 == a6))) || (((a18 == 1 && !(1 == a11) && a16 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(1 == a6)) && a18 == 1) && 1 == a3) && a5 == 1)) || (((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1)) || (((a18 == 1 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((a18 == 1 && (!(1 == a11) && a27 == 1) && !(1 == a6)) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && a27 == 1) && a5 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && 1 == a3) && a12 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a5 == 1) && a29 == 1)) || ((((a18 == 1 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && !(1 == a11) && !(1 == a6)) && a26 <= 0) && a5 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == a11) && a18 == 1) && a5 == 1) && a26 == 1) || ((((!(1 == a11) && a18 == 1) && 1 == a3) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || (((!(1 == a11) && a18 == 1) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(1 == a11) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((a18 == 1 && a5 == 1) && (a27 == 1 && !(a12 == 1)) && !(1 == a6))) || (((a18 == 1 && !(1 == a11) && a16 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(1 == a6)) && a18 == 1) && 1 == a3) && a5 == 1)) || (((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1)) || (((a18 == 1 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((a18 == 1 && (!(1 == a11) && a27 == 1) && !(1 == a6)) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && a27 == 1) && a5 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && 1 == a3) && a12 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a5 == 1) && a29 == 1)) || ((((a18 == 1 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && !(1 == a11) && !(1 == a6)) && a26 <= 0) && a5 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 52.9s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.1s, HoareTripleCheckerStatistics: 3237 SDtfs, 5456 SDslu, 1446 SDs, 0 SdLazy, 9602 SolverSat, 1909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 846 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126425occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 95006 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 625 NumberOfFragments, 707 HoareAnnotationTreeSize, 3 FomulaSimplifications, 54814 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 21184 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 4906 NumberOfCodeBlocks, 4906 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4887 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060154 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 1612/1626 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...