./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/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 a2597194a43836f4c4ad9c950ead0db96723770b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:49:05,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:49:05,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:49:05,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:49:05,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:49:05,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:49:05,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:49:06,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:49:06,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:49:06,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:49:06,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:49:06,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:49:06,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:49:06,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:49:06,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:49:06,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:49:06,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:49:06,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:49:06,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:49:06,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:49:06,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:49:06,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:49:06,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:49:06,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:49:06,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:49:06,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:49:06,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:49:06,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:49:06,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:49:06,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:49:06,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:49:06,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:49:06,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:49:06,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:49:06,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:49:06,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:49:06,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:49:06,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:49:06,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:49:06,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:49:06,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:49:06,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:49:06,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:49:06,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:49:06,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:49:06,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:49:06,099 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:49:06,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:49:06,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:49:06,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:49:06,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:49:06,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:49:06,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:49:06,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:49:06,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:49:06,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:49:06,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:49:06,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:49:06,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:49:06,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:49:06,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:49:06,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:49:06,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:49:06,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:49:06,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:49:06,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:49:06,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:49:06,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:49:06,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:49:06,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:49:06,107 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_9c2e9df0-e9e2-4586-881c-0388d0a4d825/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 -> a2597194a43836f4c4ad9c950ead0db96723770b [2019-11-15 23:49:06,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:49:06,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:49:06,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:49:06,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:49:06,166 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:49:06,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2019-11-15 23:49:06,236 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/data/e0ef5f31b/f8f5351809b34f4293ce20203366987e/FLAGa6a91adbc [2019-11-15 23:49:06,791 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:49:06,792 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2019-11-15 23:49:06,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/data/e0ef5f31b/f8f5351809b34f4293ce20203366987e/FLAGa6a91adbc [2019-11-15 23:49:07,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/data/e0ef5f31b/f8f5351809b34f4293ce20203366987e [2019-11-15 23:49:07,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:49:07,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:49:07,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:07,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:49:07,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:49:07,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c06bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07, skipping insertion in model container [2019-11-15 23:49:07,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:49:07,150 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:49:07,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:07,678 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:49:07,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:07,807 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:49:07,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07 WrapperNode [2019-11-15 23:49:07,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:07,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:07,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:49:07,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:49:07,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:07,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:49:07,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:49:07,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:49:07,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... [2019-11-15 23:49:07,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:49:07,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:49:07,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:49:07,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:49:07,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/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-15 23:49:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:49:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:49:09,311 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:49:09,312 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:49:09,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:09 BoogieIcfgContainer [2019-11-15 23:49:09,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:49:09,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:49:09,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:49:09,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:49:09,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:49:07" (1/3) ... [2019-11-15 23:49:09,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bf59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:09, skipping insertion in model container [2019-11-15 23:49:09,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:07" (2/3) ... [2019-11-15 23:49:09,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bf59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:09, skipping insertion in model container [2019-11-15 23:49:09,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:09" (3/3) ... [2019-11-15 23:49:09,321 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label37.c [2019-11-15 23:49:09,331 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:49:09,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:49:09,350 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:49:09,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:49:09,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:49:09,387 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:49:09,387 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:49:09,387 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:49:09,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:49:09,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:49:09,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:49:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 23:49:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 23:49:09,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:09,435 INFO L380 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] [2019-11-15 23:49:09,437 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash -22624091, now seen corresponding path program 1 times [2019-11-15 23:49:09,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:09,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572347846] [2019-11-15 23:49:09,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,965 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-15 23:49:09,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572347846] [2019-11-15 23:49:09,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:09,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:49:09,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602649405] [2019-11-15 23:49:09,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:09,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:09,990 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-15 23:49:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:11,654 INFO L93 Difference]: Finished difference Result 747 states and 1324 transitions. [2019-11-15 23:49:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:49:11,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 23:49:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:11,674 INFO L225 Difference]: With dead ends: 747 [2019-11-15 23:49:11,674 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 23:49:11,679 INFO L600 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-15 23:49:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 23:49:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2019-11-15 23:49:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 23:49:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 614 transitions. [2019-11-15 23:49:11,777 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 614 transitions. Word has length 120 [2019-11-15 23:49:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:11,779 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 614 transitions. [2019-11-15 23:49:11,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:49:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 614 transitions. [2019-11-15 23:49:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 23:49:11,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:11,790 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:11,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1984016934, now seen corresponding path program 1 times [2019-11-15 23:49:11,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:11,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014254154] [2019-11-15 23:49:11,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:11,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:11,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:49:12,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014254154] [2019-11-15 23:49:12,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:12,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:49:12,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124651797] [2019-11-15 23:49:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:49:12,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:49:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:49:12,346 INFO L87 Difference]: Start difference. First operand 449 states and 614 transitions. Second operand 10 states. [2019-11-15 23:49:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:13,863 INFO L93 Difference]: Finished difference Result 1680 states and 2320 transitions. [2019-11-15 23:49:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:49:13,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-11-15 23:49:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:13,873 INFO L225 Difference]: With dead ends: 1680 [2019-11-15 23:49:13,873 INFO L226 Difference]: Without dead ends: 1233 [2019-11-15 23:49:13,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:49:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-11-15 23:49:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1227. [2019-11-15 23:49:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-11-15 23:49:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1511 transitions. [2019-11-15 23:49:13,936 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1511 transitions. Word has length 129 [2019-11-15 23:49:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:13,937 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 1511 transitions. [2019-11-15 23:49:13,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:49:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1511 transitions. [2019-11-15 23:49:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 23:49:13,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:13,947 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:49:13,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -188386209, now seen corresponding path program 1 times [2019-11-15 23:49:13,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:13,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217700497] [2019-11-15 23:49:13,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:13,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:13,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:49:14,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217700497] [2019-11-15 23:49:14,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:14,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:49:14,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114573989] [2019-11-15 23:49:14,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:14,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:14,137 INFO L87 Difference]: Start difference. First operand 1227 states and 1511 transitions. Second operand 4 states. [2019-11-15 23:49:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:15,198 INFO L93 Difference]: Finished difference Result 3726 states and 4633 transitions. [2019-11-15 23:49:15,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:49:15,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-15 23:49:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:15,210 INFO L225 Difference]: With dead ends: 3726 [2019-11-15 23:49:15,210 INFO L226 Difference]: Without dead ends: 1939 [2019-11-15 23:49:15,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-15 23:49:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1648. [2019-11-15 23:49:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-11-15 23:49:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1958 transitions. [2019-11-15 23:49:15,260 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1958 transitions. Word has length 158 [2019-11-15 23:49:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:15,262 INFO L462 AbstractCegarLoop]: Abstraction has 1648 states and 1958 transitions. [2019-11-15 23:49:15,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:49:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1958 transitions. [2019-11-15 23:49:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:49:15,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:15,267 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:49:15,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1084158728, now seen corresponding path program 1 times [2019-11-15 23:49:15,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:15,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13166947] [2019-11-15 23:49:15,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:15,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:15,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:49:15,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13166947] [2019-11-15 23:49:15,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:15,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:49:15,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19322594] [2019-11-15 23:49:15,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:15,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:15,383 INFO L87 Difference]: Start difference. First operand 1648 states and 1958 transitions. Second operand 4 states. [2019-11-15 23:49:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:16,372 INFO L93 Difference]: Finished difference Result 4141 states and 4956 transitions. [2019-11-15 23:49:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:49:16,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 23:49:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:16,387 INFO L225 Difference]: With dead ends: 4141 [2019-11-15 23:49:16,387 INFO L226 Difference]: Without dead ends: 2355 [2019-11-15 23:49:16,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2019-11-15 23:49:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2069. [2019-11-15 23:49:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2019-11-15 23:49:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2330 transitions. [2019-11-15 23:49:16,441 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2330 transitions. Word has length 184 [2019-11-15 23:49:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:16,442 INFO L462 AbstractCegarLoop]: Abstraction has 2069 states and 2330 transitions. [2019-11-15 23:49:16,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:49:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2330 transitions. [2019-11-15 23:49:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 23:49:16,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:16,448 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:16,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -523044025, now seen corresponding path program 1 times [2019-11-15 23:49:16,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:16,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590169169] [2019-11-15 23:49:16,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:16,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:49:16,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590169169] [2019-11-15 23:49:16,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:16,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:49:16,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616579560] [2019-11-15 23:49:16,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:49:16,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:49:16,666 INFO L87 Difference]: Start difference. First operand 2069 states and 2330 transitions. Second operand 3 states. [2019-11-15 23:49:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:17,170 INFO L93 Difference]: Finished difference Result 4130 states and 4620 transitions. [2019-11-15 23:49:17,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:17,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-15 23:49:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:17,181 INFO L225 Difference]: With dead ends: 4130 [2019-11-15 23:49:17,181 INFO L226 Difference]: Without dead ends: 2063 [2019-11-15 23:49:17,184 INFO L600 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-15 23:49:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-11-15 23:49:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1783. [2019-11-15 23:49:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2019-11-15 23:49:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1968 transitions. [2019-11-15 23:49:17,234 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1968 transitions. Word has length 232 [2019-11-15 23:49:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 1783 states and 1968 transitions. [2019-11-15 23:49:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:49:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1968 transitions. [2019-11-15 23:49:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 23:49:17,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:17,241 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:49:17,241 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1791661744, now seen corresponding path program 1 times [2019-11-15 23:49:17,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:17,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142425843] [2019-11-15 23:49:17,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 23:49:17,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142425843] [2019-11-15 23:49:17,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:17,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:49:17,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361231982] [2019-11-15 23:49:17,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:49:17,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:49:17,372 INFO L87 Difference]: Start difference. First operand 1783 states and 1968 transitions. Second operand 3 states. [2019-11-15 23:49:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:17,823 INFO L93 Difference]: Finished difference Result 3703 states and 4082 transitions. [2019-11-15 23:49:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:17,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-11-15 23:49:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:17,834 INFO L225 Difference]: With dead ends: 3703 [2019-11-15 23:49:17,834 INFO L226 Difference]: Without dead ends: 1781 [2019-11-15 23:49:17,837 INFO L600 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-15 23:49:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-11-15 23:49:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1361. [2019-11-15 23:49:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2019-11-15 23:49:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1466 transitions. [2019-11-15 23:49:17,882 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1466 transitions. Word has length 254 [2019-11-15 23:49:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:17,883 INFO L462 AbstractCegarLoop]: Abstraction has 1361 states and 1466 transitions. [2019-11-15 23:49:17,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:49:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1466 transitions. [2019-11-15 23:49:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-15 23:49:17,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:17,889 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:49:17,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2064272332, now seen corresponding path program 1 times [2019-11-15 23:49:17,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:17,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272846629] [2019-11-15 23:49:17,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 23:49:18,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272846629] [2019-11-15 23:49:18,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:18,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:49:18,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34016181] [2019-11-15 23:49:18,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:49:18,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:49:18,095 INFO L87 Difference]: Start difference. First operand 1361 states and 1466 transitions. Second operand 3 states. [2019-11-15 23:49:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:18,569 INFO L93 Difference]: Finished difference Result 3141 states and 3370 transitions. [2019-11-15 23:49:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:18,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-11-15 23:49:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:18,577 INFO L225 Difference]: With dead ends: 3141 [2019-11-15 23:49:18,578 INFO L226 Difference]: Without dead ends: 1499 [2019-11-15 23:49:18,580 INFO L600 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-15 23:49:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-11-15 23:49:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1357. [2019-11-15 23:49:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-11-15 23:49:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1421 transitions. [2019-11-15 23:49:18,610 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1421 transitions. Word has length 264 [2019-11-15 23:49:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:18,610 INFO L462 AbstractCegarLoop]: Abstraction has 1357 states and 1421 transitions. [2019-11-15 23:49:18,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:49:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1421 transitions. [2019-11-15 23:49:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-15 23:49:18,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:18,618 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:18,618 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash -163009168, now seen corresponding path program 1 times [2019-11-15 23:49:18,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:18,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891810052] [2019-11-15 23:49:18,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:18,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:18,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 231 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 23:49:19,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891810052] [2019-11-15 23:49:19,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875778345] [2019-11-15 23:49:19,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/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-15 23:49:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:49:19,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-15 23:49:19,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:19,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 23:49:19,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023947424] [2019-11-15 23:49:19,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:49:19,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:19,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:49:19,363 INFO L87 Difference]: Start difference. First operand 1357 states and 1421 transitions. Second operand 3 states. [2019-11-15 23:49:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:19,877 INFO L93 Difference]: Finished difference Result 2852 states and 2996 transitions. [2019-11-15 23:49:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:19,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-15 23:49:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:19,884 INFO L225 Difference]: With dead ends: 2852 [2019-11-15 23:49:19,884 INFO L226 Difference]: Without dead ends: 1213 [2019-11-15 23:49:19,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:49:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-15 23:49:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2019-11-15 23:49:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2019-11-15 23:49:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1262 transitions. [2019-11-15 23:49:19,920 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1262 transitions. Word has length 269 [2019-11-15 23:49:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:19,921 INFO L462 AbstractCegarLoop]: Abstraction has 1213 states and 1262 transitions. [2019-11-15 23:49:19,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:49:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1262 transitions. [2019-11-15 23:49:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-15 23:49:19,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:19,927 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:20,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:20,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1205889167, now seen corresponding path program 1 times [2019-11-15 23:49:20,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:20,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781874231] [2019-11-15 23:49:20,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:20,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 23:49:20,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781874231] [2019-11-15 23:49:20,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941375379] [2019-11-15 23:49:20,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/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-15 23:49:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:20,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:49:20,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-15 23:49:20,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:20,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-11-15 23:49:20,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218289321] [2019-11-15 23:49:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:49:20,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:49:20,808 INFO L87 Difference]: Start difference. First operand 1213 states and 1262 transitions. Second operand 3 states. [2019-11-15 23:49:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:21,053 INFO L93 Difference]: Finished difference Result 2140 states and 2225 transitions. [2019-11-15 23:49:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:21,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-15 23:49:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:21,055 INFO L225 Difference]: With dead ends: 2140 [2019-11-15 23:49:21,055 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:49:21,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:49:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:49:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:49:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:49:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:49:21,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2019-11-15 23:49:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:21,058 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:49:21,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:49:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:49:21,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:49:21,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:21,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:49:21,756 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-15 23:49:22,062 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-15 23:49:22,064 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,064 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,064 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 23:49:22,065 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 23:49:22,066 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 23:49:22,067 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 23:49:22,068 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 23:49:22,069 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 23:49:22,070 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 23:49:22,071 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 23:49:22,072 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,073 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,073 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,073 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 23:49:22,073 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 23:49:22,073 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,074 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,075 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 23:49:22,075 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 23:49:22,075 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 23:49:22,075 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 23:49:22,075 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,076 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 23:49:22,077 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,078 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 23:49:22,079 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 23:49:22,080 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse7 (= 1 ~a11~0))) (let ((.cse0 (not .cse7)) (.cse6 (not .cse1)) (.cse5 (= ~a21~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse8 (= 10 ~a28~0)) (.cse2 (= ~a25~0 1)) (.cse3 (<= ~a17~0 8))) (or (and .cse0 (<= ~a17~0 7) .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4) (and (or (and .cse0 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse5) (and .cse0 .cse5 (= 1 ULTIMATE.start_calculate_output_~input))) .cse1 .cse2 .cse3) (and .cse6 .cse5 .cse4 .cse7) (and .cse2 .cse3 .cse8) (and .cse0 (and .cse6 .cse4) .cse3) (and (not (= 8 ~a28~0)) (= ~a17~0 8) .cse5 .cse4) (and .cse1 .cse8) (and .cse1 (= ~a28~0 7) .cse2 .cse3)))) [2019-11-15 23:49:22,080 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,080 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,080 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 23:49:22,081 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 23:49:22,081 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 23:49:22,081 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 23:49:22,081 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 23:49:22,081 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 23:49:22,082 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 23:49:22,082 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,082 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,082 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 23:49:22,082 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 23:49:22,082 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 23:49:22,083 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 23:49:22,083 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 23:49:22,083 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 23:49:22,083 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 23:49:22,083 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 23:49:22,084 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 23:49:22,085 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 23:49:22,085 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 23:49:22,085 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 23:49:22,085 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse7 (= 1 ~a11~0))) (let ((.cse0 (not .cse7)) (.cse6 (not .cse1)) (.cse5 (= ~a21~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse8 (= 10 ~a28~0)) (.cse2 (= ~a25~0 1)) (.cse3 (<= ~a17~0 8))) (or (and .cse0 (<= ~a17~0 7) .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4) (and (or (and .cse0 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse5) (and .cse0 .cse5 (= 1 ULTIMATE.start_calculate_output_~input))) .cse1 .cse2 .cse3) (and .cse6 .cse5 .cse4 .cse7) (and .cse2 .cse3 .cse8) (and .cse0 (and .cse6 .cse4) .cse3) (and (not (= 8 ~a28~0)) (= ~a17~0 8) .cse5 .cse4) (and .cse1 .cse8) (and .cse1 (= ~a28~0 7) .cse2 .cse3)))) [2019-11-15 23:49:22,086 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,086 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,086 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 23:49:22,086 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 23:49:22,086 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 23:49:22,087 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 23:49:22,088 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 23:49:22,088 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 23:49:22,088 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 23:49:22,088 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 23:49:22,088 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 23:49:22,089 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 23:49:22,089 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 23:49:22,089 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,089 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,089 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 23:49:22,090 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,091 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 23:49:22,092 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 23:49:22,092 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 23:49:22,092 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 23:49:22,092 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 23:49:22,092 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 23:49:22,093 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,094 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 23:49:22,095 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 23:49:22,095 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 23:49:22,095 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 23:49:22,095 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 23:49:22,095 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,096 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,097 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 532) no Hoare annotation was computed. [2019-11-15 23:49:22,097 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 23:49:22,097 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 23:49:22,097 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 23:49:22,097 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 23:49:22,098 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 23:49:22,099 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 23:49:22,100 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 23:49:22,100 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 23:49:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:49:22 BoogieIcfgContainer [2019-11-15 23:49:22,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:49:22,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:49:22,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:49:22,123 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:49:22,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:09" (3/4) ... [2019-11-15 23:49:22,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:49:22,171 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:49:22,173 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:49:22,368 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9c2e9df0-e9e2-4586-881c-0388d0a4d825/bin/uautomizer/witness.graphml [2019-11-15 23:49:22,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:49:22,370 INFO L168 Benchmark]: Toolchain (without parser) took 15291.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -413.6 MB). Peak memory consumption was 517.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,370 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:49:22,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,371 INFO L168 Benchmark]: Boogie Preprocessor took 76.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,372 INFO L168 Benchmark]: RCFGBuilder took 1323.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.3 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,372 INFO L168 Benchmark]: TraceAbstraction took 12808.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 959.3 MB in the beginning and 804.0 MB in the end (delta: 155.3 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:22,373 INFO L168 Benchmark]: Witness Printer took 246.04 ms. Allocated memory is still 1.4 GB. Free memory was 804.0 MB in the beginning and 1.4 GB in the end (delta: -549.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:49:22,375 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 730.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1323.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.3 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12808.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 959.3 MB in the beginning and 804.0 MB in the end (delta: 155.3 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. * Witness Printer took 246.04 ms. Allocated memory is still 1.4 GB. Free memory was 804.0 MB in the beginning and 1.4 GB in the end (delta: -549.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 532]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a11) && a17 <= 7) && a19 == 1) && a25 == 1) || (((!(1 == a11) && a25 == 1) && a17 <= 8) && !(a28 == 11))) || ((((((!(1 == a11) && ((4 == input || 6 == input) || 5 == input)) && a21 == 1) || ((!(1 == a11) && a21 == 1) && 1 == input)) && a19 == 1) && a25 == 1) && a17 <= 8)) || (((!(a19 == 1) && a21 == 1) && !(a28 == 11)) && 1 == a11)) || ((a25 == 1 && a17 <= 8) && 10 == a28)) || ((!(1 == a11) && !(a19 == 1) && !(a28 == 11)) && a17 <= 8)) || (((!(8 == a28) && a17 == 8) && a21 == 1) && !(a28 == 11))) || (a19 == 1 && 10 == a28)) || (((a19 == 1 && a28 == 7) && a25 == 1) && a17 <= 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a11) && a17 <= 7) && a19 == 1) && a25 == 1) || (((!(1 == a11) && a25 == 1) && a17 <= 8) && !(a28 == 11))) || ((((((!(1 == a11) && ((4 == input || 6 == input) || 5 == input)) && a21 == 1) || ((!(1 == a11) && a21 == 1) && 1 == input)) && a19 == 1) && a25 == 1) && a17 <= 8)) || (((!(a19 == 1) && a21 == 1) && !(a28 == 11)) && 1 == a11)) || ((a25 == 1 && a17 <= 8) && 10 == a28)) || ((!(1 == a11) && !(a19 == 1) && !(a28 == 11)) && a17 <= 8)) || (((!(8 == a28) && a17 == 8) && a21 == 1) && !(a28 == 11))) || (a19 == 1 && 10 == a28)) || (((a19 == 1 && a28 == 7) && a25 == 1) && a17 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 917 SDtfs, 2122 SDslu, 227 SDs, 0 SdLazy, 4598 SolverSat, 920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 558 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2069occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1429 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 295 HoareAnnotationTreeSize, 3 FomulaSimplifications, 676 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 654 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2427 NumberOfCodeBlocks, 2427 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 879 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2067/2196 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...