./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/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 32be2810d9c37c4b52439355c8a9e3577edf70e1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:50:15,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:15,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:15,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:15,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:15,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:15,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:15,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:15,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:15,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:15,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:15,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:15,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:15,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:15,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:15,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:15,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:15,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:15,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:15,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:15,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:15,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:15,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:15,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:15,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:15,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:15,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:15,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:15,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:15,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:15,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:15,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:15,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:15,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:15,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:15,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:15,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:15,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:15,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:15,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:15,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:15,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:15,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:15,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:15,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:15,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:15,247 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:15,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:15,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:15,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:15,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:15,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:15,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:15,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:15,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:15,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:15,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:15,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:15,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:15,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:15,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:15,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:15,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:15,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:15,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:15,252 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_958b08bd-8ffd-4051-a2e4-8919f4e715f2/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 -> 32be2810d9c37c4b52439355c8a9e3577edf70e1 [2019-11-25 08:50:15,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:15,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:15,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:15,451 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:15,452 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:15,453 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-25 08:50:15,523 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/data/e3a116a46/2fdc9000f9714549add5d692d1a83b7e/FLAGf7dcfde0a [2019-11-25 08:50:16,001 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:16,002 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-25 08:50:16,012 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/data/e3a116a46/2fdc9000f9714549add5d692d1a83b7e/FLAGf7dcfde0a [2019-11-25 08:50:16,526 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/data/e3a116a46/2fdc9000f9714549add5d692d1a83b7e [2019-11-25 08:50:16,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:16,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:16,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:16,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:16,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:16,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:16" (1/1) ... [2019-11-25 08:50:16,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312eab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:16, skipping insertion in model container [2019-11-25 08:50:16,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:16" (1/1) ... [2019-11-25 08:50:16,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:16,599 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:17,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:17,033 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:17,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:17,135 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:17,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17 WrapperNode [2019-11-25 08:50:17,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:17,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:17,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:17,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:17,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:17,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:17,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:17,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:17,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... [2019-11-25 08:50:17,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:17,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:17,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:17,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:17,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/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-25 08:50:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:18,507 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:18,508 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:50:18,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:18 BoogieIcfgContainer [2019-11-25 08:50:18,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:18,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:18,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:18,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:18,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:16" (1/3) ... [2019-11-25 08:50:18,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:18, skipping insertion in model container [2019-11-25 08:50:18,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:17" (2/3) ... [2019-11-25 08:50:18,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:18, skipping insertion in model container [2019-11-25 08:50:18,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:18" (3/3) ... [2019-11-25 08:50:18,518 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2019-11-25 08:50:18,527 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:18,534 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:50:18,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:50:18,563 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:18,563 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:18,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:18,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:18,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:18,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:18,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:18,564 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:50:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-25 08:50:18,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:18,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:18,597 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1911993682, now seen corresponding path program 1 times [2019-11-25 08:50:18,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:18,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053284031] [2019-11-25 08:50:18,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:18,986 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-25 08:50:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053284031] [2019-11-25 08:50:18,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:18,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:18,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279474074] [2019-11-25 08:50:18,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:18,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:19,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:19,013 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:50:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:20,359 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-25 08:50:20,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:20,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-25 08:50:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:20,377 INFO L225 Difference]: With dead ends: 662 [2019-11-25 08:50:20,377 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:50:20,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:50:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-25 08:50:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-25 08:50:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-25 08:50:20,473 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 95 [2019-11-25 08:50:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:20,474 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-25 08:50:20,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-25 08:50:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:50:20,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:20,490 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:20,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1528488005, now seen corresponding path program 1 times [2019-11-25 08:50:20,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:20,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551459442] [2019-11-25 08:50:20,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:20,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551459442] [2019-11-25 08:50:20,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:20,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:20,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502187090] [2019-11-25 08:50:20,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:20,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:20,658 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-25 08:50:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:21,527 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-25 08:50:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:21,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:50:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:21,534 INFO L225 Difference]: With dead ends: 1447 [2019-11-25 08:50:21,534 INFO L226 Difference]: Without dead ends: 1052 [2019-11-25 08:50:21,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-25 08:50:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-25 08:50:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:50:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-25 08:50:21,595 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 102 [2019-11-25 08:50:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:21,596 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-25 08:50:21,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-25 08:50:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:50:21,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:21,601 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:21,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 196968702, now seen corresponding path program 1 times [2019-11-25 08:50:21,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:21,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859034405] [2019-11-25 08:50:21,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:21,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859034405] [2019-11-25 08:50:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:21,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062773225] [2019-11-25 08:50:21,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:21,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:21,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:21,740 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-25 08:50:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:22,512 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-25 08:50:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:22,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-25 08:50:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:22,517 INFO L225 Difference]: With dead ends: 1578 [2019-11-25 08:50:22,517 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:50:22,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:50:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:50:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:50:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-25 08:50:22,540 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 116 [2019-11-25 08:50:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:22,540 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-25 08:50:22,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-25 08:50:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 08:50:22,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:22,544 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:22,544 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -415435549, now seen corresponding path program 1 times [2019-11-25 08:50:22,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:22,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304047146] [2019-11-25 08:50:22,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:22,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304047146] [2019-11-25 08:50:22,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:22,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:22,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871196591] [2019-11-25 08:50:22,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:22,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:22,605 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-25 08:50:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:23,096 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-25 08:50:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:23,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-25 08:50:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:23,106 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:50:23,106 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:50:23,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:50:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-25 08:50:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-25 08:50:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-11-25 08:50:23,151 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 117 [2019-11-25 08:50:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:23,151 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-11-25 08:50:23,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-11-25 08:50:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:50:23,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:23,154 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:23,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -566505045, now seen corresponding path program 1 times [2019-11-25 08:50:23,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:23,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554292231] [2019-11-25 08:50:23,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:50:23,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554292231] [2019-11-25 08:50:23,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:23,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:23,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239204215] [2019-11-25 08:50:23,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:23,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:23,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:23,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:23,229 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-11-25 08:50:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:23,792 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-11-25 08:50:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:23,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:50:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:23,806 INFO L225 Difference]: With dead ends: 3150 [2019-11-25 08:50:23,806 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:50:23,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:50:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-25 08:50:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:50:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1842 transitions. [2019-11-25 08:50:23,853 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1842 transitions. Word has length 121 [2019-11-25 08:50:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:23,855 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1842 transitions. [2019-11-25 08:50:23,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1842 transitions. [2019-11-25 08:50:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:50:23,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:23,859 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:23,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1960003089, now seen corresponding path program 1 times [2019-11-25 08:50:23,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:23,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94804733] [2019-11-25 08:50:23,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:50:23,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94804733] [2019-11-25 08:50:23,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:23,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:23,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183482433] [2019-11-25 08:50:23,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:23,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:23,952 INFO L87 Difference]: Start difference. First operand 1576 states and 1842 transitions. Second operand 3 states. [2019-11-25 08:50:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:24,480 INFO L93 Difference]: Finished difference Result 3281 states and 3834 transitions. [2019-11-25 08:50:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:24,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:50:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:24,489 INFO L225 Difference]: With dead ends: 3281 [2019-11-25 08:50:24,490 INFO L226 Difference]: Without dead ends: 1707 [2019-11-25 08:50:24,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-25 08:50:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-25 08:50:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:50:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1842 transitions. [2019-11-25 08:50:24,533 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1842 transitions. Word has length 123 [2019-11-25 08:50:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:24,533 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1842 transitions. [2019-11-25 08:50:24,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1842 transitions. [2019-11-25 08:50:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-25 08:50:24,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:24,537 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:24,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -233111406, now seen corresponding path program 1 times [2019-11-25 08:50:24,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:24,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036059558] [2019-11-25 08:50:24,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:24,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036059558] [2019-11-25 08:50:24,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:24,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:24,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532897890] [2019-11-25 08:50:24,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:24,623 INFO L87 Difference]: Start difference. First operand 1576 states and 1842 transitions. Second operand 3 states. [2019-11-25 08:50:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:25,079 INFO L93 Difference]: Finished difference Result 3543 states and 4112 transitions. [2019-11-25 08:50:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:25,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-25 08:50:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:25,090 INFO L225 Difference]: With dead ends: 3543 [2019-11-25 08:50:25,090 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:50:25,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:50:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:50:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:50:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2125 transitions. [2019-11-25 08:50:25,135 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2125 transitions. Word has length 124 [2019-11-25 08:50:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:25,136 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2125 transitions. [2019-11-25 08:50:25,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2125 transitions. [2019-11-25 08:50:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-25 08:50:25,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:25,140 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:25,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1809298122, now seen corresponding path program 1 times [2019-11-25 08:50:25,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:25,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224749340] [2019-11-25 08:50:25,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:25,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224749340] [2019-11-25 08:50:25,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:25,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:25,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40018666] [2019-11-25 08:50:25,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:50:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:50:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:25,373 INFO L87 Difference]: Start difference. First operand 1838 states and 2125 transitions. Second operand 8 states. [2019-11-25 08:50:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:26,399 INFO L93 Difference]: Finished difference Result 3847 states and 4440 transitions. [2019-11-25 08:50:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:26,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-11-25 08:50:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:26,409 INFO L225 Difference]: With dead ends: 3847 [2019-11-25 08:50:26,410 INFO L226 Difference]: Without dead ends: 2142 [2019-11-25 08:50:26,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-25 08:50:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-25 08:50:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:50:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2113 transitions. [2019-11-25 08:50:26,456 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2113 transitions. Word has length 128 [2019-11-25 08:50:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:26,456 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2113 transitions. [2019-11-25 08:50:26,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:50:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2113 transitions. [2019-11-25 08:50:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-25 08:50:26,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:26,461 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:26,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1337337613, now seen corresponding path program 1 times [2019-11-25 08:50:26,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:26,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210604810] [2019-11-25 08:50:26,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-25 08:50:26,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210604810] [2019-11-25 08:50:26,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:26,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:26,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292346270] [2019-11-25 08:50:26,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:26,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:26,523 INFO L87 Difference]: Start difference. First operand 1838 states and 2113 transitions. Second operand 3 states. [2019-11-25 08:50:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:26,915 INFO L93 Difference]: Finished difference Result 3674 states and 4222 transitions. [2019-11-25 08:50:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:26,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-25 08:50:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:26,924 INFO L225 Difference]: With dead ends: 3674 [2019-11-25 08:50:26,924 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:50:26,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:50:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-25 08:50:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:50:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1848 transitions. [2019-11-25 08:50:26,970 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1848 transitions. Word has length 151 [2019-11-25 08:50:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:26,971 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1848 transitions. [2019-11-25 08:50:26,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1848 transitions. [2019-11-25 08:50:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-25 08:50:26,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:26,975 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:26,976 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -628114179, now seen corresponding path program 1 times [2019-11-25 08:50:26,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:26,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103656640] [2019-11-25 08:50:26,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103656640] [2019-11-25 08:50:27,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:27,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:27,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622407421] [2019-11-25 08:50:27,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:27,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:27,159 INFO L87 Difference]: Start difference. First operand 1707 states and 1848 transitions. Second operand 4 states. [2019-11-25 08:50:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:27,640 INFO L93 Difference]: Finished difference Result 3412 states and 3707 transitions. [2019-11-25 08:50:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:27,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-25 08:50:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:27,649 INFO L225 Difference]: With dead ends: 3412 [2019-11-25 08:50:27,650 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:50:27,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:50:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-25 08:50:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:50:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1960 transitions. [2019-11-25 08:50:27,686 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1960 transitions. Word has length 154 [2019-11-25 08:50:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:27,687 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1960 transitions. [2019-11-25 08:50:27,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1960 transitions. [2019-11-25 08:50:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-25 08:50:27,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:27,691 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:27,691 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1620802140, now seen corresponding path program 1 times [2019-11-25 08:50:27,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:27,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072469186] [2019-11-25 08:50:27,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:28,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072469186] [2019-11-25 08:50:28,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:28,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:50:28,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573607815] [2019-11-25 08:50:28,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:50:28,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:50:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:28,292 INFO L87 Difference]: Start difference. First operand 1838 states and 1960 transitions. Second operand 13 states. [2019-11-25 08:50:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:29,742 INFO L93 Difference]: Finished difference Result 3727 states and 3988 transitions. [2019-11-25 08:50:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:50:29,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-25 08:50:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:29,743 INFO L225 Difference]: With dead ends: 3727 [2019-11-25 08:50:29,743 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:50:29,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:50:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:50:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:50:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:50:29,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2019-11-25 08:50:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:29,747 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:50:29,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:50:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:50:29,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:50:29,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:50:29,946 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-25 08:50:30,060 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-25 08:50:30,063 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:50:30,063 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:50:30,063 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:50:30,064 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:50:30,065 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,066 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,067 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:50:30,068 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:50:30,069 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:50:30,069 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:50:30,069 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:50:30,069 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:50:30,070 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:50:30,071 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,072 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:50:30,073 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,074 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:50:30,075 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:50:30,076 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,077 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-25 08:50:30,077 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,077 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,077 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,077 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,077 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:50:30,078 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:50:30,079 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:50:30,080 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,081 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:50:30,082 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,083 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:50:30,084 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:50:30,085 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,086 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:50:30,087 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:50:30,088 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:50:30,088 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:50:30,088 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:50:30,088 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:50:30,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:30 BoogieIcfgContainer [2019-11-25 08:50:30,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:30,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:30,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:30,126 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:30,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:18" (3/4) ... [2019-11-25 08:50:30,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:50:30,159 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:50:30,160 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:50:30,364 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_958b08bd-8ffd-4051-a2e4-8919f4e715f2/bin/uautomizer/witness.graphml [2019-11-25 08:50:30,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:30,366 INFO L168 Benchmark]: Toolchain (without parser) took 13836.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.3 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -232.5 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,366 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:30,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,367 INFO L168 Benchmark]: Boogie Preprocessor took 75.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,368 INFO L168 Benchmark]: RCFGBuilder took 1210.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,368 INFO L168 Benchmark]: TraceAbstraction took 11614.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,369 INFO L168 Benchmark]: Witness Printer took 238.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:30,371 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1210.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11614.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Witness Printer took 238.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 708 SDtfs, 2582 SDslu, 139 SDs, 0 SdLazy, 6495 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1745 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9112 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1387 ConstructedInterpolants, 0 QuantifiedInterpolants, 879772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 439/439 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...